./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30e01a73 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_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --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 32bit --witnessprinter.graph.data.programhash 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:43:39,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:43:39,855 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-23 22:43:39,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:43:39,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:43:39,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:43:39,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:43:39,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:43:39,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:43:39,923 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:43:39,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:43:39,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:43:39,926 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:43:39,929 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-23 22:43:39,929 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-23 22:43:39,930 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-23 22:43:39,932 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-23 22:43:39,932 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-23 22:43:39,933 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-23 22:43:39,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:43:39,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-23 22:43:39,935 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:43:39,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:43:39,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:43:39,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:43:39,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-23 22:43:39,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-23 22:43:39,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-23 22:43:39,938 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:43:39,939 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:43:39,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:43:39,941 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-23 22:43:39,941 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:43:39,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:43:39,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:43:39,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:43:39,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:43:39,943 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-23 22:43:39,944 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_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/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_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e [2023-11-23 22:43:40,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:43:40,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:43:40,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:43:40,386 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:43:40,387 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:43:40,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/reducercommutativity/max10-1.i [2023-11-23 22:43:44,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:43:44,360 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:43:44,361 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/sv-benchmarks/c/reducercommutativity/max10-1.i [2023-11-23 22:43:44,369 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/data/a81f9a544/35b4fe23e0bd441c83fa6796c98119bf/FLAG5e2e23c89 [2023-11-23 22:43:44,385 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/data/a81f9a544/35b4fe23e0bd441c83fa6796c98119bf [2023-11-23 22:43:44,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:43:44,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:43:44,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:43:44,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:43:44,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:43:44,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb1b8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44, skipping insertion in model container [2023-11-23 22:43:44,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:43:44,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:43:44,622 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:43:44,644 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:43:44,659 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:43:44,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44 WrapperNode [2023-11-23 22:43:44,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:43:44,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:43:44,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:43:44,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:43:44,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,717 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-11-23 22:43:44,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:43:44,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:43:44,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:43:44,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:43:44,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,733 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,746 INFO L189 HeapSplitter]: Split 17 memory accesses to 2 slices as follows [2, 15] [2023-11-23 22:43:44,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:43:44,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:43:44,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:43:44,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:43:44,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (1/1) ... [2023-11-23 22:43:44,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:44,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:44,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-23 22:43:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:43:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:43:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 22:43:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:43:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 22:43:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 22:43:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:43:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:43:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 22:43:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 22:43:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:43:44,992 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:43:44,995 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:43:45,293 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:43:45,304 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:43:45,304 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-23 22:43:45,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:43:45 BoogieIcfgContainer [2023-11-23 22:43:45,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:43:45,307 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-23 22:43:45,307 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-23 22:43:45,313 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-23 22:43:45,314 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-23 22:43:45,314 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 10:43:44" (1/3) ... [2023-11-23 22:43:45,315 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d4470fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 10:43:45, skipping insertion in model container [2023-11-23 22:43:45,315 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-23 22:43:45,316 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:43:44" (2/3) ... [2023-11-23 22:43:45,316 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d4470fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 10:43:45, skipping insertion in model container [2023-11-23 22:43:45,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-23 22:43:45,316 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:43:45" (3/3) ... [2023-11-23 22:43:45,318 INFO L332 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2023-11-23 22:43:45,394 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-23 22:43:45,394 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-23 22:43:45,394 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-23 22:43:45,395 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-23 22:43:45,395 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-23 22:43:45,395 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-23 22:43:45,395 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-23 22:43:45,395 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-23 22:43:45,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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-23 22:43:45,424 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2023-11-23 22:43:45,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:45,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:45,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:43:45,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-23 22:43:45,431 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-23 22:43:45,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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-23 22:43:45,435 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2023-11-23 22:43:45,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:45,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:45,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:43:45,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-23 22:43:45,444 INFO L748 eck$LassoCheckResult]: Stem: 30#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 18#L34-3true [2023-11-23 22:43:45,445 INFO L750 eck$LassoCheckResult]: Loop: 18#L34-3true assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 12#L34-2true main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 18#L34-3true [2023-11-23 22:43:45,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:45,452 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-23 22:43:45,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:45,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621543186] [2023-11-23 22:43:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:45,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:45,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:45,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-23 22:43:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:45,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634750947] [2023-11-23 22:43:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:45,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:45,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:45,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-23 22:43:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:45,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623082743] [2023-11-23 22:43:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:45,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:45,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:46,239 INFO L210 LassoAnalysis]: Preferences: [2023-11-23 22:43:46,240 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-23 22:43:46,240 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-23 22:43:46,240 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-23 22:43:46,241 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-23 22:43:46,241 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:46,241 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-23 22:43:46,241 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-23 22:43:46,241 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2023-11-23 22:43:46,242 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-23 22:43:46,242 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-23 22:43:46,268 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-23 22:43:46,280 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-23 22:43:46,283 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-23 22:43:46,286 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-23 22:43:46,305 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-23 22:43:46,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-23 22:43:46,311 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-23 22:43:46,511 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-23 22:43:46,514 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-23 22:43:46,518 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-23 22:43:46,522 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-23 22:43:46,525 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-23 22:43:46,528 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-23 22:43:46,531 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-23 22:43:46,534 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-23 22:43:46,539 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-23 22:43:46,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-23 22:43:46,546 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-23 22:43:46,792 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-23 22:43:46,797 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-23 22:43:46,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:46,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:46,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:46,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-23 22:43:46,814 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-23 22:43:46,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:46,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:46,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:46,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:46,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:46,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:46,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:46,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:46,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:46,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:46,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:46,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:46,882 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-23 22:43:46,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-23 22:43:46,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:46,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:46,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:46,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:46,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:46,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:46,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:46,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:46,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:46,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:46,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:46,941 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-23 22:43:46,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-23 22:43:46,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:46,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:46,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:46,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:46,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:46,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:46,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:46,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:46,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:46,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:46,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,010 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-23 22:43:47,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:47,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:47,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:47,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:47,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:47,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:47,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-23 22:43:47,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:47,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:47,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:47,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,069 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-23 22:43:47,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-23 22:43:47,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:47,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:47,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:47,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:47,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:47,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:47,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:47,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:47,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:47,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-23 22:43:47,137 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-23 22:43:47,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:47,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:47,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:47,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:47,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:47,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:47,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:47,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:47,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:47,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,201 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-23 22:43:47,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-23 22:43:47,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:47,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:47,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:47,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:47,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:47,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:47,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:47,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:47,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:47,259 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,266 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-23 22:43:47,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:47,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:47,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:47,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:47,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:47,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:47,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-23 22:43:47,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:47,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:47,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:47,320 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-23 22:43:47,326 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-23 22:43:47,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:47,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:47,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:47,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:47,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:47,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:47,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:47,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:47,379 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-23 22:43:47,395 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-23 22:43:47,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:47,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:47,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:47,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:47,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:47,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:47,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:47,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:47,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:47,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,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-23 22:43:47,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:47,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:47,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:47,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:47,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-23 22:43:47,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:47,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:47,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-23 22:43:47,552 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-23 22:43:47,553 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-23 22:43:47,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:47,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:47,597 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:47,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-23 22:43:47,609 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-23 22:43:47,631 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-23 22:43:47,631 INFO L513 LassoAnalysis]: Proved termination. [2023-11-23 22:43:47,632 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2023-11-23 22:43:47,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,676 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-23 22:43:47,685 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#x~0!base] could not be translated [2023-11-23 22:43:47,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:47,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:47,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 22:43:47,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:43:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:47,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:43:47,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:43:47,837 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-23 22:43:47,887 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-23 22:43:47,890 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-23 22:43:47,982 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 65 states and 95 transitions. Complement of second has 8 states. [2023-11-23 22:43:47,984 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-23 22:43:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-23 22:43:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2023-11-23 22:43:47,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-23 22:43:47,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-23 22:43:47,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-23 22:43:48,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-23 22:43:48,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-23 22:43:48,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-23 22:43:48,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 95 transitions. [2023-11-23 22:43:48,016 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2023-11-23 22:43:48,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 25 states and 36 transitions. [2023-11-23 22:43:48,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-11-23 22:43:48,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-11-23 22:43:48,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 36 transitions. [2023-11-23 22:43:48,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:43:48,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-11-23 22:43:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 36 transitions. [2023-11-23 22:43:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-23 22:43:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 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-23 22:43:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2023-11-23 22:43:48,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-11-23 22:43:48,057 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-11-23 22:43:48,058 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-23 22:43:48,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2023-11-23 22:43:48,060 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2023-11-23 22:43:48,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:48,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:48,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-23 22:43:48,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-23 22:43:48,061 INFO L748 eck$LassoCheckResult]: Stem: 175#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 166#L34-3 assume !(main_~i~1#1 < 10); 157#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 158#L20-3 [2023-11-23 22:43:48,061 INFO L750 eck$LassoCheckResult]: Loop: 158#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 172#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 173#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 174#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 158#L20-3 [2023-11-23 22:43:48,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-23 22:43:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582151443] [2023-11-23 22:43:48,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:48,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:48,192 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-23 22:43:48,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:43:48,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582151443] [2023-11-23 22:43:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582151443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:43:48,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:43:48,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:43:48,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819257208] [2023-11-23 22:43:48,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:43:48,198 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-23 22:43:48,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2023-11-23 22:43:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894194300] [2023-11-23 22:43:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:48,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:48,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:48,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:43:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:43:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:43:48,341 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-23 22:43:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:43:48,367 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-23 22:43:48,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2023-11-23 22:43:48,370 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2023-11-23 22:43:48,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2023-11-23 22:43:48,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-23 22:43:48,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-11-23 22:43:48,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2023-11-23 22:43:48,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:43:48,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-23 22:43:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2023-11-23 22:43:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-11-23 22:43:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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-23 22:43:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-23 22:43:48,377 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-23 22:43:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:43:48,378 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-23 22:43:48,378 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-23 22:43:48,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2023-11-23 22:43:48,380 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2023-11-23 22:43:48,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:48,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:48,380 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-23 22:43:48,380 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-23 22:43:48,381 INFO L748 eck$LassoCheckResult]: Stem: 232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 223#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 225#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 226#L34-3 assume !(main_~i~1#1 < 10); 214#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 215#L20-3 [2023-11-23 22:43:48,381 INFO L750 eck$LassoCheckResult]: Loop: 215#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 229#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 230#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 231#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 215#L20-3 [2023-11-23 22:43:48,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-23 22:43:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956194958] [2023-11-23 22:43:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:48,496 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-23 22:43:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:43:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956194958] [2023-11-23 22:43:48,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956194958] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:43:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867795245] [2023-11-23 22:43:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:48,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:43:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:48,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:43:48,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 22:43:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:48,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:43:48,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:43:48,590 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-23 22:43:48,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:43:48,610 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-23 22:43:48,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867795245] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:43:48,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:43:48,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-23 22:43:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693190879] [2023-11-23 22:43:48,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:43:48,612 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-23 22:43:48,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2023-11-23 22:43:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:48,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334627703] [2023-11-23 22:43:48,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:48,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:48,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:43:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:43:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:43:48,687 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-23 22:43:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:43:48,713 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2023-11-23 22:43:48,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2023-11-23 22:43:48,714 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2023-11-23 22:43:48,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2023-11-23 22:43:48,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-23 22:43:48,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-11-23 22:43:48,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2023-11-23 22:43:48,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:43:48,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-23 22:43:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2023-11-23 22:43:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-23 22:43:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 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-23 22:43:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-11-23 22:43:48,719 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-23 22:43:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:43:48,721 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-23 22:43:48,721 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-23 22:43:48,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2023-11-23 22:43:48,722 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2023-11-23 22:43:48,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:48,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:48,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-23 22:43:48,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-23 22:43:48,723 INFO L748 eck$LassoCheckResult]: Stem: 328#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 318#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 319#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 331#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 332#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 321#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 322#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 336#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 335#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 334#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 333#L34-3 assume !(main_~i~1#1 < 10); 310#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 311#L20-3 [2023-11-23 22:43:48,723 INFO L750 eck$LassoCheckResult]: Loop: 311#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 325#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 326#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 327#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 311#L20-3 [2023-11-23 22:43:48,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-23 22:43:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:48,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554647304] [2023-11-23 22:43:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:43:48,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:43:48,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554647304] [2023-11-23 22:43:48,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554647304] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:43:48,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021930116] [2023-11-23 22:43:48,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 22:43:48,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:43:48,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:48,831 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:43:48,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 22:43:48,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 22:43:48,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:43:48,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:43:48,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:43:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:43:48,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:43:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:43:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021930116] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:43:49,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:43:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-23 22:43:49,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663382439] [2023-11-23 22:43:49,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:43:49,001 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-23 22:43:49,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2023-11-23 22:43:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184376468] [2023-11-23 22:43:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:49,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:49,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:49,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:43:49,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 22:43:49,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-23 22:43:49,074 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-23 22:43:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:43:49,127 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-11-23 22:43:49,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2023-11-23 22:43:49,128 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2023-11-23 22:43:49,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2023-11-23 22:43:49,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-23 22:43:49,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-11-23 22:43:49,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2023-11-23 22:43:49,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:43:49,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-11-23 22:43:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2023-11-23 22:43:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-23 22:43:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 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-23 22:43:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-11-23 22:43:49,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-11-23 22:43:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:43:49,137 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-11-23 22:43:49,137 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-23 22:43:49,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2023-11-23 22:43:49,138 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2023-11-23 22:43:49,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:49,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:49,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-11-23 22:43:49,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-23 22:43:49,140 INFO L748 eck$LassoCheckResult]: Stem: 484#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 475#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 487#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 488#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 477#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 478#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 504#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 503#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 502#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 501#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 500#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 499#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 498#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 497#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 496#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 495#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 494#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 493#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 492#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 491#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 490#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 489#L34-3 assume !(main_~i~1#1 < 10); 466#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 467#L20-3 [2023-11-23 22:43:49,140 INFO L750 eck$LassoCheckResult]: Loop: 467#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 482#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 483#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 481#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 467#L20-3 [2023-11-23 22:43:49,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-11-23 22:43:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592170373] [2023-11-23 22:43:49,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:49,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:49,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:49,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2023-11-23 22:43:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834577153] [2023-11-23 22:43:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:49,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:49,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:49,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:49,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2023-11-23 22:43:49,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:49,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544714055] [2023-11-23 22:43:49,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:49,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:49,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:49,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:55,945 WARN L293 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 211 DAG size of output: 168 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-23 22:43:56,498 INFO L210 LassoAnalysis]: Preferences: [2023-11-23 22:43:56,498 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-23 22:43:56,498 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-23 22:43:56,498 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-23 22:43:56,498 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-23 22:43:56,498 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:56,498 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-23 22:43:56,498 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-23 22:43:56,499 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration5_Lasso [2023-11-23 22:43:56,499 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-23 22:43:56,499 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-23 22:43:56,505 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-23 22:43:56,508 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-23 22:43:56,511 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-23 22:43:56,514 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-23 22:43:56,518 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-23 22:43:56,521 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-23 22:43:56,523 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-23 22:43:57,286 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-23 22:43:57,289 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-23 22:43:57,292 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-23 22:43:57,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-23 22:43:57,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-23 22:43:57,310 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-23 22:43:57,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-23 22:43:57,315 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-23 22:43:57,317 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-23 22:43:57,319 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-23 22:43:57,322 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-23 22:43:57,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-23 22:43:57,327 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-23 22:43:57,329 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-23 22:43:57,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-23 22:43:57,334 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-23 22:43:57,337 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-23 22:43:57,708 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-23 22:43:57,714 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-23 22:43:57,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:57,721 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:57,731 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-23 22:43:57,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-23 22:43:57,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:57,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:57,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:57,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:57,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:57,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:57,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:57,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:57,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:57,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:57,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:57,795 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:57,803 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-23 22:43:57,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-23 22:43:57,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:57,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:57,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:57,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:57,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:57,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:57,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:57,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:57,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:57,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:57,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:57,861 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:57,871 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-23 22:43:57,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-23 22:43:57,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:57,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:57,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:57,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:57,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:57,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:57,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:57,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:57,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:57,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:57,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:57,936 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:57,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-23 22:43:57,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-23 22:43:57,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:57,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:57,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:57,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:57,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:57,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:57,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:57,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:57,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:57,985 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:57,997 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-23 22:43:58,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-23 22:43:58,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:58,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:58,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:58,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:58,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:58,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:58,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:58,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:58,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:58,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:58,071 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:58,083 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-23 22:43:58,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-23 22:43:58,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:58,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:58,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:58,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:58,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:58,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:58,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:58,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:58,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:58,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:58,149 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:58,162 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-23 22:43:58,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-23 22:43:58,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:58,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:58,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:58,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:58,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:58,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:58,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:58,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:58,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:58,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:58,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:58,219 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:58,222 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-23 22:43:58,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-23 22:43:58,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:58,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:58,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:58,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:58,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:58,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:58,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:58,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:58,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:58,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:58,290 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:58,292 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-23 22:43:58,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-23 22:43:58,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:58,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-23 22:43:58,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:58,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:58,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:58,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-23 22:43:58,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-23 22:43:58,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:58,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:58,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:58,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:58,327 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:58,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-23 22:43:58,332 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-23 22:43:58,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:58,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:58,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:58,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:58,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:58,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:58,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:58,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-23 22:43:58,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:58,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:58,383 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:58,389 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-23 22:43:58,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-23 22:43:58,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:58,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:58,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:58,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:58,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:58,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:58,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-23 22:43:58,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:58,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:58,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:58,444 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:58,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-23 22:43:58,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-23 22:43:58,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-23 22:43:58,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-23 22:43:58,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-23 22:43:58,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-23 22:43:58,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-23 22:43:58,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-23 22:43:58,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-23 22:43:58,525 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-11-23 22:43:58,525 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-11-23 22:43:58,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:43:58,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:58,530 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:43:58,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-23 22:43:58,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-23 22:43:58,554 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-23 22:43:58,555 INFO L513 LassoAnalysis]: Proved termination. [2023-11-23 22:43:58,555 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2, ULTIMATE.start_max_~i~0#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 - 8*ULTIMATE.start_max_~i~0#1 Supporting invariants [] [2023-11-23 22:43:58,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:58,633 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2023-11-23 22:43:58,637 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#x~0!base] could not be translated [2023-11-23 22:43:58,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-23 22:43:58,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:58,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:43:58,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:43:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:58,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 22:43:58,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:43:58,830 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-23 22:43:58,831 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-23 22:43:58,831 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-23 22:43:58,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 60 transitions. Complement of second has 7 states. [2023-11-23 22:43:58,890 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-23 22:43:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-23 22:43:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-11-23 22:43:58,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2023-11-23 22:43:58,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-23 22:43:58,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2023-11-23 22:43:58,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-23 22:43:58,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2023-11-23 22:43:58,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-23 22:43:58,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2023-11-23 22:43:58,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2023-11-23 22:43:58,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2023-11-23 22:43:58,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-23 22:43:58,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-23 22:43:58,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2023-11-23 22:43:58,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:43:58,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2023-11-23 22:43:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2023-11-23 22:43:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-23 22:43:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 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-23 22:43:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2023-11-23 22:43:58,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2023-11-23 22:43:58,905 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2023-11-23 22:43:58,905 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-23 22:43:58,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2023-11-23 22:43:58,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2023-11-23 22:43:58,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:58,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:58,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:43:58,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-23 22:43:58,908 INFO L748 eck$LassoCheckResult]: Stem: 721#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 711#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 724#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 725#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 713#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 714#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 741#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 740#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 739#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 738#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 737#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 736#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 735#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 734#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 733#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 732#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 731#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 730#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 729#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 728#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 727#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 726#L34-3 assume !(main_~i~1#1 < 10); 702#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 703#L20-3 assume !(max_~i~0#1 < 10); 712#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 709#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 708#L20-8 [2023-11-23 22:43:58,908 INFO L750 eck$LassoCheckResult]: Loop: 708#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 698#L21-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 699#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 715#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 708#L20-8 [2023-11-23 22:43:58,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2023-11-23 22:43:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:58,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888261895] [2023-11-23 22:43:58,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:58,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-23 22:43:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:43:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888261895] [2023-11-23 22:43:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888261895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:43:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:43:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:43:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139359809] [2023-11-23 22:43:59,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:43:59,008 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-23 22:43:59,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2023-11-23 22:43:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:59,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613955325] [2023-11-23 22:43:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:59,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:59,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:43:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:43:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:43:59,091 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-23 22:43:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:43:59,151 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-11-23 22:43:59,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2023-11-23 22:43:59,153 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2023-11-23 22:43:59,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2023-11-23 22:43:59,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-23 22:43:59,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-11-23 22:43:59,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2023-11-23 22:43:59,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:43:59,155 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 65 transitions. [2023-11-23 22:43:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2023-11-23 22:43:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2023-11-23 22:43:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 44 states have internal predecessors, (52), 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-23 22:43:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-11-23 22:43:59,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-11-23 22:43:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:43:59,162 INFO L428 stractBuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-11-23 22:43:59,162 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-23 22:43:59,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2023-11-23 22:43:59,163 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2023-11-23 22:43:59,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:59,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:59,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:43:59,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-23 22:43:59,165 INFO L748 eck$LassoCheckResult]: Stem: 826#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 815#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 816#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 818#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 819#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 830#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 847#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 846#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 845#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 844#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 843#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 842#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 841#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 840#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 839#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 838#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 837#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 836#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 835#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 834#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 833#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 832#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 831#L34-3 assume !(main_~i~1#1 < 10); 807#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 808#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 822#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 824#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 825#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 823#L20-3 assume !(max_~i~0#1 < 10); 817#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 814#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 813#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 803#L21-3 [2023-11-23 22:43:59,166 INFO L750 eck$LassoCheckResult]: Loop: 803#L21-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 804#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 820#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 829#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 803#L21-3 [2023-11-23 22:43:59,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2023-11-23 22:43:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838889097] [2023-11-23 22:43:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-23 22:43:59,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:43:59,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838889097] [2023-11-23 22:43:59,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838889097] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:43:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196913720] [2023-11-23 22:43:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:59,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:43:59,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:43:59,272 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:43:59,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-23 22:43:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:43:59,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:43:59,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:43:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-23 22:43:59,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:43:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-23 22:43:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196913720] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:43:59,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:43:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-23 22:43:59,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958818799] [2023-11-23 22:43:59,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:43:59,449 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-23 22:43:59,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2023-11-23 22:43:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:59,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042966450] [2023-11-23 22:43:59,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:59,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:43:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:43:59,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:43:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:43:59,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:43:59,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:43:59,601 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-23 22:43:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:43:59,729 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-11-23 22:43:59,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 98 transitions. [2023-11-23 22:43:59,731 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2023-11-23 22:43:59,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 98 transitions. [2023-11-23 22:43:59,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2023-11-23 22:43:59,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2023-11-23 22:43:59,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 98 transitions. [2023-11-23 22:43:59,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:43:59,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 98 transitions. [2023-11-23 22:43:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 98 transitions. [2023-11-23 22:43:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2023-11-23 22:43:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 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-23 22:43:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-11-23 22:43:59,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-11-23 22:43:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:43:59,742 INFO L428 stractBuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-11-23 22:43:59,742 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-23 22:43:59,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2023-11-23 22:43:59,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2023-11-23 22:43:59,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:43:59,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:43:59,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:43:59,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-23 22:43:59,747 INFO L748 eck$LassoCheckResult]: Stem: 1152#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1140#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1142#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1143#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1156#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1193#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1191#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1189#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1187#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1185#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1183#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1179#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1178#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1177#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1175#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1173#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1171#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1169#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1167#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1165#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1163#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1162#L34-3 assume !(main_~i~1#1 < 10); 1130#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1131#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1147#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1153#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1151#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1148#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1149#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1150#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1176#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1174#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1172#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1170#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1168#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1166#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1160#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1164#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1161#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1159#L20-3 assume !(max_~i~0#1 < 10); 1141#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1137#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1138#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1194#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1144#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1145#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1136#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1126#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1127#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1192#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1190#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1188#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1186#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1184#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1182#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1158#L21-3 [2023-11-23 22:43:59,748 INFO L750 eck$LassoCheckResult]: Loop: 1158#L21-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1181#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1180#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1157#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1158#L21-3 [2023-11-23 22:43:59,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:43:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 1 times [2023-11-23 22:43:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:43:59,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341133107] [2023-11-23 22:43:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:43:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:43:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:44:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-11-23 22:44:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:44:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341133107] [2023-11-23 22:44:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341133107] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:44:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710296987] [2023-11-23 22:44:00,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:44:00,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:44:00,059 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:44:00,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-23 22:44:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:44:00,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:44:00,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:44:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-11-23 22:44:00,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:44:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-11-23 22:44:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710296987] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:44:00,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:44:00,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-23 22:44:00,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761455653] [2023-11-23 22:44:00,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:44:00,373 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-23 22:44:00,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:44:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2023-11-23 22:44:00,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:44:00,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452488085] [2023-11-23 22:44:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:44:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:00,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:44:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:00,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:44:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:44:00,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 22:44:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-23 22:44:00,489 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-23 22:44:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:44:00,760 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2023-11-23 22:44:00,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2023-11-23 22:44:00,762 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2023-11-23 22:44:00,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2023-11-23 22:44:00,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2023-11-23 22:44:00,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2023-11-23 22:44:00,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2023-11-23 22:44:00,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:44:00,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 154 states and 188 transitions. [2023-11-23 22:44:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2023-11-23 22:44:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2023-11-23 22:44:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 116 states have internal predecessors, (142), 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-23 22:44:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2023-11-23 22:44:00,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 142 transitions. [2023-11-23 22:44:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:44:00,786 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2023-11-23 22:44:00,787 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-23 22:44:00,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2023-11-23 22:44:00,789 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2023-11-23 22:44:00,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:44:00,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:44:00,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:44:00,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-23 22:44:00,799 INFO L748 eck$LassoCheckResult]: Stem: 1721#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1708#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1709#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1711#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1712#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1726#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1763#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1761#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1759#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1757#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1755#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1753#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1751#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1749#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1747#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1745#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1743#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1741#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1739#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1737#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1735#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1733#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1732#L34-3 assume !(main_~i~1#1 < 10); 1699#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1700#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1715#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1790#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1788#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1716#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1717#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1718#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1719#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1720#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1785#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1783#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1781#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1779#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1777#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1775#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1773#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1772#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1770#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1768#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1767#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1766#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1765#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1764#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1762#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1760#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1758#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1756#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1754#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1752#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1750#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1748#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1746#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1744#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1742#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1740#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1738#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1736#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1730#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1734#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1731#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1729#L20-3 assume !(max_~i~0#1 < 10); 1710#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1707#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1705#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1706#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1811#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1724#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1725#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1695#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1696#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1713#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1810#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1809#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1808#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1807#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1806#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1805#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1804#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1803#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1802#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1801#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1800#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1799#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1798#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1797#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1796#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1795#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1794#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1793#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1792#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1791#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1789#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1787#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1786#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1784#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1782#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1780#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1778#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1776#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1774#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1728#L21-3 [2023-11-23 22:44:00,800 INFO L750 eck$LassoCheckResult]: Loop: 1728#L21-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1771#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1769#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1727#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1728#L21-3 [2023-11-23 22:44:00,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:44:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 2 times [2023-11-23 22:44:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:44:00,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882351173] [2023-11-23 22:44:00,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:44:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:00,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:44:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:01,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:44:01,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:44:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2023-11-23 22:44:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:44:01,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136200458] [2023-11-23 22:44:01,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:01,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:44:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:01,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:44:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:01,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:44:01,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:44:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2023-11-23 22:44:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:44:01,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593643378] [2023-11-23 22:44:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:44:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:44:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 37 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-23 22:44:01,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:44:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593643378] [2023-11-23 22:44:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593643378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:44:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376468120] [2023-11-23 22:44:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:01,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:44:01,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:44:01,715 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:44:01,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62aa144f-12ac-4556-b16e-3cbf4fe91c6e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-23 22:44:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:44:01,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 22:44:01,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:44:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-23 22:44:01,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:44:01,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376468120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:44:01,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:44:01,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2023-11-23 22:44:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017374221] [2023-11-23 22:44:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:44:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:44:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 22:44:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2023-11-23 22:44:02,074 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 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-23 22:44:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:44:02,365 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2023-11-23 22:44:02,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2023-11-23 22:44:02,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-23 22:44:02,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2023-11-23 22:44:02,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2023-11-23 22:44:02,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2023-11-23 22:44:02,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2023-11-23 22:44:02,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:44:02,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 133 transitions. [2023-11-23 22:44:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2023-11-23 22:44:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-23 22:44:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.1875) internal successors, (133), 111 states have internal predecessors, (133), 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-23 22:44:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2023-11-23 22:44:02,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 133 transitions. [2023-11-23 22:44:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 22:44:02,380 INFO L428 stractBuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2023-11-23 22:44:02,380 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-23 22:44:02,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2023-11-23 22:44:02,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-23 22:44:02,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:44:02,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:44:02,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:44:02,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-23 22:44:02,386 INFO L748 eck$LassoCheckResult]: Stem: 2326#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 2316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 2317#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2328#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2329#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2319#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2320#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2417#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2416#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2415#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2414#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2413#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2412#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2411#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2410#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2409#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2408#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2407#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2406#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2405#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2404#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 2403#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2402#L34-3 assume !(main_~i~1#1 < 10); 2310#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2311#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2322#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2323#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2324#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2325#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2400#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2398#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2396#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2394#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2392#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2390#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2388#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2386#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2384#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2382#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2380#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2378#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2376#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2374#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2372#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2370#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2368#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2366#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2364#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2362#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2360#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2358#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2356#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2354#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2352#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2350#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2348#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2346#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2344#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2342#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2340#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2338#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2336#L21 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2334#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2332#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2331#L20-3 assume !(max_~i~0#1 < 10); 2318#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2315#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2314#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2306#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2307#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2321#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2327#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2401#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2399#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2397#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2395#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2393#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2391#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2389#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2387#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2385#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2383#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2381#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2379#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2377#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2375#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2373#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2371#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2369#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2367#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2365#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2363#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2361#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2359#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2357#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2355#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2353#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2351#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2349#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2347#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2345#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2343#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2341#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2339#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2337#L21-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2335#L21-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2333#L20-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2330#L20-8 assume !(max_~i~0#1 < 10); 2308#L20-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2309#max_returnLabel#2 main_#t~ret10#1 := max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;call main_#t~mem11#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1;main_~i~2#1 := 0; 2313#L43-3 [2023-11-23 22:44:02,386 INFO L750 eck$LassoCheckResult]: Loop: 2313#L43-3 assume !!(main_~i~2#1 < 9);call main_#t~mem13#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem13#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem13#1; 2312#L43-2 main_#t~post12#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 2313#L43-3 [2023-11-23 22:44:02,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:44:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2023-11-23 22:44:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:44:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773357467] [2023-11-23 22:44:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:44:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:02,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:44:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:02,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:44:02,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:44:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2023-11-23 22:44:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:44:02,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929403036] [2023-11-23 22:44:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:44:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:02,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:44:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:02,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:44:02,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:44:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2023-11-23 22:44:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:44:02,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357997108] [2023-11-23 22:44:02,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:44:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:44:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:02,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:44:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:44:02,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:44:43,272 WARN L293 SmtUtils]: Spent 40.32s on a formula simplification. DAG size of input: 615 DAG size of output: 468 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)