./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4073cc5fe0afdc3910807054eaaf7f0047f472ba2d7a571a291a999e2fa35b78 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:49:25,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:49:25,896 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-06 22:49:25,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:49:25,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:49:25,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:49:25,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:49:25,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:49:25,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:49:25,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:49:25,936 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:49:25,937 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 22:49:25,938 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 22:49:25,938 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 22:49:25,939 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 22:49:25,940 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 22:49:25,941 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 22:49:25,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:49:25,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 22:49:25,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:49:25,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:49:25,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 22:49:25,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 22:49:25,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 22:49:25,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:49:25,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:49:25,948 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 22:49:25,948 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:49:25,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:49:25,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:49:25,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:49:25,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:49:25,952 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 22:49:25,953 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4073cc5fe0afdc3910807054eaaf7f0047f472ba2d7a571a291a999e2fa35b78 [2023-11-06 22:49:26,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:49:26,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:49:26,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:49:26,320 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:49:26,321 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:49:26,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2023-11-06 22:49:29,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:49:29,649 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:49:29,662 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2023-11-06 22:49:29,683 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/data/09e215dbd/a5918a0f7ba342ab852b77703d96205a/FLAGc94f54a9e [2023-11-06 22:49:29,704 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/data/09e215dbd/a5918a0f7ba342ab852b77703d96205a [2023-11-06 22:49:29,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:49:29,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:49:29,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:29,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:49:29,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:49:29,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:29" (1/1) ... [2023-11-06 22:49:29,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8b2de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:29, skipping insertion in model container [2023-11-06 22:49:29,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:29" (1/1) ... [2023-11-06 22:49:29,787 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:49:30,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:30,186 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:49:30,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:30,317 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:49:30,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30 WrapperNode [2023-11-06 22:49:30,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:30,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:30,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:49:30,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:49:30,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,410 INFO L138 Inliner]: procedures = 111, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2023-11-06 22:49:30,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:30,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:49:30,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:49:30,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:49:30,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:49:30,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:49:30,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:49:30,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:49:30,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (1/1) ... [2023-11-06 22:49:30,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:30,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:30,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:30,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 22:49:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:49:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:49:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:49:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:49:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:49:30,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:49:30,719 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:49:30,721 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:49:30,978 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:49:30,984 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:49:30,985 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:49:30,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:30 BoogieIcfgContainer [2023-11-06 22:49:30,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:49:30,988 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 22:49:30,989 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 22:49:30,997 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 22:49:30,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:49:30,998 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 10:49:29" (1/3) ... [2023-11-06 22:49:30,999 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a3fe66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:49:30, skipping insertion in model container [2023-11-06 22:49:31,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:49:31,000 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:30" (2/3) ... [2023-11-06 22:49:31,002 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a3fe66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:49:31, skipping insertion in model container [2023-11-06 22:49:31,002 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:49:31,003 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:30" (3/3) ... [2023-11-06 22:49:31,004 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-2.i [2023-11-06 22:49:31,070 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 22:49:31,070 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 22:49:31,070 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 22:49:31,070 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 22:49:31,071 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 22:49:31,071 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 22:49:31,071 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 22:49:31,071 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 22:49:31,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:31,097 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-06 22:49:31,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:31,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:31,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-06 22:49:31,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:49:31,108 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 22:49:31,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:31,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-06 22:49:31,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:31,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:31,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-06 22:49:31,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:49:31,121 INFO L748 eck$LassoCheckResult]: Stem: 20#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3#L565true assume !(main_~array_size~0#1 < 1); 18#L565-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4#L552-3true [2023-11-06 22:49:31,122 INFO L750 eck$LassoCheckResult]: Loop: 4#L552-3true assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15#L552-2true lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4#L552-3true [2023-11-06 22:49:31,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2023-11-06 22:49:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997646973] [2023-11-06 22:49:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:31,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:31,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:31,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:31,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2023-11-06 22:49:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040125956] [2023-11-06 22:49:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:31,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:31,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:31,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2023-11-06 22:49:31,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:31,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684192619] [2023-11-06 22:49:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:31,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:31,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:32,602 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:49:32,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:49:32,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:49:32,603 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:49:32,603 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:49:32,603 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:32,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:49:32,604 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:49:32,604 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration1_Lasso [2023-11-06 22:49:32,604 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:49:32,605 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:49:32,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:32,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:33,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:34,166 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:49:34,172 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:49:34,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:34,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:34,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:34,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-06 22:49:34,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:34,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:34,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:34,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:34,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:34,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:34,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:34,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:34,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:34,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:34,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:34,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:34,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:34,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:34,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:34,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:34,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:34,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:34,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-06 22:49:34,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:34,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:34,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:34,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:34,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:34,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:34,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:34,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:34,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:34,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:34,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:34,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:34,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:34,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:34,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:34,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-06 22:49:34,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:34,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:34,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:34,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:34,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:34,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-06 22:49:34,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:34,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:34,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:34,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:34,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:34,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:34,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:49:34,540 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2023-11-06 22:49:34,541 INFO L444 ModelExtractionUtils]: 6 out of 37 variables were initially zero. Simplification set additionally 28 variables to zero. [2023-11-06 22:49:34,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:34,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:34,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:34,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-06 22:49:34,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:49:34,622 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:49:34,622 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:49:34,623 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2023-11-06 22:49:34,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:34,707 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2023-11-06 22:49:34,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:34,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:49:34,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:34,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:49:34,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:34,857 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-06 22:49:34,859 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:34,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 64 transitions. Complement of second has 8 states. [2023-11-06 22:49:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:49:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2023-11-06 22:49:34,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-06 22:49:34,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:34,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2023-11-06 22:49:34,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:34,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2023-11-06 22:49:34,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:34,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2023-11-06 22:49:34,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-06 22:49:34,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2023-11-06 22:49:34,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-11-06 22:49:34,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-06 22:49:34,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2023-11-06 22:49:34,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:34,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-11-06 22:49:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2023-11-06 22:49:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-06 22:49:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2023-11-06 22:49:34,987 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-11-06 22:49:34,987 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-11-06 22:49:34,988 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 22:49:34,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2023-11-06 22:49:34,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-06 22:49:34,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:34,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:34,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:49:34,992 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:49:34,992 INFO L748 eck$LassoCheckResult]: Stem: 189#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 172#L565 assume !(main_~array_size~0#1 < 1); 173#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 174#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 176#L552-4 lis_~i~0#1 := 1; 178#L554-3 [2023-11-06 22:49:34,992 INFO L750 eck$LassoCheckResult]: Loop: 178#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 179#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 180#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 178#L554-3 [2023-11-06 22:49:34,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2023-11-06 22:49:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434635903] [2023-11-06 22:49:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:34,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:35,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:35,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434635903] [2023-11-06 22:49:35,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434635903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:35,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:35,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:49:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887197332] [2023-11-06 22:49:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:35,146 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:49:35,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:35,146 INFO L85 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2023-11-06 22:49:35,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420867373] [2023-11-06 22:49:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:35,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:35,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:35,182 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:49:35,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:49:35,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:49:35,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:49:35,182 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:49:35,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:49:35,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:49:35,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2023-11-06 22:49:35,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:49:35,183 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:49:35,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:49:35,268 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:49:35,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:49:35,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:49:35,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-06 22:49:35,329 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:49:35,329 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_lis_#t~post5#1=0} Honda state: {ULTIMATE.start_lis_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:49:35,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:35,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:49:35,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:49:35,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-06 22:49:35,376 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:49:35,376 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:49:35,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:35,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:49:35,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:49:35,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-06 22:49:35,424 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:49:35,425 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:49:35,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:35,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:49:35,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:49:35,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-06 22:49:35,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:35,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,486 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:49:35,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:49:35,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-06 22:49:35,528 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:49:35,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:35,538 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:49:35,538 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:49:35,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:49:35,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:49:35,538 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:49:35,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:49:35,539 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:49:35,539 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2023-11-06 22:49:35,539 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:49:35,539 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:49:35,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:35,622 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:49:35,623 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:49:35,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,624 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-06 22:49:35,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:35,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:35,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:35,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:35,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:35,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:35,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:35,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:35,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:35,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:35,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,671 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-06 22:49:35,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:35,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:35,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:35,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:35,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:35,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:35,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:35,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:35,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-11-06 22:49:35,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,728 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-06 22:49:35,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:35,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:35,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:35,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:35,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:35,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:35,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:35,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:35,760 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:49:35,766 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:49:35,766 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:49:35,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:35,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:35,775 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:35,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:49:35,783 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:49:35,783 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:49:35,783 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2023-11-06 22:49:35,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-06 22:49:35,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:35,798 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:49:35,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:49:35,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,849 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:49:35,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:35,894 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-06 22:49:35,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:35,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:35,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-06 22:49:36,028 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 84 transitions. Complement of second has 10 states. [2023-11-06 22:49:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-06 22:49:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2023-11-06 22:49:36,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2023-11-06 22:49:36,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:36,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2023-11-06 22:49:36,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:36,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2023-11-06 22:49:36,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:36,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2023-11-06 22:49:36,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-11-06 22:49:36,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2023-11-06 22:49:36,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-11-06 22:49:36,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-11-06 22:49:36,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2023-11-06 22:49:36,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:36,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 57 transitions. [2023-11-06 22:49:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2023-11-06 22:49:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-11-06 22:49:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2023-11-06 22:49:36,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 45 transitions. [2023-11-06 22:49:36,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:36,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:49:36,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:49:36,070 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:36,138 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2023-11-06 22:49:36,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2023-11-06 22:49:36,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-06 22:49:36,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2023-11-06 22:49:36,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-06 22:49:36,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-11-06 22:49:36,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2023-11-06 22:49:36,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:36,145 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 45 transitions. [2023-11-06 22:49:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2023-11-06 22:49:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-11-06 22:49:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2023-11-06 22:49:36,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 44 transitions. [2023-11-06 22:49:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:49:36,155 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2023-11-06 22:49:36,156 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 22:49:36,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2023-11-06 22:49:36,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-06 22:49:36,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:36,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:36,158 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:36,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:36,159 INFO L748 eck$LassoCheckResult]: Stem: 383#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 356#L565 assume !(main_~array_size~0#1 < 1); 357#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 358#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 359#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 360#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 361#L552-4 lis_~i~0#1 := 1; 362#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 363#L555-3 [2023-11-06 22:49:36,159 INFO L750 eck$LassoCheckResult]: Loop: 363#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 364#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 370#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 372#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 374#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 379#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 380#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 363#L555-3 [2023-11-06 22:49:36,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2023-11-06 22:49:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:36,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310921068] [2023-11-06 22:49:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310921068] [2023-11-06 22:49:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310921068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702223094] [2023-11-06 22:49:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:36,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:36,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:36,325 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:36,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:49:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:36,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:49:36,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:36,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:36,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702223094] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:36,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:36,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-06 22:49:36,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150204854] [2023-11-06 22:49:36,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:36,459 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:49:36,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2023-11-06 22:49:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878761735] [2023-11-06 22:49:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:36,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:36,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:49:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:49:36,879 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:37,007 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2023-11-06 22:49:37,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2023-11-06 22:49:37,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-06 22:49:37,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2023-11-06 22:49:37,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-11-06 22:49:37,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-11-06 22:49:37,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2023-11-06 22:49:37,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:37,010 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 74 transitions. [2023-11-06 22:49:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2023-11-06 22:49:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2023-11-06 22:49:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2023-11-06 22:49:37,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-11-06 22:49:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:49:37,015 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-11-06 22:49:37,015 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 22:49:37,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2023-11-06 22:49:37,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-06 22:49:37,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:37,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:37,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:37,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:37,017 INFO L748 eck$LassoCheckResult]: Stem: 536#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 508#L565 assume !(main_~array_size~0#1 < 1); 509#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 510#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 511#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 512#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 513#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 537#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 514#L552-4 lis_~i~0#1 := 1; 515#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 516#L555-3 [2023-11-06 22:49:37,017 INFO L750 eck$LassoCheckResult]: Loop: 516#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 517#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 521#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 525#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 527#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 532#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 533#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 516#L555-3 [2023-11-06 22:49:37,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2023-11-06 22:49:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790678659] [2023-11-06 22:49:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:37,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:37,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:37,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2023-11-06 22:49:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824253963] [2023-11-06 22:49:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:37,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:37,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:37,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2023-11-06 22:49:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:37,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500031983] [2023-11-06 22:49:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:49:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500031983] [2023-11-06 22:49:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500031983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183978480] [2023-11-06 22:49:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:37,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:37,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:37,285 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:37,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 22:49:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:49:37,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:49:37,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:49:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183978480] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:37,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:37,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 22:49:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949725221] [2023-11-06 22:49:37,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:49:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:49:38,005 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:38,205 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2023-11-06 22:49:38,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 142 transitions. [2023-11-06 22:49:38,206 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2023-11-06 22:49:38,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 79 states and 114 transitions. [2023-11-06 22:49:38,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2023-11-06 22:49:38,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2023-11-06 22:49:38,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 114 transitions. [2023-11-06 22:49:38,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:38,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2023-11-06 22:49:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 114 transitions. [2023-11-06 22:49:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2023-11-06 22:49:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 48 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2023-11-06 22:49:38,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 71 transitions. [2023-11-06 22:49:38,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:49:38,218 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 71 transitions. [2023-11-06 22:49:38,219 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 22:49:38,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 71 transitions. [2023-11-06 22:49:38,219 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-06 22:49:38,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:38,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:38,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:38,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:49:38,221 INFO L748 eck$LassoCheckResult]: Stem: 788#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 783#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 763#L565 assume !(main_~array_size~0#1 < 1); 764#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 765#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 766#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 767#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 768#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 805#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 769#L552-4 lis_~i~0#1 := 1; 770#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 771#L555-3 [2023-11-06 22:49:38,221 INFO L750 eck$LassoCheckResult]: Loop: 771#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 772#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 776#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 780#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 771#L555-3 [2023-11-06 22:49:38,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2023-11-06 22:49:38,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:38,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143007073] [2023-11-06 22:49:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:38,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:38,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:38,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:38,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2023-11-06 22:49:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570845843] [2023-11-06 22:49:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:38,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:38,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:38,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2023-11-06 22:49:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332638881] [2023-11-06 22:49:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:38,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:38,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:39,826 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:49:39,826 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:49:39,827 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:49:39,827 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:49:39,827 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:49:39,827 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:39,827 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:49:39,827 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:49:39,827 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration5_Lasso [2023-11-06 22:49:39,827 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:49:39,827 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:49:39,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:39,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:49:41,436 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:49:41,437 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:49:41,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,438 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-06 22:49:41,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-06 22:49:41,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,474 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-06 22:49:41,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,498 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-06 22:49:41,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,541 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-06 22:49:41,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,602 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-06 22:49:41,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:41,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:41,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,653 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-06 22:49:41,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,678 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-06 22:49:41,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:41,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:41,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,717 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-06 22:49:41,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:41,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:41,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,770 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-06 22:49:41,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:41,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:41,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,818 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-06 22:49:41,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,855 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-06 22:49:41,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:41,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:41,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,897 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-06 22:49:41,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-06 22:49:41,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,944 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-06 22:49:41,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,964 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-06 22:49:41,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:41,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:41,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:41,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:41,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:41,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:41,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:41,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:41,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:41,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-11-06 22:49:41,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:41,984 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:41,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-06 22:49:41,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,033 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-06 22:49:42,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:42,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:42,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:42,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,077 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-06 22:49:42,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,117 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:42,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:42,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:42,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-06 22:49:42,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,151 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:42,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:42,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:42,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-06 22:49:42,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,190 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-06 22:49:42,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,234 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-06 22:49:42,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:42,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:42,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:42,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,283 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-06 22:49:42,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,313 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-06 22:49:42,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,370 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:42,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:42,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:42,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-06 22:49:42,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,414 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-06 22:49:42,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:42,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:42,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:42,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,448 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-06 22:49:42,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-11-06 22:49:42,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,480 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-06 22:49:42,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:42,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,523 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-06 22:49:42,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:49:42,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:49:42,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:49:42,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-11-06 22:49:42,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,544 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-06 22:49:42,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-11-06 22:49:42,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,574 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-06 22:49:42,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:49:42,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-11-06 22:49:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,596 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:49:42,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-06 22:49:42,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:49:42,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:49:42,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:49:42,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:49:42,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:49:42,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:49:42,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:49:42,795 INFO L443 ModelExtractionUtils]: Simplification made 44 calls to the SMT solver. [2023-11-06 22:49:42,795 INFO L444 ModelExtractionUtils]: 3 out of 40 variables were initially zero. Simplification set additionally 33 variables to zero. [2023-11-06 22:49:42,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:49:42,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,798 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-06 22:49:42,800 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:49:42,811 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-06 22:49:42,812 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:49:42,812 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0#1, v_rep(select #length ULTIMATE.start_lis_#t~malloc3#1.base)_2) = -4*ULTIMATE.start_lis_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc3#1.base)_2 Supporting invariants [1*ULTIMATE.start_lis_~prev~0#1.offset >= 0] [2023-11-06 22:49:42,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-06 22:49:42,970 INFO L156 tatePredicateManager]: 26 out of 28 supporting invariants were superfluous and have been removed [2023-11-06 22:49:42,976 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[#t~malloc3!base] could not be translated [2023-11-06 22:49:43,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:43,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:43,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:49:43,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:43,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:49:43,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:43,302 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-06 22:49:43,303 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 71 transitions. cyclomatic complexity: 28 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:43,427 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 71 transitions. cyclomatic complexity: 28. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 86 states and 126 transitions. Complement of second has 10 states. [2023-11-06 22:49:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-06 22:49:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2023-11-06 22:49:43,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2023-11-06 22:49:43,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:43,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2023-11-06 22:49:43,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:43,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2023-11-06 22:49:43,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:49:43,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 126 transitions. [2023-11-06 22:49:43,437 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-06 22:49:43,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 77 states and 115 transitions. [2023-11-06 22:49:43,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-06 22:49:43,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-11-06 22:49:43,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 115 transitions. [2023-11-06 22:49:43,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:43,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 115 transitions. [2023-11-06 22:49:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 115 transitions. [2023-11-06 22:49:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2023-11-06 22:49:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.5) internal successors, (108), 71 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2023-11-06 22:49:43,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 108 transitions. [2023-11-06 22:49:43,450 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 108 transitions. [2023-11-06 22:49:43,450 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-06 22:49:43,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 108 transitions. [2023-11-06 22:49:43,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-06 22:49:43,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:43,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:43,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:43,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:49:43,453 INFO L748 eck$LassoCheckResult]: Stem: 1125#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1116#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1090#L565 assume !(main_~array_size~0#1 < 1); 1091#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1092#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1093#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1094#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1095#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1142#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1100#L552-4 lis_~i~0#1 := 1; 1101#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1123#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1097#L556 [2023-11-06 22:49:43,454 INFO L750 eck$LassoCheckResult]: Loop: 1097#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1149#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1111#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1096#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1097#L556 [2023-11-06 22:49:43,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2023-11-06 22:49:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:43,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533594859] [2023-11-06 22:49:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:43,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:43,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:43,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2224444, now seen corresponding path program 1 times [2023-11-06 22:49:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:43,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954311896] [2023-11-06 22:49:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:43,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:43,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:43,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:43,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1808207284, now seen corresponding path program 1 times [2023-11-06 22:49:43,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:43,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047688327] [2023-11-06 22:49:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:49:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047688327] [2023-11-06 22:49:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047688327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9085089] [2023-11-06 22:49:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:43,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:43,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:43,705 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:43,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-11-06 22:49:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:43,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:49:43,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:49:43,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:49:43,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9085089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:43,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:49:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-11-06 22:49:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976682645] [2023-11-06 22:49:43,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:49:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:49:44,120 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. cyclomatic complexity: 46 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:44,201 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2023-11-06 22:49:44,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2023-11-06 22:49:44,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-06 22:49:44,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 59 states and 82 transitions. [2023-11-06 22:49:44,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-06 22:49:44,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-06 22:49:44,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2023-11-06 22:49:44,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:44,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 82 transitions. [2023-11-06 22:49:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2023-11-06 22:49:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2023-11-06 22:49:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 50 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2023-11-06 22:49:44,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 73 transitions. [2023-11-06 22:49:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:49:44,210 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 73 transitions. [2023-11-06 22:49:44,210 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-06 22:49:44,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 73 transitions. [2023-11-06 22:49:44,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-06 22:49:44,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:44,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:44,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:44,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:44,212 INFO L748 eck$LassoCheckResult]: Stem: 1329#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1296#L565 assume !(main_~array_size~0#1 < 1); 1297#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1298#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1299#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1300#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1301#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1335#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1331#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1330#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1309#L552-4 lis_~i~0#1 := 1; 1310#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1305#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1306#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1326#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1333#L555-3 [2023-11-06 22:49:44,213 INFO L750 eck$LassoCheckResult]: Loop: 1333#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1340#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1342#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1341#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1339#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1337#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1334#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1333#L555-3 [2023-11-06 22:49:44,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2023-11-06 22:49:44,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:44,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288793471] [2023-11-06 22:49:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:44,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:49:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:44,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288793471] [2023-11-06 22:49:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288793471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:44,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:44,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:49:44,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301906967] [2023-11-06 22:49:44,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:44,269 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:49:44,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2023-11-06 22:49:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:44,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651500682] [2023-11-06 22:49:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:44,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:44,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:49:44,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:49:44,752 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:44,801 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2023-11-06 22:49:44,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 70 transitions. [2023-11-06 22:49:44,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-06 22:49:44,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 70 transitions. [2023-11-06 22:49:44,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-11-06 22:49:44,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2023-11-06 22:49:44,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 70 transitions. [2023-11-06 22:49:44,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:44,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 70 transitions. [2023-11-06 22:49:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 70 transitions. [2023-11-06 22:49:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-11-06 22:49:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2023-11-06 22:49:44,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 69 transitions. [2023-11-06 22:49:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:49:44,809 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2023-11-06 22:49:44,809 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-06 22:49:44,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 69 transitions. [2023-11-06 22:49:44,810 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-06 22:49:44,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:44,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:44,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:44,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:44,811 INFO L748 eck$LassoCheckResult]: Stem: 1434#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1404#L565 assume !(main_~array_size~0#1 < 1); 1405#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1406#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1407#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1408#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1409#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1449#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1438#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1437#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1410#L552-4 lis_~i~0#1 := 1; 1411#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1412#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1413#L556 assume !lis_#t~short11#1; 1450#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1422#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1425#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1431#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1432#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1440#L555-3 [2023-11-06 22:49:44,811 INFO L750 eck$LassoCheckResult]: Loop: 1440#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1446#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1448#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1447#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1445#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1443#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1439#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1440#L555-3 [2023-11-06 22:49:44,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1521638327, now seen corresponding path program 1 times [2023-11-06 22:49:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:44,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660892130] [2023-11-06 22:49:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:49:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660892130] [2023-11-06 22:49:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660892130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:44,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:49:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629507769] [2023-11-06 22:49:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:44,857 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:49:44,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 4 times [2023-11-06 22:49:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:44,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147639934] [2023-11-06 22:49:44,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:44,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:44,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:44,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:45,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:45,311 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:45,327 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2023-11-06 22:49:45,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 73 transitions. [2023-11-06 22:49:45,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-06 22:49:45,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 71 transitions. [2023-11-06 22:49:45,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-06 22:49:45,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-06 22:49:45,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2023-11-06 22:49:45,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:45,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 71 transitions. [2023-11-06 22:49:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2023-11-06 22:49:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2023-11-06 22:49:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 50 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-11-06 22:49:45,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-11-06 22:49:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:45,339 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-11-06 22:49:45,339 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-06 22:49:45,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 69 transitions. [2023-11-06 22:49:45,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-06 22:49:45,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:45,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:45,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:45,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:45,341 INFO L748 eck$LassoCheckResult]: Stem: 1543#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1537#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1514#L565 assume !(main_~array_size~0#1 < 1); 1515#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1516#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1517#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1518#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1519#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1559#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1546#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1545#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1520#L552-4 lis_~i~0#1 := 1; 1521#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1522#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1523#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1558#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1532#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1534#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1539#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1540#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1548#L555-3 [2023-11-06 22:49:45,341 INFO L750 eck$LassoCheckResult]: Loop: 1548#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1554#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1556#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1555#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1553#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1551#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1547#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1548#L555-3 [2023-11-06 22:49:45,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:45,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1464380025, now seen corresponding path program 2 times [2023-11-06 22:49:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:45,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947023264] [2023-11-06 22:49:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:45,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:45,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:45,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:45,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 5 times [2023-11-06 22:49:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:45,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134037031] [2023-11-06 22:49:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:45,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:45,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:45,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:45,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1651341740, now seen corresponding path program 3 times [2023-11-06 22:49:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:45,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751217513] [2023-11-06 22:49:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:49:45,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:45,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751217513] [2023-11-06 22:49:45,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751217513] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:45,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692967168] [2023-11-06 22:49:45,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:49:45,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:45,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:45,563 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:45,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-11-06 22:49:45,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 22:49:45,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:49:45,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 22:49:45,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:45,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2023-11-06 22:49:45,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:49:45,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-06 22:49:46,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:46,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:46,096 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:46,096 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 36 [2023-11-06 22:49:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:49:46,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:46,638 INFO L322 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2023-11-06 22:49:46,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 60 [2023-11-06 22:49:46,648 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:46,674 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:46,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 82 [2023-11-06 22:49:46,697 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:46,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-06 22:49:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:49:47,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692967168] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:47,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:47,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 30 [2023-11-06 22:49:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636030940] [2023-11-06 22:49:47,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:49:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:49:48,104 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. cyclomatic complexity: 22 Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:49,331 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2023-11-06 22:49:49,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 216 transitions. [2023-11-06 22:49:49,333 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2023-11-06 22:49:49,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 81 states and 103 transitions. [2023-11-06 22:49:49,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2023-11-06 22:49:49,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2023-11-06 22:49:49,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 103 transitions. [2023-11-06 22:49:49,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:49:49,335 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 103 transitions. [2023-11-06 22:49:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 103 transitions. [2023-11-06 22:49:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2023-11-06 22:49:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.280701754385965) internal successors, (73), 56 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2023-11-06 22:49:49,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 73 transitions. [2023-11-06 22:49:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:49:49,343 INFO L428 stractBuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2023-11-06 22:49:49,343 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-06 22:49:49,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 73 transitions. [2023-11-06 22:49:49,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2023-11-06 22:49:49,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:49:49,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:49:49,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:49,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:49:49,345 INFO L748 eck$LassoCheckResult]: Stem: 1992#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1989#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1972#L565 assume !(main_~array_size~0#1 < 1); 1973#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1974#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1975#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1976#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1977#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2021#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2020#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2017#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1980#L552-4 lis_~i~0#1 := 1; 1981#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2027#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2026#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2024#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2023#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2022#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1990#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1991#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1978#L555-3 [2023-11-06 22:49:49,346 INFO L750 eck$LassoCheckResult]: Loop: 1978#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1979#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1982#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1986#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1978#L555-3 [2023-11-06 22:49:49,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1464380025, now seen corresponding path program 4 times [2023-11-06 22:49:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318636054] [2023-11-06 22:49:49,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:49,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:49,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:49,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 2 times [2023-11-06 22:49:49,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:49,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002470224] [2023-11-06 22:49:49,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:49,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:49,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:49,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:49,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash -710990816, now seen corresponding path program 5 times [2023-11-06 22:49:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:49,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482310242] [2023-11-06 22:49:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:49,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:49,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:49,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:56,495 WARN L293 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 228 DAG size of output: 167 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:50:00,536 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:50:00,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:50:00,537 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:50:00,537 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:50:00,537 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:50:00,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:00,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:50:00,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:50:00,537 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration10_Lasso [2023-11-06 22:50:00,537 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:50:00,537 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:50:00,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:00,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:03,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:04,251 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:50:04,252 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:50:04,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,255 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-06 22:50:04,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-11-06 22:50:04,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,273 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-06 22:50:04,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:04,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,290 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-06 22:50:04,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,311 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-06 22:50:04,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-11-06 22:50:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,354 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-06 22:50:04,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2023-11-06 22:50:04,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,376 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-06 22:50:04,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:04,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,403 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-06 22:50:04,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-11-06 22:50:04,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,421 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-11-06 22:50:04,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,438 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-06 22:50:04,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-11-06 22:50:04,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,456 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-06 22:50:04,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2023-11-06 22:50:04,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,476 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-11-06 22:50:04,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2023-11-06 22:50:04,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,495 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-11-06 22:50:04,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2023-11-06 22:50:04,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,524 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-11-06 22:50:04,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2023-11-06 22:50:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,544 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-11-06 22:50:04,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-11-06 22:50:04,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,561 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-11-06 22:50:04,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2023-11-06 22:50:04,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,587 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-11-06 22:50:04,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-11-06 22:50:04,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,605 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-11-06 22:50:04,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-11-06 22:50:04,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,627 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-11-06 22:50:04,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2023-11-06 22:50:04,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,644 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-11-06 22:50:04,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-11-06 22:50:04,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,664 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-11-06 22:50:04,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-11-06 22:50:04,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,702 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-11-06 22:50:04,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:04,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,736 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-11-06 22:50:04,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2023-11-06 22:50:04,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,771 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-11-06 22:50:04,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2023-11-06 22:50:04,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,789 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-11-06 22:50:04,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2023-11-06 22:50:04,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,817 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-11-06 22:50:04,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2023-11-06 22:50:04,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,838 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2023-11-06 22:50:04,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2023-11-06 22:50:04,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,871 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2023-11-06 22:50:04,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:04,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,889 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2023-11-06 22:50:04,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2023-11-06 22:50:04,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,910 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2023-11-06 22:50:04,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2023-11-06 22:50:04,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,935 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2023-11-06 22:50:04,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:04,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:04,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:04,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2023-11-06 22:50:04,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,953 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2023-11-06 22:50:04,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:04,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:04,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:04,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:04,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2023-11-06 22:50:04,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:04,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:04,980 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:04,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-11-06 22:50:04,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:04,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:04,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:04,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:04,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:05,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:05,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:05,052 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:50:05,225 INFO L443 ModelExtractionUtils]: Simplification made 41 calls to the SMT solver. [2023-11-06 22:50:05,225 INFO L444 ModelExtractionUtils]: 9 out of 49 variables were initially zero. Simplification set additionally 36 variables to zero. [2023-11-06 22:50:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:05,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:05,227 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:05,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-11-06 22:50:05,229 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:50:05,239 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-06 22:50:05,240 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:50:05,240 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_3, ULTIMATE.start_lis_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_3 - 4*ULTIMATE.start_lis_~j~0#1 Supporting invariants [1*ULTIMATE.start_lis_~best~0#1.offset >= 0] [2023-11-06 22:50:05,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:05,531 INFO L156 tatePredicateManager]: 33 out of 35 supporting invariants were superfluous and have been removed [2023-11-06 22:50:05,536 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~prev~0!base] could not be translated [2023-11-06 22:50:05,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:05,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:50:05,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:05,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:50:05,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:05,782 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-06 22:50:05,783 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 20 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:05,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 20. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 81 states and 101 transitions. Complement of second has 10 states. [2023-11-06 22:50:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-06 22:50:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2023-11-06 22:50:05,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 20 letters. Loop has 4 letters. [2023-11-06 22:50:05,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:50:05,904 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-06 22:50:05,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:05,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:50:05,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:06,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:06,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:50:06,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:06,227 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-06 22:50:06,227 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 20 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,346 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 20. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 81 states and 101 transitions. Complement of second has 10 states. [2023-11-06 22:50:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-06 22:50:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2023-11-06 22:50:06,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 20 letters. Loop has 4 letters. [2023-11-06 22:50:06,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:50:06,349 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-06 22:50:06,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:06,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:50:06,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:06,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:50:06,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:06,617 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-06 22:50:06,618 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 20 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,764 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 20. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 149 transitions. Complement of second has 9 states. [2023-11-06 22:50:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-06 22:50:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2023-11-06 22:50:06,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 20 letters. Loop has 4 letters. [2023-11-06 22:50:06,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:50:06,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 24 letters. Loop has 4 letters. [2023-11-06 22:50:06,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:50:06,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 20 letters. Loop has 8 letters. [2023-11-06 22:50:06,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:50:06,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 149 transitions. [2023-11-06 22:50:06,771 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2023-11-06 22:50:06,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 88 states and 115 transitions. [2023-11-06 22:50:06,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-11-06 22:50:06,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-11-06 22:50:06,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 115 transitions. [2023-11-06 22:50:06,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:50:06,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 115 transitions. [2023-11-06 22:50:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 115 transitions. [2023-11-06 22:50:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2023-11-06 22:50:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2023-11-06 22:50:06,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 98 transitions. [2023-11-06 22:50:06,778 INFO L428 stractBuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2023-11-06 22:50:06,778 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-06 22:50:06,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 98 transitions. [2023-11-06 22:50:06,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2023-11-06 22:50:06,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:50:06,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:50:06,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:06,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:50:06,780 INFO L748 eck$LassoCheckResult]: Stem: 2761#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2758#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2733#L565 assume !(main_~array_size~0#1 < 1); 2734#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2735#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2736#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2737#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2738#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2780#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2781#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2801#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 2800#L552-4 lis_~i~0#1 := 1; 2799#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2798#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2796#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2794#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2793#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2792#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2791#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2782#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2783#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2790#L556 [2023-11-06 22:50:06,780 INFO L750 eck$LassoCheckResult]: Loop: 2790#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2804#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2802#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2803#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2790#L556 [2023-11-06 22:50:06,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1848859442, now seen corresponding path program 6 times [2023-11-06 22:50:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678751418] [2023-11-06 22:50:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:06,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:06,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:06,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2224444, now seen corresponding path program 2 times [2023-11-06 22:50:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793316682] [2023-11-06 22:50:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:06,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:06,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:06,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash -565876855, now seen corresponding path program 1 times [2023-11-06 22:50:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366230748] [2023-11-06 22:50:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366230748] [2023-11-06 22:50:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366230748] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037281753] [2023-11-06 22:50:08,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:08,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:08,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:08,333 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:08,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2023-11-06 22:50:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:08,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-06 22:50:08,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:08,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2023-11-06 22:50:08,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 22:50:08,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:50:08,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-06 22:50:08,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:50:08,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2023-11-06 22:50:08,858 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:50:09,026 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:09,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:50:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:09,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:50:09,630 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_551 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (< (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (select .cse0 .cse1)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 .cse1 v_ArrVal_550)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse2 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) is different from false [2023-11-06 22:50:09,650 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:09,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 165 [2023-11-06 22:50:09,658 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:09,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 3 [2023-11-06 22:50:09,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 145 [2023-11-06 22:50:09,697 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:09,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 122 [2023-11-06 22:50:09,799 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:09,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 5 [2023-11-06 22:50:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:50:09,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037281753] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:50:09,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:50:09,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 36 [2023-11-06 22:50:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749370588] [2023-11-06 22:50:09,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:50:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 22:50:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1049, Unknown=5, NotChecked=66, Total=1260 [2023-11-06 22:50:10,132 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. cyclomatic complexity: 30 Second operand has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:14,569 INFO L93 Difference]: Finished difference Result 359 states and 489 transitions. [2023-11-06 22:50:14,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 489 transitions. [2023-11-06 22:50:14,572 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 127 [2023-11-06 22:50:14,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 357 states and 487 transitions. [2023-11-06 22:50:14,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2023-11-06 22:50:14,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2023-11-06 22:50:14,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 357 states and 487 transitions. [2023-11-06 22:50:14,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:50:14,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 357 states and 487 transitions. [2023-11-06 22:50:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states and 487 transitions. [2023-11-06 22:50:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 89. [2023-11-06 22:50:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 88 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2023-11-06 22:50:14,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 118 transitions. [2023-11-06 22:50:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-06 22:50:14,586 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 118 transitions. [2023-11-06 22:50:14,586 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-06 22:50:14,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 118 transitions. [2023-11-06 22:50:14,587 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2023-11-06 22:50:14,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:50:14,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:50:14,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:14,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:50:14,588 INFO L748 eck$LassoCheckResult]: Stem: 3465#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3433#L565 assume !(main_~array_size~0#1 < 1); 3434#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3435#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3436#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3468#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3469#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3437#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3438#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3466#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 3467#L552-4 lis_~i~0#1 := 1; 3492#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3493#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3487#L556 assume !lis_#t~short11#1; 3488#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3513#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3512#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3511#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3510#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3509#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3440#L556 [2023-11-06 22:50:14,588 INFO L750 eck$LassoCheckResult]: Loop: 3440#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3520#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3519#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3439#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3440#L556 [2023-11-06 22:50:14,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash -16593778, now seen corresponding path program 1 times [2023-11-06 22:50:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281289715] [2023-11-06 22:50:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:14,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:14,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:14,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2224444, now seen corresponding path program 3 times [2023-11-06 22:50:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213736983] [2023-11-06 22:50:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:14,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:14,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:14,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash -257839287, now seen corresponding path program 1 times [2023-11-06 22:50:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:14,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486375129] [2023-11-06 22:50:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:50:15,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486375129] [2023-11-06 22:50:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486375129] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125254250] [2023-11-06 22:50:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:15,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:15,458 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:15,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2023-11-06 22:50:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:15,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-06 22:50:15,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:15,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-11-06 22:50:15,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 22:50:15,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:50:15,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:50:15,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 22:50:15,766 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:15,767 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:50:15,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-06 22:50:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:50:16,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:50:16,206 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2023-11-06 22:50:16,213 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2023-11-06 22:50:16,378 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:16,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 123 [2023-11-06 22:50:16,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 108 [2023-11-06 22:50:16,404 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:16,404 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 173 [2023-11-06 22:50:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-06 22:50:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125254250] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:50:16,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:50:16,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2023-11-06 22:50:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007843624] [2023-11-06 22:50:16,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:50:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:50:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=648, Unknown=10, NotChecked=106, Total=870 [2023-11-06 22:50:16,708 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. cyclomatic complexity: 34 Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:18,973 INFO L93 Difference]: Finished difference Result 293 states and 391 transitions. [2023-11-06 22:50:18,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 391 transitions. [2023-11-06 22:50:18,975 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 89 [2023-11-06 22:50:18,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 287 states and 385 transitions. [2023-11-06 22:50:18,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2023-11-06 22:50:18,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-11-06 22:50:18,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 385 transitions. [2023-11-06 22:50:18,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:50:18,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 287 states and 385 transitions. [2023-11-06 22:50:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 385 transitions. [2023-11-06 22:50:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 109. [2023-11-06 22:50:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.2844036697247707) internal successors, (140), 108 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 140 transitions. [2023-11-06 22:50:19,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 140 transitions. [2023-11-06 22:50:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:50:19,006 INFO L428 stractBuchiCegarLoop]: Abstraction has 109 states and 140 transitions. [2023-11-06 22:50:19,006 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-06 22:50:19,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 140 transitions. [2023-11-06 22:50:19,008 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2023-11-06 22:50:19,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:50:19,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:50:19,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:19,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:50:19,009 INFO L748 eck$LassoCheckResult]: Stem: 4067#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4062#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4038#L565 assume !(main_~array_size~0#1 < 1); 4039#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4040#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4041#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4064#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4076#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4042#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4043#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4073#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 4044#L552-4 lis_~i~0#1 := 1; 4045#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4095#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4096#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4088#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4089#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4083#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4084#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4068#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4069#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4050#L556 assume !lis_#t~short11#1; 4051#L556-2 [2023-11-06 22:50:19,009 INFO L750 eck$LassoCheckResult]: Loop: 4051#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4057#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4046#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4047#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4051#L556-2 [2023-11-06 22:50:19,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:19,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1480067810, now seen corresponding path program 1 times [2023-11-06 22:50:19,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:19,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747642743] [2023-11-06 22:50:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:19,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:19,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:19,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:19,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2464294, now seen corresponding path program 4 times [2023-11-06 22:50:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916326447] [2023-11-06 22:50:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:19,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:19,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:19,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -360466237, now seen corresponding path program 1 times [2023-11-06 22:50:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:19,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867767594] [2023-11-06 22:50:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:19,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:50:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:20,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867767594] [2023-11-06 22:50:20,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867767594] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:20,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651072276] [2023-11-06 22:50:20,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:20,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:20,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:20,248 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:20,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2023-11-06 22:50:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:20,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-06 22:50:20,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:20,446 INFO L322 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-06 22:50:20,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 29 [2023-11-06 22:50:20,501 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:50:20,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-11-06 22:50:20,895 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-06 22:50:21,165 INFO L322 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-06 22:50:21,165 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 27 [2023-11-06 22:50:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:50:21,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:50:21,503 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 Int) (v_ArrVal_684 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_272| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_686)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_lis_~a#1.base|))) (let ((.cse0 (select .cse1 (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_272|) |c_ULTIMATE.start_lis_~a#1.offset|)))) (or (< .cse0 (+ (select .cse1 (+ 4 |c_ULTIMATE.start_lis_~a#1.offset|)) 1)) (< (select .cse1 |c_ULTIMATE.start_lis_~a#1.offset|) .cse0))))) is different from false [2023-11-06 22:50:21,650 INFO L322 Elim1Store]: treesize reduction 51, result has 57.1 percent of original size [2023-11-06 22:50:21,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 119 [2023-11-06 22:50:21,744 INFO L322 Elim1Store]: treesize reduction 13, result has 82.2 percent of original size [2023-11-06 22:50:21,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 148 [2023-11-06 22:50:21,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:50:21,781 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:21,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-06 22:50:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-11-06 22:50:23,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651072276] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:50:23,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:50:23,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2023-11-06 22:50:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293413058] [2023-11-06 22:50:23,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:50:23,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:23,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-06 22:50:23,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1192, Unknown=2, NotChecked=72, Total=1482 [2023-11-06 22:50:23,632 INFO L87 Difference]: Start difference. First operand 109 states and 140 transitions. cyclomatic complexity: 36 Second operand has 39 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:25,351 INFO L93 Difference]: Finished difference Result 193 states and 246 transitions. [2023-11-06 22:50:25,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 246 transitions. [2023-11-06 22:50:25,353 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 76 [2023-11-06 22:50:25,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 193 states and 246 transitions. [2023-11-06 22:50:25,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2023-11-06 22:50:25,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2023-11-06 22:50:25,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 246 transitions. [2023-11-06 22:50:25,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:50:25,356 INFO L218 hiAutomatonCegarLoop]: Abstraction has 193 states and 246 transitions. [2023-11-06 22:50:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 246 transitions. [2023-11-06 22:50:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 145. [2023-11-06 22:50:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 145 states have (on average 1.303448275862069) internal successors, (189), 144 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2023-11-06 22:50:25,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 145 states and 189 transitions. [2023-11-06 22:50:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:50:25,370 INFO L428 stractBuchiCegarLoop]: Abstraction has 145 states and 189 transitions. [2023-11-06 22:50:25,370 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-06 22:50:25,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 189 transitions. [2023-11-06 22:50:25,371 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 59 [2023-11-06 22:50:25,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:50:25,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:50:25,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:25,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2023-11-06 22:50:25,373 INFO L748 eck$LassoCheckResult]: Stem: 4603#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4577#L565 assume !(main_~array_size~0#1 < 1); 4578#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4579#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4580#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4619#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4600#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4581#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4582#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4613#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4609#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4608#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 4610#L552-4 lis_~i~0#1 := 1; 4645#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4646#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4638#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4639#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4689#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4688#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4687#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4686#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4684#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4683#L556 assume !lis_#t~short11#1; 4668#L556-2 [2023-11-06 22:50:25,373 INFO L750 eck$LassoCheckResult]: Loop: 4668#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4682#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4681#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4648#L556 assume !lis_#t~short11#1; 4626#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4620#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4621#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4611#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4612#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4670#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4666#L556 assume !lis_#t~short11#1; 4668#L556-2 [2023-11-06 22:50:25,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:25,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1862607488, now seen corresponding path program 2 times [2023-11-06 22:50:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974603268] [2023-11-06 22:50:25,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:25,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:25,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:25,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash -599847033, now seen corresponding path program 1 times [2023-11-06 22:50:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:25,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129033708] [2023-11-06 22:50:25,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:25,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:25,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:25,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash -135717720, now seen corresponding path program 2 times [2023-11-06 22:50:25,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963355499] [2023-11-06 22:50:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:25,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:25,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:31,960 WARN L293 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 274 DAG size of output: 192 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:50:33,990 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:50:33,990 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:50:33,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:50:33,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:50:33,990 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:50:33,990 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:33,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:50:33,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:50:33,991 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration14_Lasso [2023-11-06 22:50:33,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:50:33,991 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:50:33,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:34,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:50:35,728 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:50:35,728 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:50:35,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,736 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-11-06 22:50:35,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:35,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:35,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:35,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,758 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-11-06 22:50:35,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:35,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:35,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2023-11-06 22:50:35,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,781 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-11-06 22:50:35,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:35,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:35,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2023-11-06 22:50:35,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,805 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-11-06 22:50:35,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:35,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:35,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:35,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:35,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,825 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-11-06 22:50:35,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:35,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:35,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:35,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:35,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,845 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-11-06 22:50:35,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:35,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:35,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:35,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:35,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,866 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-11-06 22:50:35,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:35,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:35,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2023-11-06 22:50:35,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,892 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-11-06 22:50:35,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:35,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:35,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:35,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,930 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-11-06 22:50:35,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:35,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:35,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:35,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:35,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,948 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-11-06 22:50:35,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:35,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:35,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:35,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:35,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,970 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-11-06 22:50:35,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:35,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:35,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:50:35,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:35,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:35,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:35,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:50:35,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:50:35,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:35,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:35,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:35,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:35,993 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:35,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-11-06 22:50:35,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:36,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:36,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:36,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:36,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:36,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:36,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:36,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:36,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2023-11-06 22:50:36,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:36,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:36,019 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:36,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-11-06 22:50:36,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:36,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:36,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:36,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:36,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:36,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:36,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:36,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:36,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:36,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:36,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:36,068 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:36,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:36,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:36,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:36,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:36,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:36,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:36,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:36,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-11-06 22:50:36,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:36,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:36,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:36,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:36,109 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:36,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:36,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:36,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:36,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:36,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:36,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2023-11-06 22:50:36,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:36,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:36,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:50:36,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:36,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:36,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:36,133 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:36,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2023-11-06 22:50:36,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:50:36,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:50:36,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:50:36,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:50:36,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:50:36,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:50:36,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:50:36,200 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:50:36,254 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2023-11-06 22:50:36,254 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 21 variables to zero. [2023-11-06 22:50:36,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:50:36,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:36,260 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:36,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:50:36,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2023-11-06 22:50:36,284 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:50:36,284 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:50:36,285 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2023-11-06 22:50:36,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:36,433 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2023-11-06 22:50:36,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:36,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:50:36,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:36,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:50:36,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:50:36,584 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-06 22:50:36,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 189 transitions. cyclomatic complexity: 50 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:36,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 189 transitions. cyclomatic complexity: 50. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 309 states and 422 transitions. Complement of second has 7 states. [2023-11-06 22:50:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:50:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2023-11-06 22:50:36,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 24 letters. Loop has 11 letters. [2023-11-06 22:50:36,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:50:36,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 35 letters. Loop has 11 letters. [2023-11-06 22:50:36,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:50:36,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 24 letters. Loop has 22 letters. [2023-11-06 22:50:36,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:50:36,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 422 transitions. [2023-11-06 22:50:36,624 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 43 [2023-11-06 22:50:36,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 267 states and 363 transitions. [2023-11-06 22:50:36,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2023-11-06 22:50:36,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2023-11-06 22:50:36,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 363 transitions. [2023-11-06 22:50:36,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:50:36,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 267 states and 363 transitions. [2023-11-06 22:50:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 363 transitions. [2023-11-06 22:50:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 221. [2023-11-06 22:50:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 221 states have (on average 1.3755656108597285) internal successors, (304), 220 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 304 transitions. [2023-11-06 22:50:36,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 221 states and 304 transitions. [2023-11-06 22:50:36,635 INFO L428 stractBuchiCegarLoop]: Abstraction has 221 states and 304 transitions. [2023-11-06 22:50:36,636 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-06 22:50:36,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 304 transitions. [2023-11-06 22:50:36,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2023-11-06 22:50:36,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:50:36,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:50:36,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:36,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:50:36,639 INFO L748 eck$LassoCheckResult]: Stem: 5307#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5276#L565 assume !(main_~array_size~0#1 < 1); 5277#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5278#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5279#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5313#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5300#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5280#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5281#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5311#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 5286#L552-4 lis_~i~0#1 := 1; 5287#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5375#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5376#L556 assume !lis_#t~short11#1; 5463#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5454#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5322#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5303#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5304#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5306#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5481#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5485#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5483#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5484#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5488#L556 [2023-11-06 22:50:36,639 INFO L750 eck$LassoCheckResult]: Loop: 5488#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5288#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5293#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5295#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5488#L556 [2023-11-06 22:50:36,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash -257841209, now seen corresponding path program 3 times [2023-11-06 22:50:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:36,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632538334] [2023-11-06 22:50:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:36,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:36,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:36,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2224444, now seen corresponding path program 5 times [2023-11-06 22:50:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467235896] [2023-11-06 22:50:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:36,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:36,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:36,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash -193051134, now seen corresponding path program 4 times [2023-11-06 22:50:36,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:36,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326566753] [2023-11-06 22:50:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:50:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326566753] [2023-11-06 22:50:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326566753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720740159] [2023-11-06 22:50:36,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:50:36,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:36,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:36,907 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:36,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2023-11-06 22:50:37,040 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:50:37,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:50:37,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:50:37,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:50:37,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:50:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:50:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720740159] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:50:37,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:50:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2023-11-06 22:50:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284952976] [2023-11-06 22:50:37,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:50:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:37,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:50:37,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:50:37,402 INFO L87 Difference]: Start difference. First operand 221 states and 304 transitions. cyclomatic complexity: 93 Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:37,746 INFO L93 Difference]: Finished difference Result 433 states and 591 transitions. [2023-11-06 22:50:37,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 591 transitions. [2023-11-06 22:50:37,749 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 39 [2023-11-06 22:50:37,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 367 states and 510 transitions. [2023-11-06 22:50:37,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2023-11-06 22:50:37,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2023-11-06 22:50:37,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 510 transitions. [2023-11-06 22:50:37,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:50:37,754 INFO L218 hiAutomatonCegarLoop]: Abstraction has 367 states and 510 transitions. [2023-11-06 22:50:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 510 transitions. [2023-11-06 22:50:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 209. [2023-11-06 22:50:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 209 states have (on average 1.368421052631579) internal successors, (286), 208 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 286 transitions. [2023-11-06 22:50:37,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 286 transitions. [2023-11-06 22:50:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:50:37,761 INFO L428 stractBuchiCegarLoop]: Abstraction has 209 states and 286 transitions. [2023-11-06 22:50:37,761 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-06 22:50:37,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 286 transitions. [2023-11-06 22:50:37,762 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2023-11-06 22:50:37,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:50:37,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:50:37,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:37,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-11-06 22:50:37,764 INFO L748 eck$LassoCheckResult]: Stem: 6176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6146#L565 assume !(main_~array_size~0#1 < 1); 6147#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 6148#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6149#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6150#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6151#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6171#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6184#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6183#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6181#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6180#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 6152#L552-4 lis_~i~0#1 := 1; 6153#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6190#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6189#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6188#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6187#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6186#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6185#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6177#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6178#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6241#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6240#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6239#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6237#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6236#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6234#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6233#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6232#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6192#L554-2 [2023-11-06 22:50:37,764 INFO L750 eck$LassoCheckResult]: Loop: 6192#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6193#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6230#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6228#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6229#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6209#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6210#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6197#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6243#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6248#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6246#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6192#L554-2 [2023-11-06 22:50:37,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash 209132572, now seen corresponding path program 7 times [2023-11-06 22:50:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403302627] [2023-11-06 22:50:37,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:37,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:37,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:37,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash 370950897, now seen corresponding path program 1 times [2023-11-06 22:50:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410801472] [2023-11-06 22:50:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:37,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:37,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:37,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:37,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1491593226, now seen corresponding path program 2 times [2023-11-06 22:50:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567092465] [2023-11-06 22:50:37,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:50:38,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:38,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567092465] [2023-11-06 22:50:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567092465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244295463] [2023-11-06 22:50:38,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:50:38,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:38,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:38,053 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:38,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2023-11-06 22:50:38,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:50:38,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:50:38,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:50:38,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:50:38,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:50:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:50:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244295463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:50:38,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:50:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-11-06 22:50:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026590113] [2023-11-06 22:50:38,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:50:39,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:39,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:50:39,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:50:39,076 INFO L87 Difference]: Start difference. First operand 209 states and 286 transitions. cyclomatic complexity: 85 Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:39,252 INFO L93 Difference]: Finished difference Result 309 states and 420 transitions. [2023-11-06 22:50:39,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 420 transitions. [2023-11-06 22:50:39,254 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2023-11-06 22:50:39,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 309 states and 420 transitions. [2023-11-06 22:50:39,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2023-11-06 22:50:39,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2023-11-06 22:50:39,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 420 transitions. [2023-11-06 22:50:39,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:50:39,258 INFO L218 hiAutomatonCegarLoop]: Abstraction has 309 states and 420 transitions. [2023-11-06 22:50:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 420 transitions. [2023-11-06 22:50:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 252. [2023-11-06 22:50:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 252 states have (on average 1.373015873015873) internal successors, (346), 251 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 346 transitions. [2023-11-06 22:50:39,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 252 states and 346 transitions. [2023-11-06 22:50:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:50:39,267 INFO L428 stractBuchiCegarLoop]: Abstraction has 252 states and 346 transitions. [2023-11-06 22:50:39,267 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-06 22:50:39,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 252 states and 346 transitions. [2023-11-06 22:50:39,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-11-06 22:50:39,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:50:39,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:50:39,270 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:39,270 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2023-11-06 22:50:39,270 INFO L748 eck$LassoCheckResult]: Stem: 6969#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6961#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6936#L565 assume !(main_~array_size~0#1 < 1); 6937#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 6938#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6939#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6940#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6941#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6975#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6974#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6972#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6971#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6970#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 6946#L552-4 lis_~i~0#1 := 1; 6947#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6981#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6980#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6979#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6978#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6977#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6976#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6965#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6966#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7036#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7037#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7060#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7019#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7017#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7018#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7000#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7001#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6983#L554-2 [2023-11-06 22:50:39,270 INFO L750 eck$LassoCheckResult]: Loop: 6983#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6984#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7053#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7052#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7047#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 7046#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7044#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7045#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7077#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7075#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7063#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6988#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7056#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 7057#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7064#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6983#L554-2 [2023-11-06 22:50:39,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 209132572, now seen corresponding path program 8 times [2023-11-06 22:50:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212046253] [2023-11-06 22:50:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:39,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:39,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:39,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash 396122668, now seen corresponding path program 2 times [2023-11-06 22:50:39,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:39,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871242444] [2023-11-06 22:50:39,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:39,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:39,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:39,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:39,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1827415217, now seen corresponding path program 3 times [2023-11-06 22:50:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366702559] [2023-11-06 22:50:39,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:42,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366702559] [2023-11-06 22:50:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366702559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251314243] [2023-11-06 22:50:42,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:50:42,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:42,123 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:42,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2023-11-06 22:50:42,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 22:50:42,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:50:42,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 22:50:42,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:42,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-06 22:50:42,570 INFO L322 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-06 22:50:42,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-11-06 22:50:42,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-11-06 22:50:42,799 INFO L322 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2023-11-06 22:50:42,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 69 [2023-11-06 22:50:42,804 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2023-11-06 22:50:42,990 INFO L322 Elim1Store]: treesize reduction 26, result has 54.4 percent of original size [2023-11-06 22:50:42,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 47 [2023-11-06 22:50:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:50:43,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:50:43,385 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 Int) (v_ArrVal_1066 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse2 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (or (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse3 .cse1 v_ArrVal_1064)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 .cse1) (+ (select .cse0 (+ .cse2 (- 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1)))) (< (+ (select .cse3 (+ .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset| (- 8))) 1) v_ArrVal_1064)))) is different from false [2023-11-06 22:50:43,458 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 Int) (v_ArrVal_1066 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse1 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (or (< (+ (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) v_ArrVal_1064) (let ((.cse3 (+ .cse1 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 .cse3 v_ArrVal_1064)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse2 .cse3) (+ (select .cse2 (+ .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))))))) is different from false [2023-11-06 22:50:43,660 INFO L322 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2023-11-06 22:50:43,660 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 95 [2023-11-06 22:50:43,682 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:43,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 86 [2023-11-06 22:50:43,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2023-11-06 22:50:43,698 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:50:43,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 3 [2023-11-06 22:50:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 29 trivial. 38 not checked. [2023-11-06 22:50:43,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251314243] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:50:43,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:50:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 42 [2023-11-06 22:50:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073295546] [2023-11-06 22:50:43,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:50:44,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:44,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-06 22:50:44,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1383, Unknown=4, NotChecked=154, Total=1722 [2023-11-06 22:50:44,734 INFO L87 Difference]: Start difference. First operand 252 states and 346 transitions. cyclomatic complexity: 102 Second operand has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 42 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:56,283 INFO L93 Difference]: Finished difference Result 1562 states and 2133 transitions. [2023-11-06 22:50:56,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1562 states and 2133 transitions. [2023-11-06 22:50:56,292 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 131 [2023-11-06 22:50:56,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1562 states to 1550 states and 2121 transitions. [2023-11-06 22:50:56,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2023-11-06 22:50:56,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2023-11-06 22:50:56,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1550 states and 2121 transitions. [2023-11-06 22:50:56,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:50:56,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1550 states and 2121 transitions. [2023-11-06 22:50:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states and 2121 transitions. [2023-11-06 22:50:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 535. [2023-11-06 22:50:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 535 states have (on average 1.4504672897196262) internal successors, (776), 534 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 776 transitions. [2023-11-06 22:50:56,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 535 states and 776 transitions. [2023-11-06 22:50:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2023-11-06 22:50:56,327 INFO L428 stractBuchiCegarLoop]: Abstraction has 535 states and 776 transitions. [2023-11-06 22:50:56,327 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-06 22:50:56,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 535 states and 776 transitions. [2023-11-06 22:50:56,329 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2023-11-06 22:50:56,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:50:56,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:50:56,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:56,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2023-11-06 22:50:56,331 INFO L748 eck$LassoCheckResult]: Stem: 9377#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 9341#L565 assume !(main_~array_size~0#1 < 1); 9342#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 9343#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9344#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 9345#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9346#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 9368#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9381#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 9380#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9379#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 9378#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 9351#L552-4 lis_~i~0#1 := 1; 9352#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 9389#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 9388#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 9387#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9386#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9385#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 9384#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 9373#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 9374#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 9442#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 9441#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9440#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9438#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 9437#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 9434#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9435#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9431#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 9412#L554-2 [2023-11-06 22:50:56,370 INFO L750 eck$LassoCheckResult]: Loop: 9412#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 9430#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 9428#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 9427#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 9423#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9424#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9475#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 9419#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 9480#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9481#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9483#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 9482#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 9415#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 9414#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9411#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 9412#L554-2 [2023-11-06 22:50:56,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash 209132572, now seen corresponding path program 9 times [2023-11-06 22:50:56,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:56,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065571620] [2023-11-06 22:50:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:56,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:56,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:56,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:56,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash -304943832, now seen corresponding path program 6 times [2023-11-06 22:50:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:56,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960889599] [2023-11-06 22:50:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:56,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:56,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:56,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1126348717, now seen corresponding path program 10 times [2023-11-06 22:50:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458804345] [2023-11-06 22:50:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:56,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:56,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:51:24,719 WARN L293 SmtUtils]: Spent 25.10s on a formula simplification. DAG size of input: 363 DAG size of output: 246 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:51:37,184 WARN L293 SmtUtils]: Spent 7.57s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:51:37,188 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:51:37,189 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:51:37,189 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:51:37,189 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:51:37,189 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:51:37,189 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:37,189 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:51:37,189 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:51:37,189 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration18_Lasso [2023-11-06 22:51:37,189 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:51:37,189 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:51:37,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:37,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:37,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:37,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:37,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:37,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:37,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:37,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:51:48,853 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:51:48,853 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:51:48,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:48,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:48,862 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:48,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:48,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2023-11-06 22:51:48,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:48,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:51:48,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:48,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:48,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:48,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:51:48,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:51:48,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:48,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:48,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:48,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:48,889 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:48,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2023-11-06 22:51:48,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:48,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:48,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:51:48,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:48,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:48,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:48,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:51:48,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:51:48,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:48,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:48,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:48,911 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:48,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2023-11-06 22:51:48,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:48,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:48,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:48,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:48,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:48,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:48,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:48,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:48,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:48,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:48,936 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:48,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-11-06 22:51:48,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:48,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:48,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:48,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:48,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:48,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:48,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:48,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:48,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:48,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:48,963 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:48,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-11-06 22:51:48,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:48,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:48,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:48,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:48,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:48,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:48,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:48,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:48,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-11-06 22:51:48,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:48,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:48,990 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:48,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-11-06 22:51:48,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:51:49,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:51:49,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:51:49,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-11-06 22:51:49,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,012 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2023-11-06 22:51:49,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,038 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-11-06 22:51:49,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,069 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-11-06 22:51:49,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,095 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-11-06 22:51:49,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,121 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-11-06 22:51:49,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:51:49,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:51:49,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:51:49,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,143 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2023-11-06 22:51:49,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,170 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2023-11-06 22:51:49,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,196 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2023-11-06 22:51:49,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2023-11-06 22:51:49,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,223 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2023-11-06 22:51:49,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,250 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-11-06 22:51:49,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2023-11-06 22:51:49,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,280 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-11-06 22:51:49,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:51:49,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:51:49,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:51:49,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,305 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2023-11-06 22:51:49,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:51:49,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,340 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2023-11-06 22:51:49,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:51:49,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:51:49,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:51:49,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:51:49,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:51:49,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:51:49,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:51:49,384 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:51:49,404 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-11-06 22:51:49,404 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-11-06 22:51:49,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:51:49,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:49,412 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:49,422 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:51:49,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2023-11-06 22:51:49,457 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:51:49,458 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:51:49,458 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 5 Supporting invariants [] [2023-11-06 22:51:49,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:49,993 INFO L156 tatePredicateManager]: 49 out of 49 supporting invariants were superfluous and have been removed [2023-11-06 22:51:50,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:51:50,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:51:50,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:50,329 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2023-11-06 22:51:50,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 535 states and 776 transitions. cyclomatic complexity: 253 Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:50,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 535 states and 776 transitions. cyclomatic complexity: 253. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1763 states and 2520 transitions. Complement of second has 13 states. [2023-11-06 22:51:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-06 22:51:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2023-11-06 22:51:50,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 31 letters. Loop has 15 letters. [2023-11-06 22:51:50,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:51:50,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 46 letters. Loop has 15 letters. [2023-11-06 22:51:50,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:51:50,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 31 letters. Loop has 30 letters. [2023-11-06 22:51:50,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:51:50,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 2520 transitions. [2023-11-06 22:51:50,530 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2023-11-06 22:51:50,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1618 states and 2297 transitions. [2023-11-06 22:51:50,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2023-11-06 22:51:50,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2023-11-06 22:51:50,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1618 states and 2297 transitions. [2023-11-06 22:51:50,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:51:50,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1618 states and 2297 transitions. [2023-11-06 22:51:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states and 2297 transitions. [2023-11-06 22:51:50,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1135. [2023-11-06 22:51:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1135 states have (on average 1.4704845814977974) internal successors, (1669), 1134 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1669 transitions. [2023-11-06 22:51:50,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1135 states and 1669 transitions. [2023-11-06 22:51:50,636 INFO L428 stractBuchiCegarLoop]: Abstraction has 1135 states and 1669 transitions. [2023-11-06 22:51:50,636 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-11-06 22:51:50,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1135 states and 1669 transitions. [2023-11-06 22:51:50,641 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2023-11-06 22:51:50,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:51:50,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:51:50,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:50,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 1, 1, 1] [2023-11-06 22:51:50,643 INFO L748 eck$LassoCheckResult]: Stem: 12039#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12032#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 12009#L565 assume !(main_~array_size~0#1 < 1); 12010#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 12011#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12012#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 12013#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12014#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 12034#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12047#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 12046#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12044#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 12043#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 12015#L552-4 lis_~i~0#1 := 1; 12016#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 12040#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12060#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12059#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12058#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12056#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 12057#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 12125#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 12123#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12122#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12118#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12119#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12159#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12157#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12070#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12071#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12062#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 12063#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 12052#L554-3 [2023-11-06 22:51:50,643 INFO L750 eck$LassoCheckResult]: Loop: 12052#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 12204#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12205#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12195#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12196#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12260#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12261#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12272#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12273#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12267#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12268#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12255#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12253#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12251#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12212#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12225#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12221#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12211#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 12051#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 12052#L554-3 [2023-11-06 22:51:50,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:50,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2106824804, now seen corresponding path program 11 times [2023-11-06 22:51:50,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:50,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105536069] [2023-11-06 22:51:50,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:50,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:51:50,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:51:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:51:50,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:51:50,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash -877842931, now seen corresponding path program 7 times [2023-11-06 22:51:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:50,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075808334] [2023-11-06 22:51:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:51:50,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:51:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:51:50,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:51:50,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash -704761198, now seen corresponding path program 12 times [2023-11-06 22:51:50,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976639245] [2023-11-06 22:51:50,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 35 proven. 72 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:51:51,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:51,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976639245] [2023-11-06 22:51:51,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976639245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395556547] [2023-11-06 22:51:51,071 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:51:51,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:51,087 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:51,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2023-11-06 22:51:51,843 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-11-06 22:51:51,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:51:51,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:51:51,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:51:52,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:51:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:51:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395556547] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:51:52,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:51:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-11-06 22:51:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665244818] [2023-11-06 22:51:52,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:51:58,737 WARN L293 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 244 DAG size of output: 177 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:52:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:52:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:52:00,547 INFO L87 Difference]: Start difference. First operand 1135 states and 1669 transitions. cyclomatic complexity: 551 Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:00,844 INFO L93 Difference]: Finished difference Result 1681 states and 2382 transitions. [2023-11-06 22:52:00,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1681 states and 2382 transitions. [2023-11-06 22:52:00,857 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2023-11-06 22:52:00,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1681 states to 1410 states and 2035 transitions. [2023-11-06 22:52:00,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2023-11-06 22:52:00,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2023-11-06 22:52:00,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1410 states and 2035 transitions. [2023-11-06 22:52:00,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:52:00,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1410 states and 2035 transitions. [2023-11-06 22:52:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states and 2035 transitions. [2023-11-06 22:52:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1299. [2023-11-06 22:52:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1299 states have (on average 1.451886066204773) internal successors, (1886), 1298 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1886 transitions. [2023-11-06 22:52:00,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1299 states and 1886 transitions. [2023-11-06 22:52:00,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:52:00,916 INFO L428 stractBuchiCegarLoop]: Abstraction has 1299 states and 1886 transitions. [2023-11-06 22:52:00,916 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-11-06 22:52:00,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1299 states and 1886 transitions. [2023-11-06 22:52:00,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2023-11-06 22:52:00,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:52:00,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:52:00,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:00,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:52:00,926 INFO L748 eck$LassoCheckResult]: Stem: 15186#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 15157#L565 assume !(main_~array_size~0#1 < 1); 15158#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 15159#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15160#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 15161#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15162#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 15194#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15193#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 15192#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15191#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 15190#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 15167#L552-4 lis_~i~0#1 := 1; 15168#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 15187#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15206#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15205#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15204#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15199#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 15200#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 15393#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 15391#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15392#L556 assume !lis_#t~short11#1; 15730#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 15727#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15720#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15558#L556 assume !lis_#t~short11#1; 15421#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 15415#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15235#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 15198#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 15195#L554-3 assume !(lis_~i~0#1 < lis_~N#1); 15181#L554-4 lis_~i~0#1 := 0; 15169#L558-3 [2023-11-06 22:52:00,927 INFO L750 eck$LassoCheckResult]: Loop: 15169#L558-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 15170#L559 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 15179#L558-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 15169#L558-3 [2023-11-06 22:52:00,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 411263963, now seen corresponding path program 1 times [2023-11-06 22:52:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:00,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145377244] [2023-11-06 22:52:00,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:52:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145377244] [2023-11-06 22:52:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145377244] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:01,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528733608] [2023-11-06 22:52:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:01,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:01,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:01,144 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:01,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2023-11-06 22:52:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:01,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:52:01,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:52:01,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:52:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528733608] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:01,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2023-11-06 22:52:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966691978] [2023-11-06 22:52:01,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:01,659 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:52:01,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 1 times [2023-11-06 22:52:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:01,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318550440] [2023-11-06 22:52:01,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:01,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:52:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:01,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:52:01,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:01,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:52:01,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:52:01,740 INFO L87 Difference]: Start difference. First operand 1299 states and 1886 transitions. cyclomatic complexity: 604 Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:02,057 INFO L93 Difference]: Finished difference Result 1386 states and 2005 transitions. [2023-11-06 22:52:02,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1386 states and 2005 transitions. [2023-11-06 22:52:02,066 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2023-11-06 22:52:02,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1386 states to 1366 states and 1978 transitions. [2023-11-06 22:52:02,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2023-11-06 22:52:02,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2023-11-06 22:52:02,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1366 states and 1978 transitions. [2023-11-06 22:52:02,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:52:02,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1366 states and 1978 transitions. [2023-11-06 22:52:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states and 1978 transitions. [2023-11-06 22:52:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1291. [2023-11-06 22:52:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1291 states have (on average 1.4500387296669248) internal successors, (1872), 1290 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1872 transitions. [2023-11-06 22:52:02,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1291 states and 1872 transitions. [2023-11-06 22:52:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:52:02,120 INFO L428 stractBuchiCegarLoop]: Abstraction has 1291 states and 1872 transitions. [2023-11-06 22:52:02,121 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-11-06 22:52:02,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1872 transitions. [2023-11-06 22:52:02,126 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2023-11-06 22:52:02,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:52:02,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:52:02,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:02,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 2, 2, 1, 1, 1] [2023-11-06 22:52:02,134 INFO L748 eck$LassoCheckResult]: Stem: 18108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 18101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 18074#L565 assume !(main_~array_size~0#1 < 1); 18075#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 18076#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 18077#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 18078#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 18079#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 18103#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 18115#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 18114#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 18112#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 18111#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 18080#L552-4 lis_~i~0#1 := 1; 18081#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 18109#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 18181#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 18180#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 18179#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 18174#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 18104#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 18105#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 18784#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 18781#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 18776#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 18773#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 18774#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 19249#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 19248#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 19247#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 18991#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 18987#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 18985#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 18384#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 18385#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 19018#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 19019#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 19020#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 19096#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 19097#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 19214#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 19092#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 19093#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 19210#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 19209#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 18387#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 18303#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 18300#L554-3 [2023-11-06 22:52:02,135 INFO L750 eck$LassoCheckResult]: Loop: 18300#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 18294#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 18275#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 18276#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 18421#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 18418#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 18235#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 18322#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 18258#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 18254#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 18255#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 18245#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 18212#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 18213#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 18160#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 18161#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 18155#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 18156#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 18302#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 18300#L554-3 [2023-11-06 22:52:02,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash 557071915, now seen corresponding path program 13 times [2023-11-06 22:52:02,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:02,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888073092] [2023-11-06 22:52:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:02,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:52:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:02,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:52:02,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1429024119, now seen corresponding path program 3 times [2023-11-06 22:52:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426916785] [2023-11-06 22:52:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:02,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:52:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:02,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:52:02,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1483276257, now seen corresponding path program 4 times [2023-11-06 22:52:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:02,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120145992] [2023-11-06 22:52:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 154 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-06 22:52:02,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:02,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120145992] [2023-11-06 22:52:02,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120145992] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:02,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443242535] [2023-11-06 22:52:02,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:52:02,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:02,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:02,847 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:02,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2023-11-06 22:52:03,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:52:03,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:52:03,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:52:03,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 188 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-06 22:52:03,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 188 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-06 22:52:04,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443242535] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:04,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:04,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2023-11-06 22:52:04,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069129880] [2023-11-06 22:52:04,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 22:52:07,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:52:07,010 INFO L87 Difference]: Start difference. First operand 1291 states and 1872 transitions. cyclomatic complexity: 598 Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:07,279 INFO L93 Difference]: Finished difference Result 2741 states and 3945 transitions. [2023-11-06 22:52:07,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2741 states and 3945 transitions. [2023-11-06 22:52:07,296 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 86 [2023-11-06 22:52:07,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2741 states to 2375 states and 3477 transitions. [2023-11-06 22:52:07,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2023-11-06 22:52:07,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2023-11-06 22:52:07,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2375 states and 3477 transitions. [2023-11-06 22:52:07,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:52:07,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2375 states and 3477 transitions. [2023-11-06 22:52:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states and 3477 transitions. [2023-11-06 22:52:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1294. [2023-11-06 22:52:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1294 states have (on average 1.4420401854714064) internal successors, (1866), 1293 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1866 transitions. [2023-11-06 22:52:07,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1294 states and 1866 transitions. [2023-11-06 22:52:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:52:07,361 INFO L428 stractBuchiCegarLoop]: Abstraction has 1294 states and 1866 transitions. [2023-11-06 22:52:07,361 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-11-06 22:52:07,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1294 states and 1866 transitions. [2023-11-06 22:52:07,365 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2023-11-06 22:52:07,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:52:07,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:52:07,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:07,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 1, 1, 1] [2023-11-06 22:52:07,367 INFO L748 eck$LassoCheckResult]: Stem: 22564#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 22555#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 22529#L565 assume !(main_~array_size~0#1 < 1); 22530#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 22531#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22532#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 22533#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22534#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 22556#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22571#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 22570#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22569#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 22568#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22566#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 22565#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 22539#L552-4 lis_~i~0#1 := 1; 22540#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 22645#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22644#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22643#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22642#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22641#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 22640#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 22639#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 22637#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22636#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22635#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22634#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22632#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22631#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22630#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22629#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22628#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 22627#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 22626#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 22625#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22621#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22619#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22610#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22611#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22614#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22612#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22608#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22609#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22598#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22595#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22593#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22594#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 22589#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 22590#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 22952#L555-3 [2023-11-06 22:52:07,367 INFO L750 eck$LassoCheckResult]: Loop: 22952#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22932#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22933#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23046#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23032#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22848#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22849#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22977#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22976#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22879#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22880#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22963#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22962#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 22861#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 22862#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 22823#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 22824#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 22958#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 22574#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 22952#L555-3 [2023-11-06 22:52:07,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1547491638, now seen corresponding path program 14 times [2023-11-06 22:52:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822360385] [2023-11-06 22:52:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:07,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:52:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:07,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:52:07,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2020114191, now seen corresponding path program 8 times [2023-11-06 22:52:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857730288] [2023-11-06 22:52:07,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:07,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:52:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:07,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:52:07,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -35362886, now seen corresponding path program 15 times [2023-11-06 22:52:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294287367] [2023-11-06 22:52:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 134 proven. 83 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-06 22:52:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:08,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294287367] [2023-11-06 22:52:08,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294287367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:08,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610066839] [2023-11-06 22:52:08,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:52:08,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:08,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:08,135 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:08,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2023-11-06 22:52:08,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-06 22:52:08,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:52:08,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:52:08,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 139 proven. 38 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-06 22:52:08,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 15 proven. 162 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-06 22:52:09,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610066839] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:09,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:09,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 24 [2023-11-06 22:52:09,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239878627] [2023-11-06 22:52:09,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:52:16,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:52:16,147 INFO L87 Difference]: Start difference. First operand 1294 states and 1866 transitions. cyclomatic complexity: 589 Second operand has 25 states, 24 states have (on average 3.75) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:17,022 INFO L93 Difference]: Finished difference Result 4886 states and 7058 transitions. [2023-11-06 22:52:17,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4886 states and 7058 transitions. [2023-11-06 22:52:17,049 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 102 [2023-11-06 22:52:17,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4886 states to 3836 states and 5549 transitions. [2023-11-06 22:52:17,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2023-11-06 22:52:17,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 404 [2023-11-06 22:52:17,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3836 states and 5549 transitions. [2023-11-06 22:52:17,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:52:17,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3836 states and 5549 transitions. [2023-11-06 22:52:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states and 5549 transitions. [2023-11-06 22:52:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 1727. [2023-11-06 22:52:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1727 states have (on average 1.4377533294730747) internal successors, (2483), 1726 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2483 transitions. [2023-11-06 22:52:17,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1727 states and 2483 transitions. [2023-11-06 22:52:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-06 22:52:17,150 INFO L428 stractBuchiCegarLoop]: Abstraction has 1727 states and 2483 transitions. [2023-11-06 22:52:17,151 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-11-06 22:52:17,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1727 states and 2483 transitions. [2023-11-06 22:52:17,158 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 86 [2023-11-06 22:52:17,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:52:17,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:52:17,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:17,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:52:17,159 INFO L748 eck$LassoCheckResult]: Stem: 29227#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 29217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 29195#L565 assume !(main_~array_size~0#1 < 1); 29196#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 29197#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 29198#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 29199#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 29200#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 29218#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 29241#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 29240#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 29239#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 29238#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 29232#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 29233#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 29205#L552-4 lis_~i~0#1 := 1; 29206#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 29690#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29691#L556 assume !lis_#t~short11#1; 30755#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 30756#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 30817#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 30816#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 30815#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 30813#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 30812#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 30810#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 30808#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 30805#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 30804#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 30803#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 30802#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 30801#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 30800#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 30799#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 30797#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 30796#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 30793#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 30789#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 30790#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 30784#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 30782#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 30781#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 30776#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 30777#L556 assume !lis_#t~short11#1; 30893#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 30884#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 30885#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 30880#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 30881#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 30909#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29202#L556 [2023-11-06 22:52:17,160 INFO L750 eck$LassoCheckResult]: Loop: 29202#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 29208#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 29213#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 29201#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29202#L556 [2023-11-06 22:52:17,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:17,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1532728015, now seen corresponding path program 5 times [2023-11-06 22:52:17,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:17,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257412526] [2023-11-06 22:52:17,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:17,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 57 proven. 37 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:52:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:19,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257412526] [2023-11-06 22:52:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257412526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220101274] [2023-11-06 22:52:19,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:52:19,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:19,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:19,122 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:19,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96346e0-65b6-4cff-8a82-effc2bf33059/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2023-11-06 22:52:19,679 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-11-06 22:52:19,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:52:19,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-06 22:52:19,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:19,786 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:52:19,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-06 22:52:19,916 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 22:52:19,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2023-11-06 22:52:20,132 INFO L322 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-06 22:52:20,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 63 [2023-11-06 22:52:20,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:20,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:20,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:20,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:20,427 INFO L322 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2023-11-06 22:52:20,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 84 treesize of output 91 [2023-11-06 22:52:21,213 INFO L322 Elim1Store]: treesize reduction 533, result has 16.2 percent of original size [2023-11-06 22:52:21,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 46 case distinctions, treesize of input 133 treesize of output 169 [2023-11-06 22:52:24,063 INFO L322 Elim1Store]: treesize reduction 782, result has 22.5 percent of original size [2023-11-06 22:52:24,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 3 disjoint index pairs (out of 78 index pairs), introduced 14 new quantified variables, introduced 90 case distinctions, treesize of input 167 treesize of output 318 [2023-11-06 22:52:24,161 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 22:52:24,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 169 [2023-11-06 22:52:27,739 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:52:27,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 3 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 88 case distinctions, treesize of input 302 treesize of output 944