./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a0165632 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_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX --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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:44:15,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:44:15,967 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-08 18:44:15,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:44:15,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:44:16,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:44:16,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:44:16,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:44:16,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:44:16,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:44:16,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:44:16,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:44:16,035 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:44:16,039 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 18:44:16,040 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 18:44:16,040 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 18:44:16,042 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 18:44:16,043 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 18:44:16,047 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 18:44:16,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:44:16,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 18:44:16,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:44:16,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:44:16,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:44:16,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:44:16,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 18:44:16,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 18:44:16,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 18:44:16,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:44:16,056 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:44:16,056 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:44:16,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:44:16,057 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 18:44:16,057 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:44:16,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:44:16,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:44:16,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:44:16,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:44:16,062 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 18:44:16,062 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_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/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_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2024-11-08 18:44:16,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:44:16,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:44:16,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:44:16,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:44:16,487 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:44:16,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i Unable to find full path for "g++" [2024-11-08 18:44:19,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:44:19,353 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:44:19,354 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-08 18:44:19,363 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/data/505aa2769/13ca02983bee4e3586d0727f1f728a18/FLAGce25eda3b [2024-11-08 18:44:19,704 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/data/505aa2769/13ca02983bee4e3586d0727f1f728a18 [2024-11-08 18:44:19,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:44:19,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:44:19,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:44:19,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:44:19,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:44:19,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:44:19" (1/1) ... [2024-11-08 18:44:19,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2a46cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:19, skipping insertion in model container [2024-11-08 18:44:19,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:44:19" (1/1) ... [2024-11-08 18:44:19,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:44:20,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:44:20,042 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:44:20,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:44:20,100 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:44:20,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20 WrapperNode [2024-11-08 18:44:20,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:44:20,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:44:20,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:44:20,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:44:20,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,159 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 166 [2024-11-08 18:44:20,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:44:20,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:44:20,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:44:20,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:44:20,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,208 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-08 18:44:20,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:44:20,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:44:20,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:44:20,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:44:20,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (1/1) ... [2024-11-08 18:44:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:20,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:20,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:20,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-08 18:44:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:44:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:44:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:44:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 18:44:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 18:44:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:44:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:44:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 18:44:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:44:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:44:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:44:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:44:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 18:44:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:44:20,473 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:44:20,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:44:20,879 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-08 18:44:20,880 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:44:20,905 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:44:20,906 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:44:20,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:44:20 BoogieIcfgContainer [2024-11-08 18:44:20,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:44:20,908 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 18:44:20,908 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 18:44:20,914 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 18:44:20,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 18:44:20,915 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 06:44:19" (1/3) ... [2024-11-08 18:44:20,917 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38c5a795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 06:44:20, skipping insertion in model container [2024-11-08 18:44:20,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 18:44:20,917 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:20" (2/3) ... [2024-11-08 18:44:20,918 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38c5a795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 06:44:20, skipping insertion in model container [2024-11-08 18:44:20,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 18:44:20,919 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:44:20" (3/3) ... [2024-11-08 18:44:20,920 INFO L332 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-11-08 18:44:21,006 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 18:44:21,006 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 18:44:21,006 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 18:44:21,006 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 18:44:21,007 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 18:44:21,007 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 18:44:21,007 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 18:44:21,007 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 18:44:21,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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) [2024-11-08 18:44:21,039 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 45 [2024-11-08 18:44:21,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:21,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:21,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 18:44:21,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:44:21,048 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 18:44:21,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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) [2024-11-08 18:44:21,053 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 45 [2024-11-08 18:44:21,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:21,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:21,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 18:44:21,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:44:21,065 INFO L745 eck$LassoCheckResult]: Stem: 27#$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(48, 2); 30#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 54#L33-3true [2024-11-08 18:44:21,066 INFO L747 eck$LassoCheckResult]: Loop: 54#L33-3true assume main_~x~0#1 < 100000; 46#L33-1true assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54#L33-3true [2024-11-08 18:44:21,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-08 18:44:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:21,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986030617] [2024-11-08 18:44:21,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:21,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:21,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:21,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:21,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1158, now seen corresponding path program 1 times [2024-11-08 18:44:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:21,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027117311] [2024-11-08 18:44:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:21,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:21,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2024-11-08 18:44:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685879684] [2024-11-08 18:44:21,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:21,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:21,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:21,861 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 18:44:21,862 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 18:44:21,862 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 18:44:21,862 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 18:44:21,864 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 18:44:21,864 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:21,864 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 18:44:21,864 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 18:44:21,864 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2024-11-08 18:44:21,865 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 18:44:21,865 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 18:44:21,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:21,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:21,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:21,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:21,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:21,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:22,706 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 18:44:22,713 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 18:44:22,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:22,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:22,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:22,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-08 18:44:22,723 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 [2024-11-08 18:44:22,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:22,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:44:22,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:22,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:22,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:22,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:44:22,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:44:22,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:22,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-08 18:44:22,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:22,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:22,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:22,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-08 18:44:22,789 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 [2024-11-08 18:44:22,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:22,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:44:22,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:22,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:22,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:22,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:44:22,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:44:22,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:22,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-08 18:44:22,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:22,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:22,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:22,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-08 18:44:22,849 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 [2024-11-08 18:44:22,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:22,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:22,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:22,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:22,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:22,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:22,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:22,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:44:22,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:22,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:22,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:22,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-08 18:44:22,907 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 [2024-11-08 18:44:22,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:22,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:44:22,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:22,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:22,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:22,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:44:22,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:44:22,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:22,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-08 18:44:22,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:22,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:22,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:22,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-08 18:44:22,950 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 [2024-11-08 18:44:22,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:22,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:44:22,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:22,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:22,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:22,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:44:22,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:44:22,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-08 18:44:23,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-08 18:44:23,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 [2024-11-08 18:44:23,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:23,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:23,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-08 18:44:23,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,072 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-08 18:44:23,106 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 [2024-11-08 18:44:23,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:23,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:23,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-08 18:44:23,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,218 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-08 18:44:23,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 [2024-11-08 18:44:23,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:23,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:23,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-08 18:44:23,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,275 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-08 18:44:23,279 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 [2024-11-08 18:44:23,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:23,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:23,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-08 18:44:23,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,334 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-08 18:44:23,339 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 [2024-11-08 18:44:23,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:44:23,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:44:23,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:44:23,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-08 18:44:23,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,388 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-08 18:44:23,391 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 [2024-11-08 18:44:23,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:23,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:23,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-08 18:44:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,441 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-08 18:44:23,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-08 18:44:23,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:23,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:23,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-08 18:44:23,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-08 18:44:23,516 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 [2024-11-08 18:44:23,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:23,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:23,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:44:23,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-08 18:44:23,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-08 18:44:23,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-08 18:44:23,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:23,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:23,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:23,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:23,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:44:23,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:44:23,625 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 18:44:23,653 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-08 18:44:23,654 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-08 18:44:23,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:23,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:23,668 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:23,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-08 18:44:23,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 18:44:23,706 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-08 18:44:23,706 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 18:44:23,707 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 199999 Supporting invariants [] [2024-11-08 18:44:23,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-08 18:44:23,752 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-08 18:44:23,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:23,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:44:23,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:23,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:44:23,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:23,936 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 [2024-11-08 18:44:23,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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) 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) [2024-11-08 18:44:24,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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). 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 108 states and 162 transitions. Complement of second has 6 states. [2024-11-08 18:44:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-08 18:44:24,028 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) [2024-11-08 18:44:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-11-08 18:44:24,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-08 18:44:24,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:44:24,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-08 18:44:24,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:44:24,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-08 18:44:24,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:44:24,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 162 transitions. [2024-11-08 18:44:24,039 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2024-11-08 18:44:24,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 52 states and 78 transitions. [2024-11-08 18:44:24,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-08 18:44:24,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-08 18:44:24,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 78 transitions. [2024-11-08 18:44:24,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:44:24,048 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-08 18:44:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 78 transitions. [2024-11-08 18:44:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-08 18:44:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.5) internal successors, (78), 51 states have internal predecessors, (78), 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) [2024-11-08 18:44:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2024-11-08 18:44:24,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-08 18:44:24,091 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-08 18:44:24,091 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 18:44:24,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 78 transitions. [2024-11-08 18:44:24,092 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2024-11-08 18:44:24,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:24,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:24,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-08 18:44:24,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-08 18:44:24,093 INFO L745 eck$LassoCheckResult]: Stem: 253#$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(48, 2); 254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 256#L33-3 assume !(main_~x~0#1 < 100000); 225#L33-4 main_~x~0#1 := 0; 226#L39-3 [2024-11-08 18:44:24,094 INFO L747 eck$LassoCheckResult]: Loop: 226#L39-3 assume main_~x~0#1 < main_~n~0#1; 246#L39-1 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 224#L40-3 assume !(main_~y~0#1 < main_~n~0#1); 252#L40-4 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 226#L39-3 [2024-11-08 18:44:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash 925861, now seen corresponding path program 1 times [2024-11-08 18:44:24,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278762355] [2024-11-08 18:44:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:24,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:24,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278762355] [2024-11-08 18:44:24,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278762355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:24,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:24,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:44:24,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334725785] [2024-11-08 18:44:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:24,222 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:44:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1514248, now seen corresponding path program 1 times [2024-11-08 18:44:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404661578] [2024-11-08 18:44:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:24,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:24,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:24,281 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 18:44:24,281 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 18:44:24,281 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 18:44:24,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 18:44:24,282 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 18:44:24,282 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:24,282 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 18:44:24,282 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 18:44:24,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration2_Loop [2024-11-08 18:44:24,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 18:44:24,282 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 18:44:24,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:24,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:24,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:24,340 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 18:44:24,341 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 18:44:24,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:24,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:24,345 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:24,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-08 18:44:24,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 18:44:24,350 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 18:44:24,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-08 18:44:24,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:24,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:24,398 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:24,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-08 18:44:24,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 18:44:24,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 18:44:24,689 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 18:44:24,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-08 18:44:24,693 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 18:44:24,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 18:44:24,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 18:44:24,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 18:44:24,694 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 18:44:24,694 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:24,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 18:44:24,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 18:44:24,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration2_Loop [2024-11-08 18:44:24,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 18:44:24,695 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 18:44:24,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:24,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:24,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:44:24,752 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 18:44:24,753 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 18:44:24,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:24,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:24,757 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:24,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-08 18:44:24,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-08 18:44:24,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:44:24,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:44:24,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:44:24,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:44:24,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:44:24,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:44:24,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:44:24,787 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 18:44:24,791 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 18:44:24,791 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 18:44:24,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:44:24,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:24,794 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:24,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-08 18:44:24,798 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 18:44:24,798 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 18:44:24,798 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 18:44:24,798 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-11-08 18:44:24,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-08 18:44:24,824 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 18:44:24,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:24,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:44:24,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:24,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:44:24,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:24,921 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 [2024-11-08 18:44:24,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 78 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-08 18:44:24,980 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 78 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 106 states and 160 transitions. Complement of second has 6 states. [2024-11-08 18:44:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-08 18:44:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-08 18:44:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-08 18:44:24,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-08 18:44:24,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:44:24,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-08 18:44:24,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:44:24,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 8 letters. [2024-11-08 18:44:24,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:44:24,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 160 transitions. [2024-11-08 18:44:24,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2024-11-08 18:44:24,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 55 states and 81 transitions. [2024-11-08 18:44:24,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-08 18:44:24,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-08 18:44:24,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 81 transitions. [2024-11-08 18:44:24,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 18:44:24,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-11-08 18:44:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 81 transitions. [2024-11-08 18:44:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-08 18:44:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 54 states have internal predecessors, (81), 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) [2024-11-08 18:44:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-11-08 18:44:25,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-11-08 18:44:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:25,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:44:25,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:44:25,014 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. 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) [2024-11-08 18:44:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:44:25,120 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2024-11-08 18:44:25,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 112 transitions. [2024-11-08 18:44:25,122 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 46 [2024-11-08 18:44:25,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 75 states and 104 transitions. [2024-11-08 18:44:25,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-08 18:44:25,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-08 18:44:25,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 104 transitions. [2024-11-08 18:44:25,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 18:44:25,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 104 transitions. [2024-11-08 18:44:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 104 transitions. [2024-11-08 18:44:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2024-11-08 18:44:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 48 states have internal predecessors, (70), 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) [2024-11-08 18:44:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-08 18:44:25,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-08 18:44:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:44:25,142 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-08 18:44:25,143 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 18:44:25,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 70 transitions. [2024-11-08 18:44:25,145 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2024-11-08 18:44:25,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:25,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:25,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:25,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-08 18:44:25,149 INFO L745 eck$LassoCheckResult]: Stem: 603#$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(48, 2); 570#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 571#L33-3 assume main_~x~0#1 < 100000; 598#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 599#L33-3 assume !(main_~x~0#1 < 100000); 568#L33-4 main_~x~0#1 := 0; 569#L39-3 assume main_~x~0#1 < main_~n~0#1; 596#L39-1 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 565#L40-3 [2024-11-08 18:44:25,150 INFO L747 eck$LassoCheckResult]: Loop: 565#L40-3 assume main_~y~0#1 < main_~n~0#1; 579#L40-1 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 582#L13 assume !(0 == __VERIFIER_assert_~cond#1); 564#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 565#L40-3 [2024-11-08 18:44:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 149888847, now seen corresponding path program 1 times [2024-11-08 18:44:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:25,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818747655] [2024-11-08 18:44:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:25,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818747655] [2024-11-08 18:44:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818747655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:44:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296442201] [2024-11-08 18:44:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:25,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:44:25,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:25,261 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:44:25,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-08 18:44:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:25,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:44:25,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:25,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:44:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296442201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:44:25,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:44:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 18:44:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131598971] [2024-11-08 18:44:25,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:44:25,405 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:44:25,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1790888, now seen corresponding path program 1 times [2024-11-08 18:44:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:25,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750880172] [2024-11-08 18:44:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:25,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:25,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:25,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:25,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:44:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:44:25,583 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. cyclomatic complexity: 27 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) [2024-11-08 18:44:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:44:25,831 INFO L93 Difference]: Finished difference Result 158 states and 217 transitions. [2024-11-08 18:44:25,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 217 transitions. [2024-11-08 18:44:25,834 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 91 [2024-11-08 18:44:25,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 158 states and 217 transitions. [2024-11-08 18:44:25,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2024-11-08 18:44:25,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2024-11-08 18:44:25,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 217 transitions. [2024-11-08 18:44:25,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 18:44:25,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 217 transitions. [2024-11-08 18:44:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 217 transitions. [2024-11-08 18:44:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 55. [2024-11-08 18:44:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 54 states have internal predecessors, (76), 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) [2024-11-08 18:44:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2024-11-08 18:44:25,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 76 transitions. [2024-11-08 18:44:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:44:25,845 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 76 transitions. [2024-11-08 18:44:25,845 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 18:44:25,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 76 transitions. [2024-11-08 18:44:25,846 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2024-11-08 18:44:25,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:25,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:25,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:25,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-08 18:44:25,848 INFO L745 eck$LassoCheckResult]: Stem: 862#$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(48, 2); 829#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 830#L33-3 assume main_~x~0#1 < 100000; 857#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 858#L33-3 assume main_~x~0#1 < 100000; 863#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 868#L33-3 assume main_~x~0#1 < 100000; 867#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 866#L33-3 assume main_~x~0#1 < 100000; 865#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 864#L33-3 assume !(main_~x~0#1 < 100000); 827#L33-4 main_~x~0#1 := 0; 828#L39-3 assume main_~x~0#1 < main_~n~0#1; 855#L39-1 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 824#L40-3 [2024-11-08 18:44:25,848 INFO L747 eck$LassoCheckResult]: Loop: 824#L40-3 assume main_~y~0#1 < main_~n~0#1; 838#L40-1 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 843#L13 assume !(0 == __VERIFIER_assert_~cond#1); 823#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 824#L40-3 [2024-11-08 18:44:25,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1550695330, now seen corresponding path program 2 times [2024-11-08 18:44:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:25,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013693700] [2024-11-08 18:44:25,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:25,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-08 18:44:26,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-08 18:44:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 18:44:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:26,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013693700] [2024-11-08 18:44:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013693700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:26,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:26,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:44:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723522819] [2024-11-08 18:44:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:26,110 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:44:26,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1790888, now seen corresponding path program 2 times [2024-11-08 18:44:26,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:26,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197075691] [2024-11-08 18:44:26,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:26,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:26,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:26,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:44:26,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:44:26,262 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-11-08 18:44:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:44:26,328 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2024-11-08 18:44:26,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2024-11-08 18:44:26,329 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-08 18:44:26,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 73 transitions. [2024-11-08 18:44:26,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-08 18:44:26,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-08 18:44:26,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 73 transitions. [2024-11-08 18:44:26,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:44:26,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-08 18:44:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 73 transitions. [2024-11-08 18:44:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 18:44:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-08 18:44:26,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-08 18:44:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:44:26,343 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-08 18:44:26,344 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-08 18:44:26,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2024-11-08 18:44:26,346 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-08 18:44:26,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:26,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:26,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:26,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:44:26,348 INFO L745 eck$LassoCheckResult]: Stem: 971#$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(48, 2); 943#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 944#L33-3 assume main_~x~0#1 < 100000; 972#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 973#L33-3 assume main_~x~0#1 < 100000; 966#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 967#L33-3 assume main_~x~0#1 < 100000; 985#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 984#L33-3 assume main_~x~0#1 < 100000; 983#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 982#L33-3 assume !(main_~x~0#1 < 100000); 941#L33-4 main_~x~0#1 := 0; 942#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 960#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 961#L47-3 [2024-11-08 18:44:26,348 INFO L747 eck$LassoCheckResult]: Loop: 961#L47-3 assume main_~v~0#1 < 100000; 970#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 961#L47-3 [2024-11-08 18:44:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1550694181, now seen corresponding path program 1 times [2024-11-08 18:44:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894202844] [2024-11-08 18:44:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:26,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894202844] [2024-11-08 18:44:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894202844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:44:26,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478860660] [2024-11-08 18:44:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:26,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:44:26,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:26,572 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:44:26,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-08 18:44:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:26,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:44:26,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:26,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:44:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478860660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:44:26,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:44:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-08 18:44:26,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726901138] [2024-11-08 18:44:26,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:44:26,807 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:44:26,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:26,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 1 times [2024-11-08 18:44:26,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:26,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703829399] [2024-11-08 18:44:26,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:26,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:26,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:44:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:44:26,887 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 24 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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) [2024-11-08 18:44:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:44:27,220 INFO L93 Difference]: Finished difference Result 206 states and 285 transitions. [2024-11-08 18:44:27,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 285 transitions. [2024-11-08 18:44:27,223 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 148 [2024-11-08 18:44:27,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 206 states and 285 transitions. [2024-11-08 18:44:27,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2024-11-08 18:44:27,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2024-11-08 18:44:27,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 285 transitions. [2024-11-08 18:44:27,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:44:27,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 206 states and 285 transitions. [2024-11-08 18:44:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 285 transitions. [2024-11-08 18:44:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 66. [2024-11-08 18:44:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 65 states have internal predecessors, (85), 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) [2024-11-08 18:44:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-11-08 18:44:27,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-08 18:44:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:44:27,245 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-08 18:44:27,245 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-08 18:44:27,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 85 transitions. [2024-11-08 18:44:27,246 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-08 18:44:27,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:27,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:27,247 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:27,247 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:44:27,247 INFO L745 eck$LassoCheckResult]: Stem: 1327#$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(48, 2); 1297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1298#L33-3 assume main_~x~0#1 < 100000; 1321#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1322#L33-3 assume main_~x~0#1 < 100000; 1329#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1348#L33-3 assume main_~x~0#1 < 100000; 1347#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1346#L33-3 assume main_~x~0#1 < 100000; 1345#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1344#L33-3 assume main_~x~0#1 < 100000; 1343#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1342#L33-3 assume main_~x~0#1 < 100000; 1341#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1340#L33-3 assume main_~x~0#1 < 100000; 1339#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1338#L33-3 assume main_~x~0#1 < 100000; 1337#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1336#L33-3 assume main_~x~0#1 < 100000; 1335#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1334#L33-3 assume main_~x~0#1 < 100000; 1331#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1330#L33-3 assume !(main_~x~0#1 < 100000); 1295#L33-4 main_~x~0#1 := 0; 1296#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1315#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1316#L47-3 [2024-11-08 18:44:27,248 INFO L747 eck$LassoCheckResult]: Loop: 1316#L47-3 assume main_~v~0#1 < 100000; 1326#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1316#L47-3 [2024-11-08 18:44:27,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2143563065, now seen corresponding path program 2 times [2024-11-08 18:44:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597743175] [2024-11-08 18:44:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:27,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:27,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597743175] [2024-11-08 18:44:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597743175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:44:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749820083] [2024-11-08 18:44:27,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:44:27,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:44:27,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:27,601 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:44:27,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-08 18:44:27,713 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:44:27,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:44:27,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 18:44:27,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:27,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:44:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749820083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:44:28,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:44:28,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-08 18:44:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990441477] [2024-11-08 18:44:28,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:44:28,079 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:44:28,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:28,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 2 times [2024-11-08 18:44:28,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:28,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981745425] [2024-11-08 18:44:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:28,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:28,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:28,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 18:44:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:44:28,158 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. cyclomatic complexity: 24 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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) [2024-11-08 18:44:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:44:28,899 INFO L93 Difference]: Finished difference Result 398 states and 549 transitions. [2024-11-08 18:44:28,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 549 transitions. [2024-11-08 18:44:28,903 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 280 [2024-11-08 18:44:28,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 398 states and 549 transitions. [2024-11-08 18:44:28,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2024-11-08 18:44:28,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2024-11-08 18:44:28,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 398 states and 549 transitions. [2024-11-08 18:44:28,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:44:28,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 398 states and 549 transitions. [2024-11-08 18:44:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states and 549 transitions. [2024-11-08 18:44:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 90. [2024-11-08 18:44:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.211111111111111) internal successors, (109), 89 states have internal predecessors, (109), 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) [2024-11-08 18:44:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2024-11-08 18:44:28,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 109 transitions. [2024-11-08 18:44:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:44:28,918 INFO L425 stractBuchiCegarLoop]: Abstraction has 90 states and 109 transitions. [2024-11-08 18:44:28,918 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-08 18:44:28,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 109 transitions. [2024-11-08 18:44:28,919 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-08 18:44:28,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:28,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:28,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:28,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:44:28,921 INFO L745 eck$LassoCheckResult]: Stem: 1969#$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(48, 2); 1939#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1940#L33-3 assume main_~x~0#1 < 100000; 1963#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1964#L33-3 assume main_~x~0#1 < 100000; 1971#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2014#L33-3 assume main_~x~0#1 < 100000; 2013#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2012#L33-3 assume main_~x~0#1 < 100000; 2011#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2010#L33-3 assume main_~x~0#1 < 100000; 2009#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2008#L33-3 assume main_~x~0#1 < 100000; 2007#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2006#L33-3 assume main_~x~0#1 < 100000; 2005#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2004#L33-3 assume main_~x~0#1 < 100000; 2003#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2002#L33-3 assume main_~x~0#1 < 100000; 2001#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2000#L33-3 assume main_~x~0#1 < 100000; 1999#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1998#L33-3 assume main_~x~0#1 < 100000; 1997#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1996#L33-3 assume main_~x~0#1 < 100000; 1995#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1994#L33-3 assume main_~x~0#1 < 100000; 1993#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1992#L33-3 assume main_~x~0#1 < 100000; 1991#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1990#L33-3 assume main_~x~0#1 < 100000; 1989#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1988#L33-3 assume main_~x~0#1 < 100000; 1987#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1986#L33-3 assume main_~x~0#1 < 100000; 1985#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1984#L33-3 assume main_~x~0#1 < 100000; 1983#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1982#L33-3 assume main_~x~0#1 < 100000; 1981#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1980#L33-3 assume main_~x~0#1 < 100000; 1979#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1978#L33-3 assume main_~x~0#1 < 100000; 1977#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1976#L33-3 assume main_~x~0#1 < 100000; 1973#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1972#L33-3 assume !(main_~x~0#1 < 100000); 1937#L33-4 main_~x~0#1 := 0; 1938#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1957#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1958#L47-3 [2024-11-08 18:44:28,921 INFO L747 eck$LassoCheckResult]: Loop: 1958#L47-3 assume main_~v~0#1 < 100000; 1968#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1958#L47-3 [2024-11-08 18:44:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash 132030197, now seen corresponding path program 3 times [2024-11-08 18:44:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984121336] [2024-11-08 18:44:28,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:29,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984121336] [2024-11-08 18:44:29,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984121336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:44:29,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482474347] [2024-11-08 18:44:29,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:44:29,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:44:29,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:29,968 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:44:29,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-08 18:44:32,935 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-08 18:44:32,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:44:32,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 18:44:32,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:33,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:44:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:34,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482474347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:44:34,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:44:34,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-08 18:44:34,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889252255] [2024-11-08 18:44:34,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:44:34,356 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:44:34,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 3 times [2024-11-08 18:44:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268150150] [2024-11-08 18:44:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:34,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:34,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:34,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:34,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-08 18:44:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 18:44:34,435 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. cyclomatic complexity: 24 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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) [2024-11-08 18:44:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:44:35,980 INFO L93 Difference]: Finished difference Result 782 states and 1077 transitions. [2024-11-08 18:44:35,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 782 states and 1077 transitions. [2024-11-08 18:44:35,988 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 544 [2024-11-08 18:44:35,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 782 states to 782 states and 1077 transitions. [2024-11-08 18:44:35,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 690 [2024-11-08 18:44:35,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 690 [2024-11-08 18:44:35,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 782 states and 1077 transitions. [2024-11-08 18:44:35,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:44:35,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 782 states and 1077 transitions. [2024-11-08 18:44:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states and 1077 transitions. [2024-11-08 18:44:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 138. [2024-11-08 18:44:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 137 states have internal predecessors, (157), 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) [2024-11-08 18:44:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2024-11-08 18:44:36,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 157 transitions. [2024-11-08 18:44:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 18:44:36,013 INFO L425 stractBuchiCegarLoop]: Abstraction has 138 states and 157 transitions. [2024-11-08 18:44:36,014 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-08 18:44:36,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 157 transitions. [2024-11-08 18:44:36,015 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-08 18:44:36,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:36,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:36,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:36,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:44:36,018 INFO L745 eck$LassoCheckResult]: Stem: 3187#$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(48, 2); 3157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 3158#L33-3 assume main_~x~0#1 < 100000; 3181#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3182#L33-3 assume main_~x~0#1 < 100000; 3189#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3280#L33-3 assume main_~x~0#1 < 100000; 3279#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3278#L33-3 assume main_~x~0#1 < 100000; 3277#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3276#L33-3 assume main_~x~0#1 < 100000; 3275#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3274#L33-3 assume main_~x~0#1 < 100000; 3273#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3272#L33-3 assume main_~x~0#1 < 100000; 3271#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3270#L33-3 assume main_~x~0#1 < 100000; 3269#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3268#L33-3 assume main_~x~0#1 < 100000; 3267#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3266#L33-3 assume main_~x~0#1 < 100000; 3265#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3264#L33-3 assume main_~x~0#1 < 100000; 3263#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3262#L33-3 assume main_~x~0#1 < 100000; 3261#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3260#L33-3 assume main_~x~0#1 < 100000; 3259#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3258#L33-3 assume main_~x~0#1 < 100000; 3257#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3256#L33-3 assume main_~x~0#1 < 100000; 3255#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3254#L33-3 assume main_~x~0#1 < 100000; 3253#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3252#L33-3 assume main_~x~0#1 < 100000; 3251#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3250#L33-3 assume main_~x~0#1 < 100000; 3249#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3248#L33-3 assume main_~x~0#1 < 100000; 3247#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3246#L33-3 assume main_~x~0#1 < 100000; 3245#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3244#L33-3 assume main_~x~0#1 < 100000; 3243#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3242#L33-3 assume main_~x~0#1 < 100000; 3241#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3240#L33-3 assume main_~x~0#1 < 100000; 3239#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3238#L33-3 assume main_~x~0#1 < 100000; 3237#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3236#L33-3 assume main_~x~0#1 < 100000; 3235#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3234#L33-3 assume main_~x~0#1 < 100000; 3233#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3232#L33-3 assume main_~x~0#1 < 100000; 3231#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3230#L33-3 assume main_~x~0#1 < 100000; 3229#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3228#L33-3 assume main_~x~0#1 < 100000; 3227#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3226#L33-3 assume main_~x~0#1 < 100000; 3225#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3224#L33-3 assume main_~x~0#1 < 100000; 3223#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3222#L33-3 assume main_~x~0#1 < 100000; 3221#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3220#L33-3 assume main_~x~0#1 < 100000; 3219#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3218#L33-3 assume main_~x~0#1 < 100000; 3217#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3216#L33-3 assume main_~x~0#1 < 100000; 3215#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3214#L33-3 assume main_~x~0#1 < 100000; 3213#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3212#L33-3 assume main_~x~0#1 < 100000; 3211#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3210#L33-3 assume main_~x~0#1 < 100000; 3209#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3208#L33-3 assume main_~x~0#1 < 100000; 3207#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3206#L33-3 assume main_~x~0#1 < 100000; 3205#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3204#L33-3 assume main_~x~0#1 < 100000; 3203#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3202#L33-3 assume main_~x~0#1 < 100000; 3201#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3200#L33-3 assume main_~x~0#1 < 100000; 3199#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3198#L33-3 assume main_~x~0#1 < 100000; 3197#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3196#L33-3 assume main_~x~0#1 < 100000; 3195#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3194#L33-3 assume main_~x~0#1 < 100000; 3191#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3190#L33-3 assume !(main_~x~0#1 < 100000); 3155#L33-4 main_~x~0#1 := 0; 3156#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 3175#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 3176#L47-3 [2024-11-08 18:44:36,018 INFO L747 eck$LassoCheckResult]: Loop: 3176#L47-3 assume main_~v~0#1 < 100000; 3186#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3176#L47-3 [2024-11-08 18:44:36,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1502619245, now seen corresponding path program 4 times [2024-11-08 18:44:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507257590] [2024-11-08 18:44:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507257590] [2024-11-08 18:44:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507257590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:44:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541626197] [2024-11-08 18:44:38,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 18:44:38,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:44:38,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:38,833 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:44:38,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-08 18:44:39,048 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 18:44:39,049 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:44:39,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 18:44:39,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:44:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:39,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:44:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:42,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541626197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:44:42,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:44:42,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-08 18:44:42,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773213313] [2024-11-08 18:44:42,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:44:42,948 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:44:42,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 4 times [2024-11-08 18:44:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397849598] [2024-11-08 18:44:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:42,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:42,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:43,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:43,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-08 18:44:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-08 18:44:43,019 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. cyclomatic complexity: 24 Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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) [2024-11-08 18:44:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:44:50,548 INFO L93 Difference]: Finished difference Result 1550 states and 2133 transitions. [2024-11-08 18:44:50,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1550 states and 2133 transitions. [2024-11-08 18:44:50,561 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 1072 [2024-11-08 18:44:50,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1550 states to 1550 states and 2133 transitions. [2024-11-08 18:44:50,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1362 [2024-11-08 18:44:50,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1362 [2024-11-08 18:44:50,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1550 states and 2133 transitions. [2024-11-08 18:44:50,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:44:50,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1550 states and 2133 transitions. [2024-11-08 18:44:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states and 2133 transitions. [2024-11-08 18:44:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 234. [2024-11-08 18:44:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 234 states have (on average 1.0811965811965811) internal successors, (253), 233 states have internal predecessors, (253), 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) [2024-11-08 18:44:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 253 transitions. [2024-11-08 18:44:50,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 234 states and 253 transitions. [2024-11-08 18:44:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-08 18:44:50,597 INFO L425 stractBuchiCegarLoop]: Abstraction has 234 states and 253 transitions. [2024-11-08 18:44:50,597 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-08 18:44:50,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 234 states and 253 transitions. [2024-11-08 18:44:50,599 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-08 18:44:50,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:44:50,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:44:50,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:50,602 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:44:50,603 INFO L745 eck$LassoCheckResult]: Stem: 5557#$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(48, 2); 5527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 5528#L33-3 assume main_~x~0#1 < 100000; 5551#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5552#L33-3 assume main_~x~0#1 < 100000; 5559#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5746#L33-3 assume main_~x~0#1 < 100000; 5745#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5744#L33-3 assume main_~x~0#1 < 100000; 5743#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5742#L33-3 assume main_~x~0#1 < 100000; 5741#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5740#L33-3 assume main_~x~0#1 < 100000; 5739#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5738#L33-3 assume main_~x~0#1 < 100000; 5737#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5736#L33-3 assume main_~x~0#1 < 100000; 5735#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5734#L33-3 assume main_~x~0#1 < 100000; 5733#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5732#L33-3 assume main_~x~0#1 < 100000; 5731#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5730#L33-3 assume main_~x~0#1 < 100000; 5729#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5728#L33-3 assume main_~x~0#1 < 100000; 5727#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5726#L33-3 assume main_~x~0#1 < 100000; 5725#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5724#L33-3 assume main_~x~0#1 < 100000; 5723#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5722#L33-3 assume main_~x~0#1 < 100000; 5721#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5720#L33-3 assume main_~x~0#1 < 100000; 5719#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5718#L33-3 assume main_~x~0#1 < 100000; 5717#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5716#L33-3 assume main_~x~0#1 < 100000; 5715#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5714#L33-3 assume main_~x~0#1 < 100000; 5713#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5712#L33-3 assume main_~x~0#1 < 100000; 5711#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5710#L33-3 assume main_~x~0#1 < 100000; 5709#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5708#L33-3 assume main_~x~0#1 < 100000; 5707#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5706#L33-3 assume main_~x~0#1 < 100000; 5705#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5704#L33-3 assume main_~x~0#1 < 100000; 5703#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5702#L33-3 assume main_~x~0#1 < 100000; 5701#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5700#L33-3 assume main_~x~0#1 < 100000; 5699#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5698#L33-3 assume main_~x~0#1 < 100000; 5697#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5696#L33-3 assume main_~x~0#1 < 100000; 5695#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5694#L33-3 assume main_~x~0#1 < 100000; 5693#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5692#L33-3 assume main_~x~0#1 < 100000; 5691#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5690#L33-3 assume main_~x~0#1 < 100000; 5689#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5688#L33-3 assume main_~x~0#1 < 100000; 5687#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5686#L33-3 assume main_~x~0#1 < 100000; 5685#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5684#L33-3 assume main_~x~0#1 < 100000; 5683#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5682#L33-3 assume main_~x~0#1 < 100000; 5681#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5680#L33-3 assume main_~x~0#1 < 100000; 5679#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5678#L33-3 assume main_~x~0#1 < 100000; 5677#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5676#L33-3 assume main_~x~0#1 < 100000; 5675#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5674#L33-3 assume main_~x~0#1 < 100000; 5673#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5672#L33-3 assume main_~x~0#1 < 100000; 5671#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5670#L33-3 assume main_~x~0#1 < 100000; 5669#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5668#L33-3 assume main_~x~0#1 < 100000; 5667#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5666#L33-3 assume main_~x~0#1 < 100000; 5665#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5664#L33-3 assume main_~x~0#1 < 100000; 5663#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5662#L33-3 assume main_~x~0#1 < 100000; 5661#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5660#L33-3 assume main_~x~0#1 < 100000; 5659#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5658#L33-3 assume main_~x~0#1 < 100000; 5657#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5656#L33-3 assume main_~x~0#1 < 100000; 5655#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5654#L33-3 assume main_~x~0#1 < 100000; 5653#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5652#L33-3 assume main_~x~0#1 < 100000; 5651#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5650#L33-3 assume main_~x~0#1 < 100000; 5649#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5648#L33-3 assume main_~x~0#1 < 100000; 5647#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5646#L33-3 assume main_~x~0#1 < 100000; 5645#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5644#L33-3 assume main_~x~0#1 < 100000; 5643#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5642#L33-3 assume main_~x~0#1 < 100000; 5641#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5640#L33-3 assume main_~x~0#1 < 100000; 5639#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5638#L33-3 assume main_~x~0#1 < 100000; 5637#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5636#L33-3 assume main_~x~0#1 < 100000; 5635#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5634#L33-3 assume main_~x~0#1 < 100000; 5633#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5632#L33-3 assume main_~x~0#1 < 100000; 5631#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5630#L33-3 assume main_~x~0#1 < 100000; 5629#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5628#L33-3 assume main_~x~0#1 < 100000; 5627#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5626#L33-3 assume main_~x~0#1 < 100000; 5625#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5624#L33-3 assume main_~x~0#1 < 100000; 5623#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5622#L33-3 assume main_~x~0#1 < 100000; 5621#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5620#L33-3 assume main_~x~0#1 < 100000; 5619#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5618#L33-3 assume main_~x~0#1 < 100000; 5617#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5616#L33-3 assume main_~x~0#1 < 100000; 5615#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5614#L33-3 assume main_~x~0#1 < 100000; 5613#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5612#L33-3 assume main_~x~0#1 < 100000; 5611#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5610#L33-3 assume main_~x~0#1 < 100000; 5609#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5608#L33-3 assume main_~x~0#1 < 100000; 5607#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5606#L33-3 assume main_~x~0#1 < 100000; 5605#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5604#L33-3 assume main_~x~0#1 < 100000; 5603#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5602#L33-3 assume main_~x~0#1 < 100000; 5601#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5600#L33-3 assume main_~x~0#1 < 100000; 5599#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5598#L33-3 assume main_~x~0#1 < 100000; 5597#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5596#L33-3 assume main_~x~0#1 < 100000; 5595#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5594#L33-3 assume main_~x~0#1 < 100000; 5593#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5592#L33-3 assume main_~x~0#1 < 100000; 5591#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5590#L33-3 assume main_~x~0#1 < 100000; 5589#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5588#L33-3 assume main_~x~0#1 < 100000; 5587#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5586#L33-3 assume main_~x~0#1 < 100000; 5585#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5584#L33-3 assume main_~x~0#1 < 100000; 5583#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5582#L33-3 assume main_~x~0#1 < 100000; 5581#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5580#L33-3 assume main_~x~0#1 < 100000; 5579#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5578#L33-3 assume main_~x~0#1 < 100000; 5577#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5576#L33-3 assume main_~x~0#1 < 100000; 5575#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5574#L33-3 assume main_~x~0#1 < 100000; 5573#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5572#L33-3 assume main_~x~0#1 < 100000; 5571#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5570#L33-3 assume main_~x~0#1 < 100000; 5569#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5568#L33-3 assume main_~x~0#1 < 100000; 5567#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5566#L33-3 assume main_~x~0#1 < 100000; 5565#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5564#L33-3 assume main_~x~0#1 < 100000; 5561#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5560#L33-3 assume !(main_~x~0#1 < 100000); 5525#L33-4 main_~x~0#1 := 0; 5526#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 5545#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 5546#L47-3 [2024-11-08 18:44:50,604 INFO L747 eck$LassoCheckResult]: Loop: 5546#L47-3 assume main_~v~0#1 < 100000; 5556#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5546#L47-3 [2024-11-08 18:44:50,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1107966627, now seen corresponding path program 5 times [2024-11-08 18:44:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016987047] [2024-11-08 18:44:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:44:59,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:59,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016987047] [2024-11-08 18:44:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016987047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:44:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227753151] [2024-11-08 18:44:59,992 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 18:44:59,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:44:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:59,993 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:44:59,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c876cf2-af8c-44cb-b584-eb2bb0fa8aef/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process