./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-acceleration/array_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-acceleration/array_2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme --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 d1726b0c52a0be10cb8b374bfde8cdbfe3513d4b934203f7e56a3a1bce5e9e5b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:01:39,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:01:39,627 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-26 12:01:39,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:01:39,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:01:39,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:01:39,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:01:39,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:01:39,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:01:39,687 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:01:39,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:01:39,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:01:39,689 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:01:39,692 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 12:01:39,692 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 12:01:39,693 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 12:01:39,693 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 12:01:39,694 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 12:01:39,694 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 12:01:39,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:01:39,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 12:01:39,696 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:01:39,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:01:39,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:01:39,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:01:39,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 12:01:39,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 12:01:39,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 12:01:39,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:01:39,699 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:01:39,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:01:39,701 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 12:01:39,701 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:01:39,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:01:39,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:01:39,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:01:39,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:01:39,703 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 12:01:39,703 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_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/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_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme 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 -> d1726b0c52a0be10cb8b374bfde8cdbfe3513d4b934203f7e56a3a1bce5e9e5b [2023-11-26 12:01:40,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:01:40,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:01:40,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:01:40,105 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:01:40,106 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:01:40,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/loop-acceleration/array_2-1.i [2023-11-26 12:01:43,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:01:43,466 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:01:43,466 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/sv-benchmarks/c/loop-acceleration/array_2-1.i [2023-11-26 12:01:43,474 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/data/3ae07dc7b/01243763f72e42cc92bf2ecdc60a8e43/FLAG30f45ebcb [2023-11-26 12:01:43,490 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/data/3ae07dc7b/01243763f72e42cc92bf2ecdc60a8e43 [2023-11-26 12:01:43,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:01:43,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:01:43,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:01:43,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:01:43,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:01:43,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d27232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43, skipping insertion in model container [2023-11-26 12:01:43,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,533 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:01:43,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:01:43,782 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:01:43,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:01:43,863 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:01:43,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43 WrapperNode [2023-11-26 12:01:43,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:01:43,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:01:43,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:01:43,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:01:43,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,910 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2023-11-26 12:01:43,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:01:43,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:01:43,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:01:43,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:01:43,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,952 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 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, 2, 1]. [2023-11-26 12:01:43,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:01:43,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:01:43,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:01:43,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:01:43,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (1/1) ... [2023-11-26 12:01:43,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:44,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:44,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:44,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 12:01:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:01:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:01:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:01:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:01:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:01:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:01:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:01:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:01:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:01:44,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:01:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 12:01:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 12:01:44,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 12:01:44,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:01:44,144 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:01:44,146 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:01:44,294 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:01:44,303 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:01:44,304 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 12:01:44,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:44 BoogieIcfgContainer [2023-11-26 12:01:44,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:01:44,307 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 12:01:44,307 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 12:01:44,311 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 12:01:44,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:01:44,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 12:01:43" (1/3) ... [2023-11-26 12:01:44,313 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2adbfb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 12:01:44, skipping insertion in model container [2023-11-26 12:01:44,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:01:44,313 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:43" (2/3) ... [2023-11-26 12:01:44,314 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2adbfb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 12:01:44, skipping insertion in model container [2023-11-26 12:01:44,314 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:01:44,314 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:44" (3/3) ... [2023-11-26 12:01:44,316 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_2-1.i [2023-11-26 12:01:44,389 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 12:01:44,389 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 12:01:44,389 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 12:01:44,389 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 12:01:44,390 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 12:01:44,390 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 12:01:44,390 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 12:01:44,390 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 12:01:44,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:44,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 12:01:44,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:01:44,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:01:44,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:01:44,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 12:01:44,417 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 12:01:44,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:44,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 12:01:44,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:01:44,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:01:44,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:01:44,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 12:01:44,428 INFO L748 eck$LassoCheckResult]: Stem: 13#$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(12, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 6#L25-3true [2023-11-26 12:01:44,428 INFO L750 eck$LassoCheckResult]: Loop: 6#L25-3true assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10#L25-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6#L25-3true [2023-11-26 12:01:44,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-26 12:01:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291010142] [2023-11-26 12:01:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:44,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:44,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:44,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-26 12:01:44,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323278679] [2023-11-26 12:01:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:44,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:44,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:44,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-26 12:01:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:44,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109879135] [2023-11-26 12:01:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:44,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:44,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:45,224 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 12:01:45,224 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 12:01:45,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 12:01:45,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 12:01:45,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-26 12:01:45,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:45,227 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 12:01:45,227 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 12:01:45,227 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_2-1.i_Iteration1_Lasso [2023-11-26 12:01:45,228 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 12:01:45,228 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 12:01:45,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:01:45,924 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 12:01:45,929 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-26 12:01:45,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:45,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:45,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-26 12:01:45,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:45,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:45,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:01:45,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:45,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:45,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:45,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 12:01:45,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:01:45,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:01:45,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-11-26 12:01:45,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:45,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:46,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:46,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:46,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:46,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:46,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 12:01:46,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 12:01:46,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-26 12:01:46,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:01:46,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:46,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:46,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-26 12:01:46,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:46,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:46,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:46,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:46,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 12:01:46,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 12:01:46,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:01:46,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:46,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:46,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-26 12:01:46,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:46,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:46,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:01:46,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:46,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:46,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:46,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 12:01:46,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:01:46,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:01:46,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:46,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:46,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:46,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:46,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:01:46,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-26 12:01:46,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:46,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:46,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:46,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 12:01:46,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:01:46,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:01:46,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:46,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:46,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:46,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:01:46,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:46,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:46,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:46,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 12:01:46,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:01:46,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-26 12:01:46,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:01:46,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:46,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:46,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,264 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:46,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:46,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:46,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:46,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:46,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-26 12:01:46,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 12:01:46,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 12:01:46,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:01:46,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:46,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:46,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,324 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:46,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-26 12:01:46,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:46,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:46,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:46,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:46,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 12:01:46,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 12:01:46,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:01:46,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:46,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:46,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,372 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:01:46,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:01:46,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:01:46,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:01:46,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:01:46,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-26 12:01:46,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 12:01:46,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 12:01:46,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-26 12:01:46,517 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2023-11-26 12:01:46,518 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2023-11-26 12:01:46,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:01:46,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:46,552 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:46,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-26 12:01:46,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-26 12:01:46,587 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-26 12:01:46,587 INFO L513 LassoAnalysis]: Proved termination. [2023-11-26 12:01:46,588 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#B~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 4095*v_rep(select #length ULTIMATE.start_main_~#B~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-26 12:01:46,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:46,626 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2023-11-26 12:01:46,635 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#B~0!base] could not be translated [2023-11-26 12:01:46,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:46,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:01:46,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:01:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:46,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 12:01:46,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:01:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:46,761 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-26 12:01:46,763 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:46,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 31 states and 43 transitions. Complement of second has 8 states. [2023-11-26 12:01:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-26 12:01:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-11-26 12:01:46,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-26 12:01:46,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:01:46,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-26 12:01:46,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:01:46,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-26 12:01:46,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:01:46,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions. [2023-11-26 12:01:46,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:46,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 8 states and 10 transitions. [2023-11-26 12:01:46,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-11-26 12:01:46,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-11-26 12:01:46,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2023-11-26 12:01:46,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:46,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2023-11-26 12:01:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2023-11-26 12:01:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-26 12:01:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2023-11-26 12:01:46,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2023-11-26 12:01:46,859 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2023-11-26 12:01:46,859 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 12:01:46,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2023-11-26 12:01:46,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:46,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:01:46,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:01:46,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-26 12:01:46,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 12:01:46,861 INFO L748 eck$LassoCheckResult]: Stem: 124#$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(12, 2); 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 122#L25-3 assume !(main_~i~0#1 < 2048); 123#L25-4 main_~i~0#1 := 0; 120#L29-3 [2023-11-26 12:01:46,861 INFO L750 eck$LassoCheckResult]: Loop: 120#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 121#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 120#L29-3 [2023-11-26 12:01:46,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-26 12:01:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23472729] [2023-11-26 12:01:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:46,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23472729] [2023-11-26 12:01:46,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23472729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:46,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:46,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:01:46,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002463912] [2023-11-26 12:01:46,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:46,936 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:01:46,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2023-11-26 12:01:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700571194] [2023-11-26 12:01:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:46,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:46,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:46,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:47,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:47,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:47,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:47,102 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:47,123 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2023-11-26 12:01:47,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2023-11-26 12:01:47,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:47,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2023-11-26 12:01:47,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-26 12:01:47,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-26 12:01:47,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2023-11-26 12:01:47,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:47,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-11-26 12:01:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2023-11-26 12:01:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2023-11-26 12:01:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-11-26 12:01:47,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-26 12:01:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:47,129 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-26 12:01:47,129 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 12:01:47,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2023-11-26 12:01:47,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:47,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:01:47,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:01:47,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:01:47,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 12:01:47,131 INFO L748 eck$LassoCheckResult]: Stem: 149#$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(12, 2); 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 147#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 143#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 144#L25-3 assume !(main_~i~0#1 < 2048); 148#L25-4 main_~i~0#1 := 0; 145#L29-3 [2023-11-26 12:01:47,131 INFO L750 eck$LassoCheckResult]: Loop: 145#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 146#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 145#L29-3 [2023-11-26 12:01:47,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-26 12:01:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:47,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758157253] [2023-11-26 12:01:47,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:47,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:47,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758157253] [2023-11-26 12:01:47,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758157253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:01:47,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056560171] [2023-11-26 12:01:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:47,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:01:47,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:47,220 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:01:47,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-26 12:01:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:47,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:01:47,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:01:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:47,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:01:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056560171] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:01:47,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:01:47,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-26 12:01:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136200161] [2023-11-26 12:01:47,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:01:47,331 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:01:47,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:47,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2023-11-26 12:01:47,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:47,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070054299] [2023-11-26 12:01:47,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:47,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:47,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:47,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:47,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:01:47,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:01:47,442 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:47,492 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2023-11-26 12:01:47,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2023-11-26 12:01:47,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:47,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2023-11-26 12:01:47,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-26 12:01:47,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-26 12:01:47,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2023-11-26 12:01:47,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:47,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-11-26 12:01:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2023-11-26 12:01:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2023-11-26 12:01:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 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) [2023-11-26 12:01:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-26 12:01:47,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-26 12:01:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:01:47,498 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-26 12:01:47,498 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 12:01:47,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2023-11-26 12:01:47,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:47,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:01:47,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:01:47,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-26 12:01:47,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 12:01:47,500 INFO L748 eck$LassoCheckResult]: Stem: 220#$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(12, 2); 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 216#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 217#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 218#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 212#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 213#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 225#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 224#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 223#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 222#L25-3 assume !(main_~i~0#1 < 2048); 219#L25-4 main_~i~0#1 := 0; 214#L29-3 [2023-11-26 12:01:47,500 INFO L750 eck$LassoCheckResult]: Loop: 214#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 215#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 214#L29-3 [2023-11-26 12:01:47,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-26 12:01:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399949545] [2023-11-26 12:01:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:47,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:47,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399949545] [2023-11-26 12:01:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399949545] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:01:47,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431337602] [2023-11-26 12:01:47,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 12:01:47,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:01:47,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:47,679 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:01:47,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-26 12:01:47,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 12:01:47,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:01:47,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 12:01:47,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:01:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:47,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:01:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431337602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:01:47,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:01:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-26 12:01:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913925846] [2023-11-26 12:01:47,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:01:47,874 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:01:47,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2023-11-26 12:01:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106868901] [2023-11-26 12:01:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:47,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:47,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:47,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-26 12:01:47,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-26 12:01:47,998 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:48,128 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2023-11-26 12:01:48,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2023-11-26 12:01:48,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:48,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2023-11-26 12:01:48,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-26 12:01:48,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-26 12:01:48,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2023-11-26 12:01:48,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:48,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 46 transitions. [2023-11-26 12:01:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2023-11-26 12:01:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2023-11-26 12:01:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 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) [2023-11-26 12:01:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-11-26 12:01:48,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-11-26 12:01:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 12:01:48,136 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-11-26 12:01:48,136 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-26 12:01:48,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2023-11-26 12:01:48,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:48,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:01:48,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:01:48,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-11-26 12:01:48,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 12:01:48,139 INFO L748 eck$LassoCheckResult]: Stem: 361#$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(12, 2); 362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 357#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 358#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 359#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 353#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 354#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 378#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 377#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 376#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 375#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 374#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 373#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 372#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 371#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 370#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 369#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 368#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 367#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 366#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 365#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 364#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 363#L25-3 assume !(main_~i~0#1 < 2048); 360#L25-4 main_~i~0#1 := 0; 355#L29-3 [2023-11-26 12:01:48,139 INFO L750 eck$LassoCheckResult]: Loop: 355#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 356#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 355#L29-3 [2023-11-26 12:01:48,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-11-26 12:01:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105773157] [2023-11-26 12:01:48,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:48,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105773157] [2023-11-26 12:01:48,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105773157] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:01:48,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252378670] [2023-11-26 12:01:48,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 12:01:48,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:01:48,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:48,509 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:01:48,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-26 12:01:49,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-26 12:01:49,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:01:49,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-26 12:01:49,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:01:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:49,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:01:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:49,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252378670] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:01:49,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:01:49,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-26 12:01:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822324293] [2023-11-26 12:01:49,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:01:49,421 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:01:49,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2023-11-26 12:01:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:49,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231133049] [2023-11-26 12:01:49,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:49,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:49,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:49,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-26 12:01:49,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-26 12:01:49,526 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:49,759 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2023-11-26 12:01:49,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 94 transitions. [2023-11-26 12:01:49,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:49,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 94 transitions. [2023-11-26 12:01:49,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2023-11-26 12:01:49,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2023-11-26 12:01:49,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 94 transitions. [2023-11-26 12:01:49,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:49,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 94 transitions. [2023-11-26 12:01:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 94 transitions. [2023-11-26 12:01:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 50. [2023-11-26 12:01:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 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) [2023-11-26 12:01:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2023-11-26 12:01:49,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2023-11-26 12:01:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-26 12:01:49,771 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2023-11-26 12:01:49,771 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-26 12:01:49,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2023-11-26 12:01:49,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:49,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:01:49,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:01:49,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2023-11-26 12:01:49,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 12:01:49,775 INFO L748 eck$LassoCheckResult]: Stem: 646#$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(12, 2); 647#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 642#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 643#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 644#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 638#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 639#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 687#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 686#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 685#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 684#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 683#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 682#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 681#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 680#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 679#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 678#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 677#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 676#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 675#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 674#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 673#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 672#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 671#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 670#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 669#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 668#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 667#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 666#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 665#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 664#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 663#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 662#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 661#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 660#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 659#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 658#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 657#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 656#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 655#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 654#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 653#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 652#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 651#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 650#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 649#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 648#L25-3 assume !(main_~i~0#1 < 2048); 645#L25-4 main_~i~0#1 := 0; 640#L29-3 [2023-11-26 12:01:49,776 INFO L750 eck$LassoCheckResult]: Loop: 640#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 641#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 640#L29-3 [2023-11-26 12:01:49,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2023-11-26 12:01:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:49,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76407900] [2023-11-26 12:01:49,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:50,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76407900] [2023-11-26 12:01:50,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76407900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:01:50,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191126016] [2023-11-26 12:01:50,631 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 12:01:50,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:01:50,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:50,640 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:01:50,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-26 12:01:50,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 12:01:50,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:01:50,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-26 12:01:50,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:01:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:50,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:01:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191126016] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:01:51,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:01:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-26 12:01:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724241212] [2023-11-26 12:01:51,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:01:51,870 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:01:51,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:51,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2023-11-26 12:01:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:51,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433947568] [2023-11-26 12:01:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:51,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:51,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:51,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:51,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:51,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-26 12:01:51,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-26 12:01:51,978 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:52,531 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2023-11-26 12:01:52,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 190 transitions. [2023-11-26 12:01:52,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:52,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 190 transitions. [2023-11-26 12:01:52,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2023-11-26 12:01:52,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2023-11-26 12:01:52,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 190 transitions. [2023-11-26 12:01:52,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:52,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 189 states and 190 transitions. [2023-11-26 12:01:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 190 transitions. [2023-11-26 12:01:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98. [2023-11-26 12:01:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 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) [2023-11-26 12:01:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2023-11-26 12:01:52,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2023-11-26 12:01:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-26 12:01:52,572 INFO L428 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2023-11-26 12:01:52,573 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-26 12:01:52,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2023-11-26 12:01:52,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 12:01:52,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:01:52,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:01:52,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2023-11-26 12:01:52,583 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 12:01:52,584 INFO L748 eck$LassoCheckResult]: Stem: 1219#$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(12, 2); 1220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 1215#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1216#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1217#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1211#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1212#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1308#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1307#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1306#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1305#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1304#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1303#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1302#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1301#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1300#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1299#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1298#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1297#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1296#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1295#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1294#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1293#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1292#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1291#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1290#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1289#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1288#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1287#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1286#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1285#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1284#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1283#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1282#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1281#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1280#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1279#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1278#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1277#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1276#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1275#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1274#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1273#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1272#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1271#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1270#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1269#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1268#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1267#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1266#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1265#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1264#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1263#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1262#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1261#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1260#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1259#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1258#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1257#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1256#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1255#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1254#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1253#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1252#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1251#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1250#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1249#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1248#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1247#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1246#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1245#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1244#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1243#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1242#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1241#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1240#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1239#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1238#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1237#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1236#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1235#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1234#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1233#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1232#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1231#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1230#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1229#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1228#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1227#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1226#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1225#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1224#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1223#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1222#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1221#L25-3 assume !(main_~i~0#1 < 2048); 1218#L25-4 main_~i~0#1 := 0; 1213#L29-3 [2023-11-26 12:01:52,584 INFO L750 eck$LassoCheckResult]: Loop: 1213#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 1214#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1213#L29-3 [2023-11-26 12:01:52,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2023-11-26 12:01:52,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:52,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919421704] [2023-11-26 12:01:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:52,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919421704] [2023-11-26 12:01:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919421704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:01:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985616911] [2023-11-26 12:01:55,848 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-26 12:01:55,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:01:55,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:55,852 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:01:55,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e9998e-d3f3-43fe-89d3-8b52070584c3/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process