25.20/11.10 NO 25.20/11.10 25.20/11.10 Ultimate: Cannot open display: 25.20/11.10 This is Ultimate 0.1.24-8dc7c08-m 25.20/11.10 [2019-03-28 22:43:29,892 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.20/11.10 [2019-03-28 22:43:29,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.20/11.10 [2019-03-28 22:43:29,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.20/11.10 [2019-03-28 22:43:29,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.20/11.10 [2019-03-28 22:43:29,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.20/11.10 [2019-03-28 22:43:29,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.20/11.10 [2019-03-28 22:43:29,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.20/11.10 [2019-03-28 22:43:29,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.20/11.10 [2019-03-28 22:43:29,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.20/11.10 [2019-03-28 22:43:29,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.20/11.10 [2019-03-28 22:43:29,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.20/11.10 [2019-03-28 22:43:29,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.20/11.10 [2019-03-28 22:43:29,915 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.20/11.10 [2019-03-28 22:43:29,916 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.20/11.10 [2019-03-28 22:43:29,917 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.20/11.10 [2019-03-28 22:43:29,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.20/11.10 [2019-03-28 22:43:29,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.20/11.10 [2019-03-28 22:43:29,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.20/11.10 [2019-03-28 22:43:29,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.20/11.10 [2019-03-28 22:43:29,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.20/11.10 [2019-03-28 22:43:29,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.20/11.10 [2019-03-28 22:43:29,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.20/11.10 [2019-03-28 22:43:29,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.20/11.10 [2019-03-28 22:43:29,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.20/11.10 [2019-03-28 22:43:29,928 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.20/11.10 [2019-03-28 22:43:29,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.20/11.10 [2019-03-28 22:43:29,930 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.20/11.10 [2019-03-28 22:43:29,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.20/11.10 [2019-03-28 22:43:29,931 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.20/11.10 [2019-03-28 22:43:29,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.20/11.10 [2019-03-28 22:43:29,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.20/11.10 [2019-03-28 22:43:29,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.20/11.10 [2019-03-28 22:43:29,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.20/11.10 [2019-03-28 22:43:29,934 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.20/11.10 [2019-03-28 22:43:29,934 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.20/11.10 [2019-03-28 22:43:29,934 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.20/11.10 [2019-03-28 22:43:29,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.20/11.10 [2019-03-28 22:43:29,936 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.20/11.10 [2019-03-28 22:43:29,936 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.20/11.10 [2019-03-28 22:43:29,950 INFO L110 SettingsManager]: Loading preferences was successful 25.20/11.10 [2019-03-28 22:43:29,950 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.20/11.10 [2019-03-28 22:43:29,951 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.20/11.10 [2019-03-28 22:43:29,952 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.20/11.10 [2019-03-28 22:43:29,952 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.20/11.10 [2019-03-28 22:43:29,952 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.20/11.10 [2019-03-28 22:43:29,952 INFO L133 SettingsManager]: * Use SBE=true 25.20/11.10 [2019-03-28 22:43:29,952 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.20/11.10 [2019-03-28 22:43:29,953 INFO L133 SettingsManager]: * Use old map elimination=false 25.20/11.10 [2019-03-28 22:43:29,953 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.20/11.10 [2019-03-28 22:43:29,953 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.20/11.10 [2019-03-28 22:43:29,953 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.20/11.10 [2019-03-28 22:43:29,953 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.20/11.10 [2019-03-28 22:43:29,953 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.20/11.10 [2019-03-28 22:43:29,954 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:29,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.20/11.10 [2019-03-28 22:43:29,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.20/11.10 [2019-03-28 22:43:29,954 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.20/11.10 [2019-03-28 22:43:29,954 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.20/11.10 [2019-03-28 22:43:29,954 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.20/11.10 [2019-03-28 22:43:29,955 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.20/11.10 [2019-03-28 22:43:29,955 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.20/11.10 [2019-03-28 22:43:29,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.20/11.10 [2019-03-28 22:43:29,955 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.20/11.10 [2019-03-28 22:43:29,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.20/11.10 [2019-03-28 22:43:29,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.20/11.10 [2019-03-28 22:43:29,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.20/11.10 [2019-03-28 22:43:29,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.20/11.10 [2019-03-28 22:43:29,956 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.20/11.10 [2019-03-28 22:43:29,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.20/11.10 [2019-03-28 22:43:29,994 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.20/11.10 [2019-03-28 22:43:29,997 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.20/11.10 [2019-03-28 22:43:29,999 INFO L271 PluginConnector]: Initializing CDTParser... 25.20/11.10 [2019-03-28 22:43:29,999 INFO L276 PluginConnector]: CDTParser initialized 25.20/11.10 [2019-03-28 22:43:30,000 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.20/11.10 [2019-03-28 22:43:30,069 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/70b20759da8d431eb39f3c6e54c2e023/FLAGddc27ab5f 25.20/11.10 [2019-03-28 22:43:30,402 INFO L307 CDTParser]: Found 1 translation units. 25.20/11.10 [2019-03-28 22:43:30,403 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.20/11.10 [2019-03-28 22:43:30,410 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/70b20759da8d431eb39f3c6e54c2e023/FLAGddc27ab5f 25.20/11.10 [2019-03-28 22:43:30,815 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/70b20759da8d431eb39f3c6e54c2e023 25.20/11.10 [2019-03-28 22:43:30,827 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.20/11.10 [2019-03-28 22:43:30,829 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.20/11.10 [2019-03-28 22:43:30,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.20/11.10 [2019-03-28 22:43:30,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.20/11.10 [2019-03-28 22:43:30,834 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.20/11.10 [2019-03-28 22:43:30,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:43:30" (1/1) ... 25.20/11.10 [2019-03-28 22:43:30,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aff16ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:30, skipping insertion in model container 25.20/11.10 [2019-03-28 22:43:30,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:43:30" (1/1) ... 25.20/11.10 [2019-03-28 22:43:30,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.20/11.10 [2019-03-28 22:43:30,865 INFO L176 MainTranslator]: Built tables and reachable declarations 25.20/11.10 [2019-03-28 22:43:31,027 INFO L206 PostProcessor]: Analyzing one entry point: main 25.20/11.10 [2019-03-28 22:43:31,031 INFO L191 MainTranslator]: Completed pre-run 25.20/11.10 [2019-03-28 22:43:31,051 INFO L206 PostProcessor]: Analyzing one entry point: main 25.20/11.10 [2019-03-28 22:43:31,124 INFO L195 MainTranslator]: Completed translation 25.20/11.10 [2019-03-28 22:43:31,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31 WrapperNode 25.20/11.10 [2019-03-28 22:43:31,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.20/11.10 [2019-03-28 22:43:31,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.20/11.10 [2019-03-28 22:43:31,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.20/11.10 [2019-03-28 22:43:31,126 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.20/11.10 [2019-03-28 22:43:31,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.20/11.10 [2019-03-28 22:43:31,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.20/11.10 [2019-03-28 22:43:31,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.20/11.10 [2019-03-28 22:43:31,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.20/11.10 [2019-03-28 22:43:31,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.20/11.10 [2019-03-28 22:43:31,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.20/11.10 [2019-03-28 22:43:31,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.20/11.10 [2019-03-28 22:43:31,186 INFO L276 PluginConnector]: RCFGBuilder initialized 25.20/11.10 [2019-03-28 22:43:31,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (1/1) ... 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.20/11.10 [2019-03-28 22:43:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.20/11.10 [2019-03-28 22:43:31,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.20/11.10 [2019-03-28 22:43:31,405 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.20/11.10 [2019-03-28 22:43:31,406 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 25.20/11.10 [2019-03-28 22:43:31,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:43:31 BoogieIcfgContainer 25.20/11.10 [2019-03-28 22:43:31,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.20/11.10 [2019-03-28 22:43:31,408 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.20/11.10 [2019-03-28 22:43:31,408 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.20/11.10 [2019-03-28 22:43:31,410 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.20/11.10 [2019-03-28 22:43:31,411 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:43:31" (1/1) ... 25.20/11.10 [2019-03-28 22:43:31,426 INFO L313 BlockEncoder]: Initial Icfg 12 locations, 19 edges 25.20/11.10 [2019-03-28 22:43:31,427 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.20/11.10 [2019-03-28 22:43:31,428 INFO L263 BlockEncoder]: Using Maximize final states 25.20/11.10 [2019-03-28 22:43:31,428 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.20/11.10 [2019-03-28 22:43:31,429 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.20/11.10 [2019-03-28 22:43:31,431 INFO L296 BlockEncoder]: Using Remove sink states 25.20/11.10 [2019-03-28 22:43:31,432 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.20/11.10 [2019-03-28 22:43:31,432 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.20/11.10 [2019-03-28 22:43:31,448 INFO L185 BlockEncoder]: Using Use SBE 25.20/11.10 [2019-03-28 22:43:31,465 INFO L200 BlockEncoder]: SBE split 1 edges 25.20/11.10 [2019-03-28 22:43:31,470 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 25.20/11.10 [2019-03-28 22:43:31,472 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.20/11.10 [2019-03-28 22:43:31,484 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 25.20/11.10 [2019-03-28 22:43:31,486 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 25.20/11.10 [2019-03-28 22:43:31,488 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.20/11.10 [2019-03-28 22:43:31,488 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.20/11.10 [2019-03-28 22:43:31,488 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.20/11.10 [2019-03-28 22:43:31,488 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.20/11.10 [2019-03-28 22:43:31,489 INFO L313 BlockEncoder]: Encoded RCFG 8 locations, 15 edges 25.20/11.10 [2019-03-28 22:43:31,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:43:31 BasicIcfg 25.20/11.10 [2019-03-28 22:43:31,489 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.20/11.10 [2019-03-28 22:43:31,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.20/11.10 [2019-03-28 22:43:31,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.20/11.10 [2019-03-28 22:43:31,493 INFO L276 PluginConnector]: TraceAbstraction initialized 25.20/11.10 [2019-03-28 22:43:31,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:43:30" (1/4) ... 25.20/11.10 [2019-03-28 22:43:31,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb14e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:43:31, skipping insertion in model container 25.20/11.10 [2019-03-28 22:43:31,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (2/4) ... 25.20/11.10 [2019-03-28 22:43:31,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb14e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:43:31, skipping insertion in model container 25.20/11.10 [2019-03-28 22:43:31,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:43:31" (3/4) ... 25.20/11.10 [2019-03-28 22:43:31,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb14e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:43:31, skipping insertion in model container 25.20/11.10 [2019-03-28 22:43:31,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:43:31" (4/4) ... 25.20/11.10 [2019-03-28 22:43:31,497 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.20/11.10 [2019-03-28 22:43:31,507 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.20/11.10 [2019-03-28 22:43:31,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 25.20/11.10 [2019-03-28 22:43:31,532 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 25.20/11.10 [2019-03-28 22:43:31,561 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.20/11.10 [2019-03-28 22:43:31,562 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.20/11.10 [2019-03-28 22:43:31,562 INFO L383 AbstractCegarLoop]: Hoare is true 25.20/11.10 [2019-03-28 22:43:31,562 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.20/11.10 [2019-03-28 22:43:31,562 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.20/11.10 [2019-03-28 22:43:31,562 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.20/11.10 [2019-03-28 22:43:31,563 INFO L387 AbstractCegarLoop]: Difference is false 25.20/11.10 [2019-03-28 22:43:31,563 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.20/11.10 [2019-03-28 22:43:31,563 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.20/11.10 [2019-03-28 22:43:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. 25.20/11.10 [2019-03-28 22:43:31,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.20/11.10 [2019-03-28 22:43:31,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. 25.20/11.10 [2019-03-28 22:43:31,636 INFO L451 ceAbstractionStarter]: At program point L34-2(lines 11 42) the Hoare annotation is: true 25.20/11.10 [2019-03-28 22:43:31,636 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. 25.20/11.10 [2019-03-28 22:43:31,636 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 23) no Hoare annotation was computed. 25.20/11.10 [2019-03-28 22:43:31,636 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.20/11.10 [2019-03-28 22:43:31,637 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 40) no Hoare annotation was computed. 25.20/11.10 [2019-03-28 22:43:31,637 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. 25.20/11.10 [2019-03-28 22:43:31,637 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 39) no Hoare annotation was computed. 25.20/11.10 [2019-03-28 22:43:31,637 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 38) no Hoare annotation was computed. 25.20/11.10 [2019-03-28 22:43:31,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:43:31 BasicIcfg 25.20/11.10 [2019-03-28 22:43:31,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.20/11.10 [2019-03-28 22:43:31,646 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.20/11.10 [2019-03-28 22:43:31,646 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.20/11.10 [2019-03-28 22:43:31,649 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.20/11.10 [2019-03-28 22:43:31,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.20/11.10 [2019-03-28 22:43:31,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:43:30" (1/5) ... 25.20/11.10 [2019-03-28 22:43:31,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9178e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:43:31, skipping insertion in model container 25.20/11.10 [2019-03-28 22:43:31,651 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.20/11.10 [2019-03-28 22:43:31,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:43:31" (2/5) ... 25.20/11.10 [2019-03-28 22:43:31,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9178e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:43:31, skipping insertion in model container 25.20/11.10 [2019-03-28 22:43:31,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.20/11.10 [2019-03-28 22:43:31,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:43:31" (3/5) ... 25.20/11.10 [2019-03-28 22:43:31,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9178e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:43:31, skipping insertion in model container 25.20/11.10 [2019-03-28 22:43:31,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.20/11.10 [2019-03-28 22:43:31,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:43:31" (4/5) ... 25.20/11.10 [2019-03-28 22:43:31,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9178e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:43:31, skipping insertion in model container 25.20/11.10 [2019-03-28 22:43:31,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.20/11.10 [2019-03-28 22:43:31,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:43:31" (5/5) ... 25.20/11.10 [2019-03-28 22:43:31,655 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.20/11.10 [2019-03-28 22:43:31,682 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.20/11.10 [2019-03-28 22:43:31,683 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.20/11.10 [2019-03-28 22:43:31,683 INFO L375 BuchiCegarLoop]: Hoare is true 25.20/11.10 [2019-03-28 22:43:31,683 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.20/11.10 [2019-03-28 22:43:31,683 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.20/11.10 [2019-03-28 22:43:31,683 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.20/11.10 [2019-03-28 22:43:31,684 INFO L379 BuchiCegarLoop]: Difference is false 25.20/11.10 [2019-03-28 22:43:31,684 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.20/11.10 [2019-03-28 22:43:31,684 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.20/11.10 [2019-03-28 22:43:31,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. 25.20/11.10 [2019-03-28 22:43:31,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.20/11.10 [2019-03-28 22:43:31,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.10 [2019-03-28 22:43:31,706 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.10 [2019-03-28 22:43:31,713 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 25.20/11.10 [2019-03-28 22:43:31,713 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.20/11.10 [2019-03-28 22:43:31,713 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.20/11.10 [2019-03-28 22:43:31,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. 25.20/11.10 [2019-03-28 22:43:31,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.20/11.10 [2019-03-28 22:43:31,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.10 [2019-03-28 22:43:31,715 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.10 [2019-03-28 22:43:31,715 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 25.20/11.10 [2019-03-28 22:43:31,715 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.20/11.10 [2019-03-28 22:43:31,720 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 4#L34-2true 25.20/11.10 [2019-03-28 22:43:31,721 INFO L796 eck$LassoCheckResult]: Loop: 4#L34-2true [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 7#L12true [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9#L14true [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4#L34-2true 25.20/11.10 [2019-03-28 22:43:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:31,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:31,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:31,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:31,802 INFO L82 PathProgramCache]: Analyzing trace with hash 84579, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:31,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:31,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:31,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2527441, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:31,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:31,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:31,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:31,894 INFO L216 LassoAnalysis]: Preferences: 25.20/11.10 [2019-03-28 22:43:31,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.10 [2019-03-28 22:43:31,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.10 [2019-03-28 22:43:31,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.10 [2019-03-28 22:43:31,896 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.20/11.10 [2019-03-28 22:43:31,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:31,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.10 [2019-03-28 22:43:31,897 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.10 [2019-03-28 22:43:31,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 25.20/11.10 [2019-03-28 22:43:31,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.10 [2019-03-28 22:43:31,897 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.10 [2019-03-28 22:43:31,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:31,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:31,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:32,032 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.10 [2019-03-28 22:43:32,033 INFO L412 LassoAnalysis]: Checking for nontermination... 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:32,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.10 [2019-03-28 22:43:32,040 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.10 [2019-03-28 22:43:32,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.10 [2019-03-28 22:43:32,073 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:32,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.10 [2019-03-28 22:43:32,079 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.10 [2019-03-28 22:43:32,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.10 [2019-03-28 22:43:32,106 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:32,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.10 [2019-03-28 22:43:32,111 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:32,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.20/11.10 [2019-03-28 22:43:32,142 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.10 [2019-03-28 22:43:32,175 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.20/11.10 [2019-03-28 22:43:32,178 INFO L216 LassoAnalysis]: Preferences: 25.20/11.10 [2019-03-28 22:43:32,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.10 [2019-03-28 22:43:32,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.10 [2019-03-28 22:43:32,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.10 [2019-03-28 22:43:32,178 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.20/11.10 [2019-03-28 22:43:32,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:32,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.10 [2019-03-28 22:43:32,179 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.10 [2019-03-28 22:43:32,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 25.20/11.10 [2019-03-28 22:43:32,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.10 [2019-03-28 22:43:32,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.10 [2019-03-28 22:43:32,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:32,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:32,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:32,265 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.10 [2019-03-28 22:43:32,271 INFO L497 LassoAnalysis]: Using template 'affine'. 25.20/11.10 [2019-03-28 22:43:32,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.20/11.10 Termination analysis: LINEAR_WITH_GUESSES 25.20/11.10 Number of strict supporting invariants: 0 25.20/11.10 Number of non-strict supporting invariants: 1 25.20/11.10 Consider only non-deceasing supporting invariants: true 25.20/11.10 Simplify termination arguments: true 25.20/11.10 Simplify supporting invariants: trueOverapproximate stem: false 25.20/11.10 [2019-03-28 22:43:32,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.20/11.10 [2019-03-28 22:43:32,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.20/11.10 [2019-03-28 22:43:32,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.20/11.10 [2019-03-28 22:43:32,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.20/11.10 [2019-03-28 22:43:32,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.20/11.10 [2019-03-28 22:43:32,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.20/11.10 [2019-03-28 22:43:32,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.20/11.10 [2019-03-28 22:43:32,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.20/11.10 Termination analysis: LINEAR_WITH_GUESSES 25.20/11.10 Number of strict supporting invariants: 0 25.20/11.10 Number of non-strict supporting invariants: 1 25.20/11.10 Consider only non-deceasing supporting invariants: true 25.20/11.10 Simplify termination arguments: true 25.20/11.10 Simplify supporting invariants: trueOverapproximate stem: false 25.20/11.10 [2019-03-28 22:43:32,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.20/11.10 [2019-03-28 22:43:32,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.20/11.10 [2019-03-28 22:43:32,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.20/11.10 [2019-03-28 22:43:32,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.20/11.10 [2019-03-28 22:43:32,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.20/11.10 [2019-03-28 22:43:32,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.20/11.10 [2019-03-28 22:43:32,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.20/11.10 [2019-03-28 22:43:32,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.20/11.10 Termination analysis: LINEAR_WITH_GUESSES 25.20/11.10 Number of strict supporting invariants: 0 25.20/11.10 Number of non-strict supporting invariants: 1 25.20/11.10 Consider only non-deceasing supporting invariants: true 25.20/11.10 Simplify termination arguments: true 25.20/11.10 Simplify supporting invariants: trueOverapproximate stem: false 25.20/11.10 [2019-03-28 22:43:32,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.20/11.10 [2019-03-28 22:43:32,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.20/11.10 [2019-03-28 22:43:32,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.20/11.10 [2019-03-28 22:43:32,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.20/11.10 [2019-03-28 22:43:32,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.20/11.10 [2019-03-28 22:43:32,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.20/11.10 [2019-03-28 22:43:32,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.20/11.10 [2019-03-28 22:43:32,312 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.20/11.10 [2019-03-28 22:43:32,322 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.20/11.10 [2019-03-28 22:43:32,322 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 25.20/11.10 [2019-03-28 22:43:32,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.20/11.10 [2019-03-28 22:43:32,325 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.20/11.10 [2019-03-28 22:43:32,325 INFO L518 LassoAnalysis]: Proved termination. 25.20/11.10 [2019-03-28 22:43:32,325 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.20/11.10 Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 25.20/11.10 Supporting invariants [] 25.20/11.10 [2019-03-28 22:43:32,327 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.20/11.10 [2019-03-28 22:43:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:32,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 25.20/11.10 [2019-03-28 22:43:32,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.10 [2019-03-28 22:43:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:32,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 25.20/11.10 [2019-03-28 22:43:32,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.10 [2019-03-28 22:43:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.10 [2019-03-28 22:43:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:32,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 25.20/11.10 [2019-03-28 22:43:32,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.10 [2019-03-28 22:43:32,439 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 3 predicates after loop cannibalization 25.20/11.10 [2019-03-28 22:43:32,444 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 25.20/11.10 [2019-03-28 22:43:32,445 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states. Second operand 3 states. 25.20/11.10 [2019-03-28 22:43:32,573 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states.. Second operand 3 states. Result 40 states and 70 transitions. Complement of second has 6 states. 25.20/11.10 [2019-03-28 22:43:32,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 25.20/11.10 [2019-03-28 22:43:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.20/11.10 [2019-03-28 22:43:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. 25.20/11.10 [2019-03-28 22:43:32,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 3 letters. 25.20/11.10 [2019-03-28 22:43:32,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.10 [2019-03-28 22:43:32,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 4 letters. Loop has 3 letters. 25.20/11.10 [2019-03-28 22:43:32,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.10 [2019-03-28 22:43:32,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 6 letters. 25.20/11.10 [2019-03-28 22:43:32,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.10 [2019-03-28 22:43:32,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 70 transitions. 25.20/11.10 [2019-03-28 22:43:32,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 25.20/11.10 [2019-03-28 22:43:32,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 70 transitions. 25.20/11.10 [2019-03-28 22:43:32,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 25.20/11.10 [2019-03-28 22:43:32,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 25.20/11.10 [2019-03-28 22:43:32,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 70 transitions. 25.20/11.10 [2019-03-28 22:43:32,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.10 [2019-03-28 22:43:32,599 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 70 transitions. 25.20/11.10 [2019-03-28 22:43:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 70 transitions. 25.20/11.10 [2019-03-28 22:43:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. 25.20/11.10 [2019-03-28 22:43:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 25.20/11.10 [2019-03-28 22:43:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. 25.20/11.10 [2019-03-28 22:43:32,632 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 66 transitions. 25.20/11.10 [2019-03-28 22:43:32,632 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 66 transitions. 25.20/11.10 [2019-03-28 22:43:32,632 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.20/11.10 [2019-03-28 22:43:32,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 66 transitions. 25.20/11.10 [2019-03-28 22:43:32,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 25.20/11.10 [2019-03-28 22:43:32,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.10 [2019-03-28 22:43:32,634 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.10 [2019-03-28 22:43:32,635 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 25.20/11.10 [2019-03-28 22:43:32,635 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.20/11.10 [2019-03-28 22:43:32,635 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 102#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 120#L12 25.20/11.10 [2019-03-28 22:43:32,635 INFO L796 eck$LassoCheckResult]: Loop: 120#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 124#L25 [69] L25-->L27: Formula: (and (< v_ULTIMATE.start_main_~j~0_23 0) (< 0 v_ULTIMATE.start_main_~i~0_21) (= v_ULTIMATE.start_main_~i~0_20 (+ v_ULTIMATE.start_main_~i~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_23, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_23, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 125#L27 [76] L27-->L34-2: Formula: (and (>= (+ v_ULTIMATE.start_main_~j~0_8 1) 0) (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 130#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 120#L12 25.20/11.10 [2019-03-28 22:43:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2628, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:32,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:32,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash 3137193, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:32,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:32,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:32,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.10 [2019-03-28 22:43:32,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.10 [2019-03-28 22:43:32,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.20/11.10 [2019-03-28 22:43:32,682 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.10 [2019-03-28 22:43:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.20/11.10 [2019-03-28 22:43:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.20/11.10 [2019-03-28 22:43:32,686 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. cyclomatic complexity: 32 Second operand 3 states. 25.20/11.10 [2019-03-28 22:43:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.10 [2019-03-28 22:43:32,713 INFO L93 Difference]: Finished difference Result 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.20/11.10 [2019-03-28 22:43:32,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 25.20/11.10 [2019-03-28 22:43:32,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 25.20/11.10 [2019-03-28 22:43:32,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 25.20/11.10 [2019-03-28 22:43:32,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.10 [2019-03-28 22:43:32,719 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 25.20/11.10 [2019-03-28 22:43:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 25.20/11.10 [2019-03-28 22:43:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,724 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,724 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,724 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.20/11.10 [2019-03-28 22:43:32,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:32,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 25.20/11.10 [2019-03-28 22:43:32,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.10 [2019-03-28 22:43:32,726 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.10 [2019-03-28 22:43:32,726 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 25.20/11.10 [2019-03-28 22:43:32,726 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 25.20/11.10 [2019-03-28 22:43:32,726 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 170#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 172#L12 25.20/11.10 [2019-03-28 22:43:32,727 INFO L796 eck$LassoCheckResult]: Loop: 172#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 178#L25 [78] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= 0 v_ULTIMATE.start_main_~i~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 197#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 183#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 200#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 199#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 175#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 171#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 172#L12 25.20/11.10 [2019-03-28 22:43:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2628, now seen corresponding path program 2 times 25.20/11.10 [2019-03-28 22:43:32,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:32,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:32,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1482931300, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:32,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:32,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:32,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.10 [2019-03-28 22:43:32,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.10 [2019-03-28 22:43:32,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 25.20/11.10 [2019-03-28 22:43:32,790 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.10 [2019-03-28 22:43:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 25.20/11.10 [2019-03-28 22:43:32,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 25.20/11.10 [2019-03-28 22:43:32,791 INFO L87 Difference]: Start difference. First operand 32 states and 53 transitions. cyclomatic complexity: 24 Second operand 6 states. 25.20/11.10 [2019-03-28 22:43:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.10 [2019-03-28 22:43:32,883 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. 25.20/11.10 [2019-03-28 22:43:32,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.20/11.10 [2019-03-28 22:43:32,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 82 transitions. 25.20/11.10 [2019-03-28 22:43:32,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 25.20/11.10 [2019-03-28 22:43:32,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 81 transitions. 25.20/11.10 [2019-03-28 22:43:32,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 25.20/11.10 [2019-03-28 22:43:32,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 25.20/11.10 [2019-03-28 22:43:32,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 81 transitions. 25.20/11.10 [2019-03-28 22:43:32,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.10 [2019-03-28 22:43:32,890 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 81 transitions. 25.20/11.10 [2019-03-28 22:43:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 81 transitions. 25.20/11.10 [2019-03-28 22:43:32,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. 25.20/11.10 [2019-03-28 22:43:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 25.20/11.10 [2019-03-28 22:43:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,896 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,896 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,896 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.20/11.10 [2019-03-28 22:43:32,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 25.20/11.10 [2019-03-28 22:43:32,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.10 [2019-03-28 22:43:32,897 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.10 [2019-03-28 22:43:32,898 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.20/11.10 [2019-03-28 22:43:32,898 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] 25.20/11.10 [2019-03-28 22:43:32,898 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 270#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 294#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 272#L25 25.20/11.10 [2019-03-28 22:43:32,899 INFO L796 eck$LassoCheckResult]: Loop: 272#L25 [78] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= 0 v_ULTIMATE.start_main_~i~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 285#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 287#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 286#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 282#L25 [78] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= 0 v_ULTIMATE.start_main_~i~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 283#L34 [77] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (>= v_ULTIMATE.start_main_~i~0_13 (* 2 v_ULTIMATE.start_main_~j~0_13))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 296#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 271#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 272#L25 25.20/11.10 [2019-03-28 22:43:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 81540, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:32,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:32,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.10 [2019-03-28 22:43:32,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.10 [2019-03-28 22:43:32,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 25.20/11.10 [2019-03-28 22:43:32,917 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.20/11.10 [2019-03-28 22:43:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1585548461, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:32,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:32,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.10 [2019-03-28 22:43:32,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.10 [2019-03-28 22:43:32,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.20/11.10 [2019-03-28 22:43:32,939 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.10 [2019-03-28 22:43:32,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.20/11.10 [2019-03-28 22:43:32,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.20/11.10 [2019-03-28 22:43:32,939 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. cyclomatic complexity: 27 Second operand 3 states. 25.20/11.10 [2019-03-28 22:43:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.10 [2019-03-28 22:43:32,961 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.20/11.10 [2019-03-28 22:43:32,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 25.20/11.10 [2019-03-28 22:43:32,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 25.20/11.10 [2019-03-28 22:43:32,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 25.20/11.10 [2019-03-28 22:43:32,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.10 [2019-03-28 22:43:32,966 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. 25.20/11.10 [2019-03-28 22:43:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 25.20/11.10 [2019-03-28 22:43:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,971 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,971 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,971 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.20/11.10 [2019-03-28 22:43:32,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 67 transitions. 25.20/11.10 [2019-03-28 22:43:32,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 25.20/11.10 [2019-03-28 22:43:32,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.10 [2019-03-28 22:43:32,973 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.10 [2019-03-28 22:43:32,973 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.20/11.10 [2019-03-28 22:43:32,973 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] 25.20/11.10 [2019-03-28 22:43:32,974 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 363#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 364#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 365#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 372#L16 25.20/11.10 [2019-03-28 22:43:32,974 INFO L796 eck$LassoCheckResult]: Loop: 372#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 368#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 391#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 389#L25 [78] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= 0 v_ULTIMATE.start_main_~i~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 367#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 369#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 400#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 399#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 361#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 357#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 358#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 395#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 372#L16 25.20/11.10 [2019-03-28 22:43:32,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2527434, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:32,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:32,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:32,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:32,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:32,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1715145731, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:32,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:32,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:32,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 25.20/11.10 [2019-03-28 22:43:33,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.10 [2019-03-28 22:43:33,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.20/11.10 [2019-03-28 22:43:33,001 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.10 [2019-03-28 22:43:33,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.20/11.10 [2019-03-28 22:43:33,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.20/11.10 [2019-03-28 22:43:33,001 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. cyclomatic complexity: 26 Second operand 3 states. 25.20/11.10 [2019-03-28 22:43:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.10 [2019-03-28 22:43:33,024 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. 25.20/11.10 [2019-03-28 22:43:33,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.20/11.10 [2019-03-28 22:43:33,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. 25.20/11.10 [2019-03-28 22:43:33,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 25.20/11.10 [2019-03-28 22:43:33,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:33,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 25.20/11.10 [2019-03-28 22:43:33,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 25.20/11.10 [2019-03-28 22:43:33,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:33,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.10 [2019-03-28 22:43:33,029 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:33,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. 25.20/11.10 [2019-03-28 22:43:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 25.20/11.10 [2019-03-28 22:43:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:33,033 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:33,033 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:33,033 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 25.20/11.10 [2019-03-28 22:43:33,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 53 transitions. 25.20/11.10 [2019-03-28 22:43:33,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 25.20/11.10 [2019-03-28 22:43:33,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.10 [2019-03-28 22:43:33,034 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.10 [2019-03-28 22:43:33,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.20/11.10 [2019-03-28 22:43:33,035 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] 25.20/11.10 [2019-03-28 22:43:33,035 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 446#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 469#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 460#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 461#L16 25.20/11.10 [2019-03-28 22:43:33,036 INFO L796 eck$LassoCheckResult]: Loop: 461#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 447#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 448#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 463#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 457#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 458#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 481#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 480#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 451#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 452#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 479#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 476#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 461#L16 25.20/11.10 [2019-03-28 22:43:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:33,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2527434, now seen corresponding path program 2 times 25.20/11.10 [2019-03-28 22:43:33,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:33,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash -92308732, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:33,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:33,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:33,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:33,065 INFO L82 PathProgramCache]: Analyzing trace with hash -366074291, now seen corresponding path program 1 times 25.20/11.10 [2019-03-28 22:43:33,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.10 [2019-03-28 22:43:33,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.10 [2019-03-28 22:43:33,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.10 [2019-03-28 22:43:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.10 [2019-03-28 22:43:33,194 INFO L216 LassoAnalysis]: Preferences: 25.20/11.10 [2019-03-28 22:43:33,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.10 [2019-03-28 22:43:33,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.10 [2019-03-28 22:43:33,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.10 [2019-03-28 22:43:33,195 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.20/11.10 [2019-03-28 22:43:33,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:33,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.10 [2019-03-28 22:43:33,195 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.10 [2019-03-28 22:43:33,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 25.20/11.10 [2019-03-28 22:43:33,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.10 [2019-03-28 22:43:33,195 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.10 [2019-03-28 22:43:33,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:33,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:33,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:33,283 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.10 [2019-03-28 22:43:33,283 INFO L412 LassoAnalysis]: Checking for nontermination... 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:33,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.10 [2019-03-28 22:43:33,287 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.10 [2019-03-28 22:43:33,315 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.10 [2019-03-28 22:43:33,315 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:33,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.10 [2019-03-28 22:43:33,320 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.10 [2019-03-28 22:43:33,347 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.10 [2019-03-28 22:43:33,347 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:33,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.10 [2019-03-28 22:43:33,353 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.10 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.10 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:33,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.20/11.10 [2019-03-28 22:43:33,384 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.10 [2019-03-28 22:43:33,416 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.20/11.10 [2019-03-28 22:43:33,418 INFO L216 LassoAnalysis]: Preferences: 25.20/11.10 [2019-03-28 22:43:33,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.10 [2019-03-28 22:43:33,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.10 [2019-03-28 22:43:33,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.10 [2019-03-28 22:43:33,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.20/11.10 [2019-03-28 22:43:33,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.20/11.10 [2019-03-28 22:43:33,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.10 [2019-03-28 22:43:33,419 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.10 [2019-03-28 22:43:33,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 25.20/11.10 [2019-03-28 22:43:33,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.10 [2019-03-28 22:43:33,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.10 [2019-03-28 22:43:33,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:33,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:33,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.10 [2019-03-28 22:43:33,489 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.10 [2019-03-28 22:43:33,490 INFO L497 LassoAnalysis]: Using template 'affine'. 25.20/11.10 [2019-03-28 22:43:33,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.20/11.10 Termination analysis: LINEAR_WITH_GUESSES 25.20/11.10 Number of strict supporting invariants: 0 25.20/11.10 Number of non-strict supporting invariants: 1 25.20/11.10 Consider only non-deceasing supporting invariants: true 25.20/11.10 Simplify termination arguments: true 25.20/11.10 Simplify supporting invariants: trueOverapproximate stem: false 25.20/11.10 [2019-03-28 22:43:33,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.20/11.10 [2019-03-28 22:43:33,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.20/11.10 [2019-03-28 22:43:33,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.20/11.10 [2019-03-28 22:43:33,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.20/11.10 [2019-03-28 22:43:33,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.20/11.10 [2019-03-28 22:43:33,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.20/11.10 [2019-03-28 22:43:33,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.20/11.10 [2019-03-28 22:43:33,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.20/11.10 Termination analysis: LINEAR_WITH_GUESSES 25.20/11.10 Number of strict supporting invariants: 0 25.20/11.10 Number of non-strict supporting invariants: 1 25.20/11.10 Consider only non-deceasing supporting invariants: true 25.20/11.10 Simplify termination arguments: true 25.20/11.10 Simplify supporting invariants: trueOverapproximate stem: false 25.20/11.10 [2019-03-28 22:43:33,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.20/11.10 [2019-03-28 22:43:33,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.20/11.10 [2019-03-28 22:43:33,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.20/11.10 [2019-03-28 22:43:33,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.20/11.10 [2019-03-28 22:43:33,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.20/11.10 [2019-03-28 22:43:33,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.20/11.10 [2019-03-28 22:43:33,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.20/11.10 [2019-03-28 22:43:33,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.20/11.10 Termination analysis: LINEAR_WITH_GUESSES 25.20/11.10 Number of strict supporting invariants: 0 25.20/11.10 Number of non-strict supporting invariants: 1 25.20/11.10 Consider only non-deceasing supporting invariants: true 25.20/11.10 Simplify termination arguments: true 25.20/11.10 Simplify supporting invariants: trueOverapproximate stem: false 25.20/11.10 [2019-03-28 22:43:33,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.20/11.10 [2019-03-28 22:43:33,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.20/11.10 [2019-03-28 22:43:33,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.20/11.10 [2019-03-28 22:43:33,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.20/11.10 [2019-03-28 22:43:33,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.20/11.10 [2019-03-28 22:43:33,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.20/11.10 [2019-03-28 22:43:33,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.20/11.10 [2019-03-28 22:43:33,511 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.20/11.10 [2019-03-28 22:43:33,514 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.20/11.10 [2019-03-28 22:43:33,515 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 25.20/11.10 [2019-03-28 22:43:33,515 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.20/11.10 [2019-03-28 22:43:33,516 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.20/11.10 [2019-03-28 22:43:33,516 INFO L518 LassoAnalysis]: Proved termination. 25.20/11.10 [2019-03-28 22:43:33,516 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.20/11.10 Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 7 25.20/11.10 Supporting invariants [] 25.20/11.10 [2019-03-28 22:43:33,516 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.20/11.10 [2019-03-28 22:43:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.10 [2019-03-28 22:43:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:33,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 25.20/11.10 [2019-03-28 22:43:33,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.10 [2019-03-28 22:43:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:33,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.10 [2019-03-28 22:43:33,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.10 [2019-03-28 22:43:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.10 [2019-03-28 22:43:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.10 [2019-03-28 22:43:33,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:33,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:33,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:33,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:33,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:33,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:33,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:33,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:33,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:33,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:33,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:33,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:33,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:33,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:33,992 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 8 predicates after loop cannibalization 25.20/11.11 [2019-03-28 22:43:33,993 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates 25.20/11.11 [2019-03-28 22:43:33,993 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 37 states and 53 transitions. cyclomatic complexity: 18 Second operand 5 states. 25.20/11.11 [2019-03-28 22:43:34,160 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 37 states and 53 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 272 states and 399 transitions. Complement of second has 37 states. 25.20/11.11 [2019-03-28 22:43:34,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 25.20/11.11 [2019-03-28 22:43:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.20/11.11 [2019-03-28 22:43:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. 25.20/11.11 [2019-03-28 22:43:34,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 4 letters. Loop has 12 letters. 25.20/11.11 [2019-03-28 22:43:34,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.11 [2019-03-28 22:43:34,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 16 letters. Loop has 12 letters. 25.20/11.11 [2019-03-28 22:43:34,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.11 [2019-03-28 22:43:34,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 4 letters. Loop has 24 letters. 25.20/11.11 [2019-03-28 22:43:34,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.11 [2019-03-28 22:43:34,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 399 transitions. 25.20/11.11 [2019-03-28 22:43:34,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 220 25.20/11.11 [2019-03-28 22:43:34,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 242 states and 355 transitions. 25.20/11.11 [2019-03-28 22:43:34,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 25.20/11.11 [2019-03-28 22:43:34,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 25.20/11.11 [2019-03-28 22:43:34,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 355 transitions. 25.20/11.11 [2019-03-28 22:43:34,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:34,175 INFO L706 BuchiCegarLoop]: Abstraction has 242 states and 355 transitions. 25.20/11.11 [2019-03-28 22:43:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 355 transitions. 25.20/11.11 [2019-03-28 22:43:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 171. 25.20/11.11 [2019-03-28 22:43:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. 25.20/11.11 [2019-03-28 22:43:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. 25.20/11.11 [2019-03-28 22:43:34,189 INFO L729 BuchiCegarLoop]: Abstraction has 171 states and 256 transitions. 25.20/11.11 [2019-03-28 22:43:34,189 INFO L609 BuchiCegarLoop]: Abstraction has 171 states and 256 transitions. 25.20/11.11 [2019-03-28 22:43:34,190 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 25.20/11.11 [2019-03-28 22:43:34,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 256 transitions. 25.20/11.11 [2019-03-28 22:43:34,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 25.20/11.11 [2019-03-28 22:43:34,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:34,191 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:34,192 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,192 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,193 INFO L794 eck$LassoCheckResult]: Stem: 1102#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1103#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1197#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1120#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1121#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1099#L34-2 25.20/11.11 [2019-03-28 22:43:34,193 INFO L796 eck$LassoCheckResult]: Loop: 1099#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1262#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1260#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1259#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1256#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1244#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1240#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1239#L34 [77] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (>= v_ULTIMATE.start_main_~i~0_13 (* 2 v_ULTIMATE.start_main_~j~0_13))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1099#L34-2 25.20/11.11 [2019-03-28 22:43:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:34,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1355184017, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:34,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.20/11.11 [2019-03-28 22:43:34,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.20/11.11 [2019-03-28 22:43:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:34,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:34,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 25.20/11.11 [2019-03-28 22:43:34,320 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.11 [2019-03-28 22:43:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 25.20/11.11 [2019-03-28 22:43:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 25.20/11.11 [2019-03-28 22:43:34,321 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. cyclomatic complexity: 87 Second operand 8 states. 25.20/11.11 [2019-03-28 22:43:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:34,370 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. 25.20/11.11 [2019-03-28 22:43:34,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.20/11.11 [2019-03-28 22:43:34,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 220 transitions. 25.20/11.11 [2019-03-28 22:43:34,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 125 25.20/11.11 [2019-03-28 22:43:34,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 147 states and 214 transitions. 25.20/11.11 [2019-03-28 22:43:34,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 25.20/11.11 [2019-03-28 22:43:34,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 25.20/11.11 [2019-03-28 22:43:34,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 214 transitions. 25.20/11.11 [2019-03-28 22:43:34,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:34,376 INFO L706 BuchiCegarLoop]: Abstraction has 147 states and 214 transitions. 25.20/11.11 [2019-03-28 22:43:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 214 transitions. 25.20/11.11 [2019-03-28 22:43:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. 25.20/11.11 [2019-03-28 22:43:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. 25.20/11.11 [2019-03-28 22:43:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. 25.20/11.11 [2019-03-28 22:43:34,384 INFO L729 BuchiCegarLoop]: Abstraction has 143 states and 210 transitions. 25.20/11.11 [2019-03-28 22:43:34,384 INFO L609 BuchiCegarLoop]: Abstraction has 143 states and 210 transitions. 25.20/11.11 [2019-03-28 22:43:34,384 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 25.20/11.11 [2019-03-28 22:43:34,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 210 transitions. 25.20/11.11 [2019-03-28 22:43:34,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 25.20/11.11 [2019-03-28 22:43:34,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:34,386 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:34,388 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,388 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2, 2, 2, 2, 2, 1] 25.20/11.11 [2019-03-28 22:43:34,388 INFO L794 eck$LassoCheckResult]: Stem: 1451#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1452#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1574#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1572#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1457#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1459#L34-2 25.20/11.11 [2019-03-28 22:43:34,389 INFO L796 eck$LassoCheckResult]: Loop: 1459#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1547#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1527#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1546#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1544#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1542#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1540#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1526#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1570#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1473#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1474#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1591#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1589#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1590#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1557#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1495#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1553#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1551#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1510#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1459#L34-2 25.20/11.11 [2019-03-28 22:43:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:34,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1673482209, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:34,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:34,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.20/11.11 [2019-03-28 22:43:34,423 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.11 [2019-03-28 22:43:34,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.20/11.11 [2019-03-28 22:43:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.20/11.11 [2019-03-28 22:43:34,424 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. cyclomatic complexity: 69 Second operand 4 states. 25.20/11.11 [2019-03-28 22:43:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:34,461 INFO L93 Difference]: Finished difference Result 136 states and 191 transitions. 25.20/11.11 [2019-03-28 22:43:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.20/11.11 [2019-03-28 22:43:34,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 191 transitions. 25.20/11.11 [2019-03-28 22:43:34,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 25.20/11.11 [2019-03-28 22:43:34,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 136 states and 191 transitions. 25.20/11.11 [2019-03-28 22:43:34,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 25.20/11.11 [2019-03-28 22:43:34,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 25.20/11.11 [2019-03-28 22:43:34,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 191 transitions. 25.20/11.11 [2019-03-28 22:43:34,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:34,467 INFO L706 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. 25.20/11.11 [2019-03-28 22:43:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 191 transitions. 25.20/11.11 [2019-03-28 22:43:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. 25.20/11.11 [2019-03-28 22:43:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. 25.20/11.11 [2019-03-28 22:43:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 188 transitions. 25.20/11.11 [2019-03-28 22:43:34,473 INFO L729 BuchiCegarLoop]: Abstraction has 133 states and 188 transitions. 25.20/11.11 [2019-03-28 22:43:34,473 INFO L609 BuchiCegarLoop]: Abstraction has 133 states and 188 transitions. 25.20/11.11 [2019-03-28 22:43:34,473 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 25.20/11.11 [2019-03-28 22:43:34,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 188 transitions. 25.20/11.11 [2019-03-28 22:43:34,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 25.20/11.11 [2019-03-28 22:43:34,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:34,474 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:34,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,475 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 3, 3, 2, 2, 2] 25.20/11.11 [2019-03-28 22:43:34,476 INFO L794 eck$LassoCheckResult]: Stem: 1737#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1738#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1845#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1843#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1842#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1841#L34-2 25.20/11.11 [2019-03-28 22:43:34,476 INFO L796 eck$LassoCheckResult]: Loop: 1841#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1759#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1760#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1864#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1863#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1861#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1860#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1859#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1858#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1856#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1853#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1855#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1854#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1852#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1851#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1850#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1768#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1830#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1831#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1840#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1841#L34-2 25.20/11.11 [2019-03-28 22:43:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,477 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 3 times 25.20/11.11 [2019-03-28 22:43:34,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,485 INFO L82 PathProgramCache]: Analyzing trace with hash -536379552, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:34,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.20/11.11 [2019-03-28 22:43:34,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.20/11.11 [2019-03-28 22:43:34,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 25.20/11.11 [2019-03-28 22:43:34,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 25.20/11.11 [2019-03-28 22:43:34,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:34,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:34,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 25.20/11.11 [2019-03-28 22:43:34,592 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.11 [2019-03-28 22:43:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 25.20/11.11 [2019-03-28 22:43:34,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 25.20/11.11 [2019-03-28 22:43:34,593 INFO L87 Difference]: Start difference. First operand 133 states and 188 transitions. cyclomatic complexity: 57 Second operand 8 states. 25.20/11.11 [2019-03-28 22:43:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:34,686 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. 25.20/11.11 [2019-03-28 22:43:34,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 25.20/11.11 [2019-03-28 22:43:34,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 279 transitions. 25.20/11.11 [2019-03-28 22:43:34,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 140 25.20/11.11 [2019-03-28 22:43:34,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 279 transitions. 25.20/11.11 [2019-03-28 22:43:34,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 25.20/11.11 [2019-03-28 22:43:34,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 25.20/11.11 [2019-03-28 22:43:34,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 279 transitions. 25.20/11.11 [2019-03-28 22:43:34,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:34,692 INFO L706 BuchiCegarLoop]: Abstraction has 207 states and 279 transitions. 25.20/11.11 [2019-03-28 22:43:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 279 transitions. 25.20/11.11 [2019-03-28 22:43:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 149. 25.20/11.11 [2019-03-28 22:43:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. 25.20/11.11 [2019-03-28 22:43:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 202 transitions. 25.20/11.11 [2019-03-28 22:43:34,698 INFO L729 BuchiCegarLoop]: Abstraction has 149 states and 202 transitions. 25.20/11.11 [2019-03-28 22:43:34,698 INFO L609 BuchiCegarLoop]: Abstraction has 149 states and 202 transitions. 25.20/11.11 [2019-03-28 22:43:34,698 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 25.20/11.11 [2019-03-28 22:43:34,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 202 transitions. 25.20/11.11 [2019-03-28 22:43:34,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 25.20/11.11 [2019-03-28 22:43:34,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:34,700 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:34,700 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,700 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,701 INFO L794 eck$LassoCheckResult]: Stem: 2162#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 2163#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2256#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2255#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2254#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2161#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2176#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2174#L25 25.20/11.11 [2019-03-28 22:43:34,701 INFO L796 eck$LassoCheckResult]: Loop: 2174#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2175#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2289#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2287#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2177#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2179#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2292#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2293#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2296#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2155#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2156#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2174#L25 25.20/11.11 [2019-03-28 22:43:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2014551182, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:34,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1027598862, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:34,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.20/11.11 [2019-03-28 22:43:34,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.20/11.11 [2019-03-28 22:43:34,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 25.20/11.11 [2019-03-28 22:43:34,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 25.20/11.11 [2019-03-28 22:43:34,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:34,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:34,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 25.20/11.11 [2019-03-28 22:43:34,788 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.11 [2019-03-28 22:43:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.20/11.11 [2019-03-28 22:43:34,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 25.20/11.11 [2019-03-28 22:43:34,789 INFO L87 Difference]: Start difference. First operand 149 states and 202 transitions. cyclomatic complexity: 55 Second operand 5 states. 25.20/11.11 [2019-03-28 22:43:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:34,823 INFO L93 Difference]: Finished difference Result 192 states and 246 transitions. 25.20/11.11 [2019-03-28 22:43:34,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.20/11.11 [2019-03-28 22:43:34,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 246 transitions. 25.20/11.11 [2019-03-28 22:43:34,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 136 25.20/11.11 [2019-03-28 22:43:34,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 246 transitions. 25.20/11.11 [2019-03-28 22:43:34,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 25.20/11.11 [2019-03-28 22:43:34,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 25.20/11.11 [2019-03-28 22:43:34,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 246 transitions. 25.20/11.11 [2019-03-28 22:43:34,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:34,829 INFO L706 BuchiCegarLoop]: Abstraction has 192 states and 246 transitions. 25.20/11.11 [2019-03-28 22:43:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 246 transitions. 25.20/11.11 [2019-03-28 22:43:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. 25.20/11.11 [2019-03-28 22:43:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. 25.20/11.11 [2019-03-28 22:43:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 212 transitions. 25.20/11.11 [2019-03-28 22:43:34,834 INFO L729 BuchiCegarLoop]: Abstraction has 159 states and 212 transitions. 25.20/11.11 [2019-03-28 22:43:34,834 INFO L609 BuchiCegarLoop]: Abstraction has 159 states and 212 transitions. 25.20/11.11 [2019-03-28 22:43:34,834 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 25.20/11.11 [2019-03-28 22:43:34,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 212 transitions. 25.20/11.11 [2019-03-28 22:43:34,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 133 25.20/11.11 [2019-03-28 22:43:34,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:34,835 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:34,836 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,836 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,836 INFO L794 eck$LassoCheckResult]: Stem: 2534#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 2535#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2581#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2580#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2579#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2561#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2557#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2553#L25 25.20/11.11 [2019-03-28 22:43:34,837 INFO L796 eck$LassoCheckResult]: Loop: 2553#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2554#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2639#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2638#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2582#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2583#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2642#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2641#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2640#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2548#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2549#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2558#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2553#L25 25.20/11.11 [2019-03-28 22:43:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2014551182, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:34,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash -672837903, now seen corresponding path program 3 times 25.20/11.11 [2019-03-28 22:43:34,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:34,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.20/11.11 [2019-03-28 22:43:34,872 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.11 [2019-03-28 22:43:34,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.20/11.11 [2019-03-28 22:43:34,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 25.20/11.11 [2019-03-28 22:43:34,872 INFO L87 Difference]: Start difference. First operand 159 states and 212 transitions. cyclomatic complexity: 56 Second operand 5 states. 25.20/11.11 [2019-03-28 22:43:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:34,903 INFO L93 Difference]: Finished difference Result 132 states and 172 transitions. 25.20/11.11 [2019-03-28 22:43:34,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.20/11.11 [2019-03-28 22:43:34,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 172 transitions. 25.20/11.11 [2019-03-28 22:43:34,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 25.20/11.11 [2019-03-28 22:43:34,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 172 transitions. 25.20/11.11 [2019-03-28 22:43:34,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 25.20/11.11 [2019-03-28 22:43:34,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 25.20/11.11 [2019-03-28 22:43:34,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 172 transitions. 25.20/11.11 [2019-03-28 22:43:34,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:34,908 INFO L706 BuchiCegarLoop]: Abstraction has 132 states and 172 transitions. 25.20/11.11 [2019-03-28 22:43:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 172 transitions. 25.20/11.11 [2019-03-28 22:43:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. 25.20/11.11 [2019-03-28 22:43:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. 25.20/11.11 [2019-03-28 22:43:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 167 transitions. 25.20/11.11 [2019-03-28 22:43:34,911 INFO L729 BuchiCegarLoop]: Abstraction has 127 states and 167 transitions. 25.20/11.11 [2019-03-28 22:43:34,911 INFO L609 BuchiCegarLoop]: Abstraction has 127 states and 167 transitions. 25.20/11.11 [2019-03-28 22:43:34,911 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 25.20/11.11 [2019-03-28 22:43:34,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 167 transitions. 25.20/11.11 [2019-03-28 22:43:34,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 25.20/11.11 [2019-03-28 22:43:34,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:34,913 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:34,913 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,913 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1] 25.20/11.11 [2019-03-28 22:43:34,913 INFO L794 eck$LassoCheckResult]: Stem: 2843#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 2844#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2837#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2846#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2835#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2836#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2944#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2942#L16 25.20/11.11 [2019-03-28 22:43:34,914 INFO L796 eck$LassoCheckResult]: Loop: 2942#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2943#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2958#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2957#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2879#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2947#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2948#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2955#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2945#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2946#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2942#L16 25.20/11.11 [2019-03-28 22:43:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2014361716, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:34,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1352612346, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:34,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1638900783, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:34,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:34,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:34,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:34,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:34,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.20/11.11 [2019-03-28 22:43:35,010 INFO L216 LassoAnalysis]: Preferences: 25.20/11.11 [2019-03-28 22:43:35,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.11 [2019-03-28 22:43:35,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.11 [2019-03-28 22:43:35,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.11 [2019-03-28 22:43:35,010 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.20/11.11 [2019-03-28 22:43:35,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:35,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.11 [2019-03-28 22:43:35,011 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.11 [2019-03-28 22:43:35,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop 25.20/11.11 [2019-03-28 22:43:35,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.11 [2019-03-28 22:43:35,011 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.11 [2019-03-28 22:43:35,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:35,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:35,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:35,079 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.11 [2019-03-28 22:43:35,079 INFO L412 LassoAnalysis]: Checking for nontermination... 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:35,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:35,082 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:35,110 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:35,110 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:35,120 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:35,120 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:35,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:35,153 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:35,193 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.20/11.11 [2019-03-28 22:43:35,195 INFO L216 LassoAnalysis]: Preferences: 25.20/11.11 [2019-03-28 22:43:35,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.11 [2019-03-28 22:43:35,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.11 [2019-03-28 22:43:35,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.11 [2019-03-28 22:43:35,196 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.20/11.11 [2019-03-28 22:43:35,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:35,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.11 [2019-03-28 22:43:35,196 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.11 [2019-03-28 22:43:35,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop 25.20/11.11 [2019-03-28 22:43:35,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.11 [2019-03-28 22:43:35,196 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.11 [2019-03-28 22:43:35,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:35,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:35,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:35,268 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.11 [2019-03-28 22:43:35,268 INFO L497 LassoAnalysis]: Using template 'affine'. 25.20/11.11 [2019-03-28 22:43:35,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.20/11.11 Termination analysis: LINEAR_WITH_GUESSES 25.20/11.11 Number of strict supporting invariants: 0 25.20/11.11 Number of non-strict supporting invariants: 1 25.20/11.11 Consider only non-deceasing supporting invariants: true 25.20/11.11 Simplify termination arguments: true 25.20/11.11 Simplify supporting invariants: trueOverapproximate stem: false 25.20/11.11 [2019-03-28 22:43:35,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.20/11.11 [2019-03-28 22:43:35,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.20/11.11 [2019-03-28 22:43:35,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.20/11.11 [2019-03-28 22:43:35,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.20/11.11 [2019-03-28 22:43:35,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.20/11.11 [2019-03-28 22:43:35,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.20/11.11 [2019-03-28 22:43:35,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.20/11.11 [2019-03-28 22:43:35,275 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.20/11.11 [2019-03-28 22:43:35,277 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.20/11.11 [2019-03-28 22:43:35,277 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 25.20/11.11 [2019-03-28 22:43:35,277 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.20/11.11 [2019-03-28 22:43:35,277 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.20/11.11 [2019-03-28 22:43:35,277 INFO L518 LassoAnalysis]: Proved termination. 25.20/11.11 [2019-03-28 22:43:35,278 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.20/11.11 Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 25.20/11.11 Supporting invariants [] 25.20/11.11 [2019-03-28 22:43:35,278 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.20/11.11 [2019-03-28 22:43:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:35,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:35,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:35,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:35,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:35,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:35,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:35,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:35,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:35,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:35,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:35,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:35,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:35,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:35,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:35,532 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 9 predicates after loop cannibalization 25.20/11.11 [2019-03-28 22:43:35,532 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates 25.20/11.11 [2019-03-28 22:43:35,532 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 127 states and 167 transitions. cyclomatic complexity: 43 Second operand 5 states. 25.20/11.11 [2019-03-28 22:43:35,755 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 127 states and 167 transitions. cyclomatic complexity: 43. Second operand 5 states. Result 764 states and 979 transitions. Complement of second has 42 states. 25.20/11.11 [2019-03-28 22:43:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 6 non-accepting loop states 3 accepting loop states 25.20/11.11 [2019-03-28 22:43:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.20/11.11 [2019-03-28 22:43:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. 25.20/11.11 [2019-03-28 22:43:35,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 43 transitions. Stem has 7 letters. Loop has 10 letters. 25.20/11.11 [2019-03-28 22:43:35,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.11 [2019-03-28 22:43:35,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 43 transitions. Stem has 17 letters. Loop has 10 letters. 25.20/11.11 [2019-03-28 22:43:35,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.11 [2019-03-28 22:43:35,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 43 transitions. Stem has 7 letters. Loop has 20 letters. 25.20/11.11 [2019-03-28 22:43:35,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.20/11.11 [2019-03-28 22:43:35,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 764 states and 979 transitions. 25.20/11.11 [2019-03-28 22:43:35,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 146 25.20/11.11 [2019-03-28 22:43:35,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 764 states to 265 states and 328 transitions. 25.20/11.11 [2019-03-28 22:43:35,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 25.20/11.11 [2019-03-28 22:43:35,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 25.20/11.11 [2019-03-28 22:43:35,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 328 transitions. 25.20/11.11 [2019-03-28 22:43:35,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:35,839 INFO L706 BuchiCegarLoop]: Abstraction has 265 states and 328 transitions. 25.20/11.11 [2019-03-28 22:43:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 328 transitions. 25.20/11.11 [2019-03-28 22:43:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 153. 25.20/11.11 [2019-03-28 22:43:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. 25.20/11.11 [2019-03-28 22:43:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 206 transitions. 25.20/11.11 [2019-03-28 22:43:35,844 INFO L729 BuchiCegarLoop]: Abstraction has 153 states and 206 transitions. 25.20/11.11 [2019-03-28 22:43:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.20/11.11 [2019-03-28 22:43:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.20/11.11 [2019-03-28 22:43:35,845 INFO L87 Difference]: Start difference. First operand 153 states and 206 transitions. Second operand 4 states. 25.20/11.11 [2019-03-28 22:43:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:35,867 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. 25.20/11.11 [2019-03-28 22:43:35,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.20/11.11 [2019-03-28 22:43:35,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 228 transitions. 25.20/11.11 [2019-03-28 22:43:35,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 25.20/11.11 [2019-03-28 22:43:35,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 175 states and 228 transitions. 25.20/11.11 [2019-03-28 22:43:35,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 25.20/11.11 [2019-03-28 22:43:35,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 25.20/11.11 [2019-03-28 22:43:35,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 228 transitions. 25.20/11.11 [2019-03-28 22:43:35,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:35,872 INFO L706 BuchiCegarLoop]: Abstraction has 175 states and 228 transitions. 25.20/11.11 [2019-03-28 22:43:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 228 transitions. 25.20/11.11 [2019-03-28 22:43:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 153. 25.20/11.11 [2019-03-28 22:43:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. 25.20/11.11 [2019-03-28 22:43:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 206 transitions. 25.20/11.11 [2019-03-28 22:43:35,876 INFO L729 BuchiCegarLoop]: Abstraction has 153 states and 206 transitions. 25.20/11.11 [2019-03-28 22:43:35,876 INFO L609 BuchiCegarLoop]: Abstraction has 153 states and 206 transitions. 25.20/11.11 [2019-03-28 22:43:35,876 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 25.20/11.11 [2019-03-28 22:43:35,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 206 transitions. 25.20/11.11 [2019-03-28 22:43:35,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 25.20/11.11 [2019-03-28 22:43:35,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:35,877 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:35,878 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:35,878 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1] 25.20/11.11 [2019-03-28 22:43:35,878 INFO L794 eck$LassoCheckResult]: Stem: 4324#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 4325#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4360#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4421#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4422#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4450#L12 25.20/11.11 [2019-03-28 22:43:35,879 INFO L796 eck$LassoCheckResult]: Loop: 4450#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4405#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4406#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4400#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4427#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4425#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4424#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4410#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4423#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4420#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4360#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4421#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4422#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4450#L12 25.20/11.11 [2019-03-28 22:43:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:35,879 INFO L82 PathProgramCache]: Analyzing trace with hash 78350726, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:35,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:35,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:35,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:35,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash 106925335, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:35,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:35,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:35,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:35,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 25.20/11.11 [2019-03-28 22:43:35,933 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.11 [2019-03-28 22:43:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.20/11.11 [2019-03-28 22:43:35,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 25.20/11.11 [2019-03-28 22:43:35,933 INFO L87 Difference]: Start difference. First operand 153 states and 206 transitions. cyclomatic complexity: 55 Second operand 5 states. 25.20/11.11 [2019-03-28 22:43:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:35,962 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. 25.20/11.11 [2019-03-28 22:43:35,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.20/11.11 [2019-03-28 22:43:35,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 215 transitions. 25.20/11.11 [2019-03-28 22:43:35,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 25.20/11.11 [2019-03-28 22:43:35,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 159 states and 209 transitions. 25.20/11.11 [2019-03-28 22:43:35,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 25.20/11.11 [2019-03-28 22:43:35,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 25.20/11.11 [2019-03-28 22:43:35,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 209 transitions. 25.20/11.11 [2019-03-28 22:43:35,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:35,967 INFO L706 BuchiCegarLoop]: Abstraction has 159 states and 209 transitions. 25.20/11.11 [2019-03-28 22:43:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 209 transitions. 25.20/11.11 [2019-03-28 22:43:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 140. 25.20/11.11 [2019-03-28 22:43:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. 25.20/11.11 [2019-03-28 22:43:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. 25.20/11.11 [2019-03-28 22:43:35,971 INFO L729 BuchiCegarLoop]: Abstraction has 140 states and 190 transitions. 25.20/11.11 [2019-03-28 22:43:35,971 INFO L609 BuchiCegarLoop]: Abstraction has 140 states and 190 transitions. 25.20/11.11 [2019-03-28 22:43:35,971 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 25.20/11.11 [2019-03-28 22:43:35,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 190 transitions. 25.20/11.11 [2019-03-28 22:43:35,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 25.20/11.11 [2019-03-28 22:43:35,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:35,974 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:35,974 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:35,974 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:35,975 INFO L794 eck$LassoCheckResult]: Stem: 4658#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 4659#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4686#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4729#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4727#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4728#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4770#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4762#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4763#L34-2 25.20/11.11 [2019-03-28 22:43:35,975 INFO L796 eck$LassoCheckResult]: Loop: 4763#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4788#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4787#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4786#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4785#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4673#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4674#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4763#L34-2 25.20/11.11 [2019-03-28 22:43:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296300, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:35,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:35,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:35,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:36,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.20/11.11 [2019-03-28 22:43:36,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.20/11.11 [2019-03-28 22:43:36,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 25.20/11.11 [2019-03-28 22:43:36,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 25.20/11.11 [2019-03-28 22:43:36,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:36,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:36,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:36,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:36,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 25.20/11.11 [2019-03-28 22:43:36,069 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.20/11.11 [2019-03-28 22:43:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash 802769598, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:36,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,119 INFO L216 LassoAnalysis]: Preferences: 25.20/11.11 [2019-03-28 22:43:36,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.11 [2019-03-28 22:43:36,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.11 [2019-03-28 22:43:36,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.11 [2019-03-28 22:43:36,120 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.20/11.11 [2019-03-28 22:43:36,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.11 [2019-03-28 22:43:36,120 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.11 [2019-03-28 22:43:36,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop 25.20/11.11 [2019-03-28 22:43:36,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.11 [2019-03-28 22:43:36,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.11 [2019-03-28 22:43:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:36,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:36,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:36,171 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.11 [2019-03-28 22:43:36,172 INFO L412 LassoAnalysis]: Checking for nontermination... 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:36,178 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:36,204 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:36,204 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:36,208 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:36,239 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:36,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:36,250 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Honda state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=3}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:36,277 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:36,305 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:36,305 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 [2019-03-28 22:43:36,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 25.20/11.11 [2019-03-28 22:43:36,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 25.20/11.11 [2019-03-28 22:43:36,307 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. cyclomatic complexity: 56 Second operand 7 states. 25.20/11.11 [2019-03-28 22:43:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:36,354 INFO L93 Difference]: Finished difference Result 178 states and 232 transitions. 25.20/11.11 [2019-03-28 22:43:36,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 25.20/11.11 [2019-03-28 22:43:36,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 232 transitions. 25.20/11.11 [2019-03-28 22:43:36,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 25.20/11.11 [2019-03-28 22:43:36,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 178 states and 232 transitions. 25.20/11.11 [2019-03-28 22:43:36,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 25.20/11.11 [2019-03-28 22:43:36,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 25.20/11.11 [2019-03-28 22:43:36,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 232 transitions. 25.20/11.11 [2019-03-28 22:43:36,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:36,359 INFO L706 BuchiCegarLoop]: Abstraction has 178 states and 232 transitions. 25.20/11.11 [2019-03-28 22:43:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 232 transitions. 25.20/11.11 [2019-03-28 22:43:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 146. 25.20/11.11 [2019-03-28 22:43:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. 25.20/11.11 [2019-03-28 22:43:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. 25.20/11.11 [2019-03-28 22:43:36,363 INFO L729 BuchiCegarLoop]: Abstraction has 146 states and 200 transitions. 25.20/11.11 [2019-03-28 22:43:36,363 INFO L609 BuchiCegarLoop]: Abstraction has 146 states and 200 transitions. 25.20/11.11 [2019-03-28 22:43:36,363 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 25.20/11.11 [2019-03-28 22:43:36,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 200 transitions. 25.20/11.11 [2019-03-28 22:43:36,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 25.20/11.11 [2019-03-28 22:43:36,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:36,364 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:36,365 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:36,365 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1] 25.20/11.11 [2019-03-28 22:43:36,365 INFO L794 eck$LassoCheckResult]: Stem: 5009#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5010#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5033#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5139#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5138#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5137#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5136#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5121#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5093#L34-2 25.20/11.11 [2019-03-28 22:43:36,366 INFO L796 eck$LassoCheckResult]: Loop: 5093#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5011#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5012#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5135#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5143#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5142#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5141#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5081#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5082#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5122#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5093#L34-2 25.20/11.11 [2019-03-28 22:43:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296319, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:36,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash 937684527, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:36,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:36,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 25.20/11.11 [2019-03-28 22:43:36,409 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.20/11.11 [2019-03-28 22:43:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 25.20/11.11 [2019-03-28 22:43:36,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 25.20/11.11 [2019-03-28 22:43:36,410 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. cyclomatic complexity: 60 Second operand 7 states. 25.20/11.11 [2019-03-28 22:43:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:36,464 INFO L93 Difference]: Finished difference Result 252 states and 305 transitions. 25.20/11.11 [2019-03-28 22:43:36,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 25.20/11.11 [2019-03-28 22:43:36,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 305 transitions. 25.20/11.11 [2019-03-28 22:43:36,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 25.20/11.11 [2019-03-28 22:43:36,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 149 states and 173 transitions. 25.20/11.11 [2019-03-28 22:43:36,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 25.20/11.11 [2019-03-28 22:43:36,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 25.20/11.11 [2019-03-28 22:43:36,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 173 transitions. 25.20/11.11 [2019-03-28 22:43:36,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:36,469 INFO L706 BuchiCegarLoop]: Abstraction has 149 states and 173 transitions. 25.20/11.11 [2019-03-28 22:43:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 173 transitions. 25.20/11.11 [2019-03-28 22:43:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. 25.20/11.11 [2019-03-28 22:43:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. 25.20/11.11 [2019-03-28 22:43:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. 25.20/11.11 [2019-03-28 22:43:36,473 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 109 transitions. 25.20/11.11 [2019-03-28 22:43:36,473 INFO L609 BuchiCegarLoop]: Abstraction has 89 states and 109 transitions. 25.20/11.11 [2019-03-28 22:43:36,473 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ 25.20/11.11 [2019-03-28 22:43:36,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 109 transitions. 25.20/11.11 [2019-03-28 22:43:36,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.20/11.11 [2019-03-28 22:43:36,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:36,474 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:36,474 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:36,474 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:36,475 INFO L794 eck$LassoCheckResult]: Stem: 5417#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5418#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5449#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5479#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5478#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5474#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5475#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5471#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5407#L34-2 25.20/11.11 [2019-03-28 22:43:36,475 INFO L796 eck$LassoCheckResult]: Loop: 5407#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5408#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5419#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5466#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5410#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5464#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5465#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5407#L34-2 25.20/11.11 [2019-03-28 22:43:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296319, now seen corresponding path program 2 times 25.20/11.11 [2019-03-28 22:43:36,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,483 INFO L82 PathProgramCache]: Analyzing trace with hash 802769598, now seen corresponding path program 3 times 25.20/11.11 [2019-03-28 22:43:36,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1880440512, now seen corresponding path program 1 times 25.20/11.11 [2019-03-28 22:43:36,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:36,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.20/11.11 [2019-03-28 22:43:36,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.20/11.11 [2019-03-28 22:43:36,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.20/11.11 [2019-03-28 22:43:36,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 25.20/11.11 [2019-03-28 22:43:36,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.20/11.11 [2019-03-28 22:43:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.20/11.11 [2019-03-28 22:43:36,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.20/11.11 [2019-03-28 22:43:36,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 25.20/11.11 [2019-03-28 22:43:36,619 INFO L216 LassoAnalysis]: Preferences: 25.20/11.11 [2019-03-28 22:43:36,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.11 [2019-03-28 22:43:36,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.11 [2019-03-28 22:43:36,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.11 [2019-03-28 22:43:36,619 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.20/11.11 [2019-03-28 22:43:36,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.11 [2019-03-28 22:43:36,620 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.11 [2019-03-28 22:43:36,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop 25.20/11.11 [2019-03-28 22:43:36,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.11 [2019-03-28 22:43:36,620 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.11 [2019-03-28 22:43:36,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:36,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:36,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:36,694 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.11 [2019-03-28 22:43:36,694 INFO L412 LassoAnalysis]: Checking for nontermination... 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:36,699 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:36,731 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:36,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:36,743 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Honda state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}] Lambdas: [1, 0, 1] Nus: [0, 1] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:36,770 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:36,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:36,798 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_8=1} Honda state: {v_rep~unnamed0~0~true_8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:36,803 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:36,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:36,832 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_8=0} Honda state: {v_rep~unnamed0~0~false_8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 [2019-03-28 22:43:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.20/11.11 [2019-03-28 22:43:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 25.20/11.11 [2019-03-28 22:43:36,834 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. cyclomatic complexity: 23 Second operand 5 states. 25.20/11.11 [2019-03-28 22:43:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.20/11.11 [2019-03-28 22:43:36,871 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. 25.20/11.11 [2019-03-28 22:43:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.20/11.11 [2019-03-28 22:43:36,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 118 transitions. 25.20/11.11 [2019-03-28 22:43:36,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.20/11.11 [2019-03-28 22:43:36,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 82 states and 96 transitions. 25.20/11.11 [2019-03-28 22:43:36,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 25.20/11.11 [2019-03-28 22:43:36,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 25.20/11.11 [2019-03-28 22:43:36,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 96 transitions. 25.20/11.11 [2019-03-28 22:43:36,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.20/11.11 [2019-03-28 22:43:36,875 INFO L706 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. 25.20/11.11 [2019-03-28 22:43:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 96 transitions. 25.20/11.11 [2019-03-28 22:43:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. 25.20/11.11 [2019-03-28 22:43:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. 25.20/11.11 [2019-03-28 22:43:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. 25.20/11.11 [2019-03-28 22:43:36,877 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. 25.20/11.11 [2019-03-28 22:43:36,877 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. 25.20/11.11 [2019-03-28 22:43:36,877 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ 25.20/11.11 [2019-03-28 22:43:36,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. 25.20/11.11 [2019-03-28 22:43:36,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.20/11.11 [2019-03-28 22:43:36,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.20/11.11 [2019-03-28 22:43:36,878 INFO L119 BuchiIsEmpty]: Starting construction of run 25.20/11.11 [2019-03-28 22:43:36,879 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1] 25.20/11.11 [2019-03-28 22:43:36,879 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] 25.20/11.11 [2019-03-28 22:43:36,879 INFO L794 eck$LassoCheckResult]: Stem: 5657#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5658#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5689#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5712#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5654#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5656#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5661#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5666#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5710#L12 25.20/11.11 [2019-03-28 22:43:36,879 INFO L796 eck$LassoCheckResult]: Loop: 5710#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5709#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5647#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5648#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5659#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5660#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5711#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5710#L12 25.20/11.11 [2019-03-28 22:43:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296516, now seen corresponding path program 3 times 25.20/11.11 [2019-03-28 22:43:36,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1101395972, now seen corresponding path program 4 times 25.20/11.11 [2019-03-28 22:43:36,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.20/11.11 [2019-03-28 22:43:36,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1915319201, now seen corresponding path program 3 times 25.20/11.11 [2019-03-28 22:43:36,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.20/11.11 [2019-03-28 22:43:36,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.20/11.11 [2019-03-28 22:43:36,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.20/11.11 [2019-03-28 22:43:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.20/11.11 [2019-03-28 22:43:36,958 INFO L216 LassoAnalysis]: Preferences: 25.20/11.11 [2019-03-28 22:43:36,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.11 [2019-03-28 22:43:36,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.11 [2019-03-28 22:43:36,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.11 [2019-03-28 22:43:36,958 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.20/11.11 [2019-03-28 22:43:36,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:36,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.11 [2019-03-28 22:43:36,959 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.11 [2019-03-28 22:43:36,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop 25.20/11.11 [2019-03-28 22:43:36,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.11 [2019-03-28 22:43:36,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.11 [2019-03-28 22:43:36,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:36,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:36,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:37,015 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.11 [2019-03-28 22:43:37,015 INFO L412 LassoAnalysis]: Checking for nontermination... 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,018 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:37,045 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:37,045 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,050 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:37,077 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:37,077 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,081 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,110 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:37,121 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:37,121 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=4, ULTIMATE.start_main_~i~0=7} Honda state: {ULTIMATE.start_main_~j~0=4, ULTIMATE.start_main_~i~0=7} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=3}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 25.20/11.11 [2019-03-28 22:43:37,180 INFO L216 LassoAnalysis]: Preferences: 25.20/11.11 [2019-03-28 22:43:37,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.20/11.11 [2019-03-28 22:43:37,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.20/11.11 [2019-03-28 22:43:37,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.20/11.11 [2019-03-28 22:43:37,181 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.20/11.11 [2019-03-28 22:43:37,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.20/11.11 [2019-03-28 22:43:37,181 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.20/11.11 [2019-03-28 22:43:37,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Lasso 25.20/11.11 [2019-03-28 22:43:37,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.20/11.11 [2019-03-28 22:43:37,181 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.20/11.11 [2019-03-28 22:43:37,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:37,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:37,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:37,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:37,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.20/11.11 [2019-03-28 22:43:37,249 INFO L300 LassoAnalysis]: Preprocessing complete. 25.20/11.11 [2019-03-28 22:43:37,250 INFO L412 LassoAnalysis]: Checking for nontermination... 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,253 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:37,256 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:37,256 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,282 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,313 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:37,324 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:37,324 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=0} Honda state: {ULTIMATE.start_main_~i~0=8, ULTIMATE.start_main_~j~0=4} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~j~0=0}, {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=0}, {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,351 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:37,354 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:37,354 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,380 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:37,408 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:37,408 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_10=0} Honda state: {v_rep~unnamed0~0~false_10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.20/11.11 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.20/11.11 Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.20/11.11 [2019-03-28 22:43:37,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.20/11.11 [2019-03-28 22:43:37,412 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.20/11.11 [2019-03-28 22:43:37,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.20/11.11 [2019-03-28 22:43:37,440 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_10=1} Honda state: {v_rep~unnamed0~0~true_10=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.20/11.11 [2019-03-28 22:43:37,449 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,450 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,451 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,451 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,452 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,452 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,452 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,453 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,453 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,453 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:43:37 BasicIcfg 25.20/11.11 [2019-03-28 22:43:37,466 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.20/11.11 [2019-03-28 22:43:37,466 INFO L168 Benchmark]: Toolchain (without parser) took 6639.05 ms. Allocated memory was 649.6 MB in the beginning and 769.1 MB in the end (delta: 119.5 MB). Free memory was 563.9 MB in the beginning and 423.2 MB in the end (delta: 140.7 MB). Peak memory consumption was 260.2 MB. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,468 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.41 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 563.9 MB in the beginning and 643.3 MB in the end (delta: -79.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.23 ms. Allocated memory is still 675.8 MB. Free memory was 643.3 MB in the beginning and 642.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,469 INFO L168 Benchmark]: Boogie Preprocessor took 20.92 ms. Allocated memory is still 675.8 MB. Free memory was 642.0 MB in the beginning and 638.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,470 INFO L168 Benchmark]: RCFGBuilder took 221.67 ms. Allocated memory is still 675.8 MB. Free memory was 638.9 MB in the beginning and 624.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,470 INFO L168 Benchmark]: BlockEncodingV2 took 81.55 ms. Allocated memory is still 675.8 MB. Free memory was 624.6 MB in the beginning and 619.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,471 INFO L168 Benchmark]: TraceAbstraction took 155.43 ms. Allocated memory is still 675.8 MB. Free memory was 617.8 MB in the beginning and 609.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,471 INFO L168 Benchmark]: BuchiAutomizer took 5819.74 ms. Allocated memory was 675.8 MB in the beginning and 769.1 MB in the end (delta: 93.3 MB). Free memory was 609.5 MB in the beginning and 423.2 MB in the end (delta: 186.3 MB). Peak memory consumption was 279.6 MB. Max. memory is 50.3 GB. 25.20/11.11 [2019-03-28 22:43:37,475 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.20/11.11 --- Results --- 25.20/11.11 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.20/11.11 - StatisticsResult: Initial Icfg 25.20/11.11 12 locations, 19 edges 25.20/11.11 - StatisticsResult: Encoded RCFG 25.20/11.11 8 locations, 15 edges 25.20/11.11 * Results from de.uni_freiburg.informatik.ultimate.core: 25.20/11.11 - StatisticsResult: Toolchain Benchmarks 25.20/11.11 Benchmark results are: 25.20/11.11 * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.20/11.11 * CACSL2BoogieTranslator took 295.41 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 563.9 MB in the beginning and 643.3 MB in the end (delta: -79.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 25.20/11.11 * Boogie Procedure Inliner took 38.23 ms. Allocated memory is still 675.8 MB. Free memory was 643.3 MB in the beginning and 642.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.20/11.11 * Boogie Preprocessor took 20.92 ms. Allocated memory is still 675.8 MB. Free memory was 642.0 MB in the beginning and 638.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.20/11.11 * RCFGBuilder took 221.67 ms. Allocated memory is still 675.8 MB. Free memory was 638.9 MB in the beginning and 624.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 25.20/11.11 * BlockEncodingV2 took 81.55 ms. Allocated memory is still 675.8 MB. Free memory was 624.6 MB in the beginning and 619.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 25.20/11.11 * TraceAbstraction took 155.43 ms. Allocated memory is still 675.8 MB. Free memory was 617.8 MB in the beginning and 609.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 50.3 GB. 25.20/11.11 * BuchiAutomizer took 5819.74 ms. Allocated memory was 675.8 MB in the beginning and 769.1 MB in the end (delta: 93.3 MB). Free memory was 609.5 MB in the beginning and 423.2 MB in the end (delta: 186.3 MB). Peak memory consumption was 279.6 MB. Max. memory is 50.3 GB. 25.20/11.11 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 - GenericResult: Unfinished Backtranslation 25.20/11.11 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.20/11.11 - AllSpecificationsHoldResult: All specifications hold 25.20/11.11 We were not able to verify any specifiation because the program does not contain any specification. 25.20/11.11 - InvariantResult [Line: 11]: Loop Invariant 25.20/11.11 Derived loop invariant: 1 25.20/11.11 - StatisticsResult: Ultimate Automizer benchmark data 25.20/11.11 CFG has 1 procedures, 8 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 25.20/11.11 - StatisticsResult: Constructed decomposition of program 25.20/11.11 Your program was decomposed into 17 terminating modules (14 trivial, 0 deterministic, 3 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 7 and consists of 6 locations. One nondeterministic module has affine ranking function j and consists of 11 locations. 14 modules have a trivial ranking function, the largest among these consists of 8 locations. The remainder module has 67 locations. 25.20/11.11 - StatisticsResult: Timing statistics 25.20/11.11 BüchiAutomizer plugin needed 5.7s and 17 iterations. TraceHistogramMax:5. Analysis of lassos took 3.4s. Construction of modules took 0.6s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 17. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 446 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 171 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 15/17 HoareTripleCheckerStatistics: 84 SDtfs, 147 SDslu, 46 SDs, 0 SdLazy, 678 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT2 conc1 concLT1 SILN1 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax155 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf93 smp96 dnf100 smp100 tf106 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s 25.20/11.11 - TerminationAnalysisResult: Nontermination possible 25.20/11.11 Buchi Automizer proved that your program is nonterminating for some inputs 25.20/11.11 - GeometricNonTerminationArgumentResult [Line: 12]: Nontermination argument in form of an infinite program execution. 25.20/11.11 [2019-03-28 22:43:37,483 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,483 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,489 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 [2019-03-28 22:43:37,489 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 25.20/11.11 [2019-03-28 22:43:37,489 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 25.20/11.11 Nontermination argument in form of an infinite execution 25.20/11.11 {|ULTIMATE.start_main_#t~nondet0|=0, ~unnamed0~0~true=1, ULTIMATE.start_main_~i~0=0, ~unnamed0~0~false=0, ULTIMATE.start_main_~j~0=0, |ULTIMATE.start_main_#res|=0} 25.20/11.11 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fce1b1f=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=8, j=4} 25.20/11.11 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fce1b1f=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=11, j=4} 25.20/11.11 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fce1b1f=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=14, j=4} 25.20/11.11 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fce1b1f=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=17, j=4} 25.20/11.11 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fce1b1f=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=20, j=4} 25.20/11.11 - StatisticsResult: NonterminationArgumentStatistics 25.20/11.11 Unbounded Execution 1GEVs Lambdas: [1, 0, 0] Mus: [0, 0] 25.20/11.11 - NonterminatingLassoResult [Line: 12]: Nonterminating execution 25.20/11.11 Found a nonterminating execution for the following lasso shaped sequence of statements. 25.20/11.11 Stem: 25.20/11.11 [L6] int i; 25.20/11.11 [L7] int j; 25.20/11.11 [L8] i = __VERIFIER_nondet_int() 25.20/11.11 [L9] j = i 25.20/11.11 [L11] COND TRUE i > 0 25.20/11.11 [L12] COND TRUE i >= j 25.20/11.11 [L13] i = i+1 25.20/11.11 [L14] COND FALSE !(j < 5) 25.20/11.11 [L22] j = j-1 25.20/11.11 [L11] COND TRUE i > 0 25.20/11.11 [L12] COND TRUE i >= j 25.20/11.11 [L13] i = i+1 25.20/11.11 [L14] COND FALSE !(j < 5) 25.20/11.11 [L22] j = j-1 25.20/11.11 [L11] COND TRUE i > 0 25.20/11.11 Loop: 25.20/11.11 [L12] COND TRUE i >= j 25.20/11.11 [L13] i = i+1 25.20/11.11 [L14] COND TRUE j < 5 25.20/11.11 [L15] j = j+1 25.20/11.11 [L16] COND TRUE i-j>2 25.20/11.11 [L17] i = i+1 25.20/11.11 [L11] COND TRUE i > 0 25.20/11.11 [L12] COND TRUE i >= j 25.20/11.11 [L13] i = i+1 25.20/11.11 [L14] COND FALSE !(j < 5) 25.20/11.11 [L22] j = j-1 25.20/11.11 [L11] COND TRUE i > 0 25.20/11.11 End of lasso representation. 25.20/11.11 RESULT: Ultimate proved your program to be incorrect! 25.20/11.11 !SESSION 2019-03-28 22:43:27.601 ----------------------------------------------- 25.20/11.11 eclipse.buildId=unknown 25.20/11.11 java.version=1.8.0_181 25.20/11.11 java.vendor=Oracle Corporation 25.20/11.11 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.20/11.11 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.20/11.11 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.20/11.11 25.20/11.11 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:43:37.717 25.20/11.11 !MESSAGE The workspace will exit with unsaved changes in this session. 25.20/11.11 Received shutdown request... 25.20/11.11 Ultimate: 25.20/11.11 GTK+ Version Check 25.20/11.11 EOF