./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:25:04,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:25:04,197 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-28 20:25:04,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:25:04,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:25:04,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:25:04,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:25:04,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:25:04,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:25:04,233 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:25:04,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:25:04,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:25:04,235 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:25:04,236 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-28 20:25:04,237 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-28 20:25:04,237 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-28 20:25:04,238 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-28 20:25:04,238 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-28 20:25:04,239 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-28 20:25:04,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:25:04,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-28 20:25:04,241 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:25:04,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:25:04,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:25:04,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:25:04,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-28 20:25:04,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-28 20:25:04,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-28 20:25:04,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:25:04,245 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:25:04,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:25:04,245 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-28 20:25:04,246 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:25:04,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:25:04,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:25:04,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:25:04,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:25:04,247 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-28 20:25:04,247 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_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/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_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2023-11-28 20:25:04,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:25:04,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:25:04,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:25:04,501 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:25:04,502 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:25:04,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2023-11-28 20:25:07,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:25:07,738 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:25:07,739 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2023-11-28 20:25:07,747 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/data/9c98fc335/90e8e881bb464eaaa9bcc0569fd3ea66/FLAG1ecbd3ec6 [2023-11-28 20:25:07,764 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/data/9c98fc335/90e8e881bb464eaaa9bcc0569fd3ea66 [2023-11-28 20:25:07,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:25:07,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:25:07,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:25:07,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:25:07,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:25:07,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:25:07" (1/1) ... [2023-11-28 20:25:07,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22fd8dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:07, skipping insertion in model container [2023-11-28 20:25:07,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:25:07" (1/1) ... [2023-11-28 20:25:07,801 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:25:07,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:25:07,974 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:25:08,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:25:08,021 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:25:08,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08 WrapperNode [2023-11-28 20:25:08,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:25:08,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:25:08,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:25:08,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:25:08,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,072 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 179 [2023-11-28 20:25:08,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:25:08,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:25:08,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:25:08,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:25:08,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,105 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2023-11-28 20:25:08,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:25:08,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:25:08,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:25:08,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:25:08,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (1/1) ... [2023-11-28 20:25:08,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:08,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:08,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:08,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-28 20:25:08,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:25:08,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:25:08,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:25:08,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:25:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:25:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:25:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:25:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:25:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:25:08,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:25:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 20:25:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 20:25:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 20:25:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:25:08,326 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:25:08,329 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:25:08,594 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:25:08,606 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:25:08,607 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-28 20:25:08,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:25:08 BoogieIcfgContainer [2023-11-28 20:25:08,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:25:08,611 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-28 20:25:08,611 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-28 20:25:08,615 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-28 20:25:08,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-28 20:25:08,616 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:25:07" (1/3) ... [2023-11-28 20:25:08,617 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1543284e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:25:08, skipping insertion in model container [2023-11-28 20:25:08,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-28 20:25:08,617 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:25:08" (2/3) ... [2023-11-28 20:25:08,618 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1543284e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:25:08, skipping insertion in model container [2023-11-28 20:25:08,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-28 20:25:08,618 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:25:08" (3/3) ... [2023-11-28 20:25:08,620 INFO L332 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2023-11-28 20:25:08,678 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-28 20:25:08,678 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-28 20:25:08,678 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-28 20:25:08,678 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-28 20:25:08,679 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-28 20:25:08,679 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-28 20:25:08,679 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-28 20:25:08,679 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-28 20:25:08,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:08,704 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2023-11-28 20:25:08,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:08,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:08,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-28 20:25:08,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 20:25:08,711 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-28 20:25:08,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:08,717 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2023-11-28 20:25:08,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:08,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:08,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-28 20:25:08,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 20:25:08,727 INFO L748 eck$LassoCheckResult]: Stem: 23#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 50#L33-3true [2023-11-28 20:25:08,728 INFO L750 eck$LassoCheckResult]: Loop: 50#L33-3true assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 15#L33-2true main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 50#L33-3true [2023-11-28 20:25:08,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-28 20:25:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:08,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033067515] [2023-11-28 20:25:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:08,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:08,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:08,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-28 20:25:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592119091] [2023-11-28 20:25:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:08,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:08,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:08,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:08,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-28 20:25:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:08,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335729357] [2023-11-28 20:25:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:08,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:08,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:09,325 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 20:25:09,325 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 20:25:09,325 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 20:25:09,325 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 20:25:09,325 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-28 20:25:09,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:09,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 20:25:09,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 20:25:09,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2023-11-28 20:25:09,326 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 20:25:09,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 20:25:09,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 20:25:09,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 20:25:09,357 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-28 20:25:09,360 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-28 20:25:09,362 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-28 20:25:09,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 20:25:09,582 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-28 20:25:09,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 20:25:09,589 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-28 20:25:09,592 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-28 20:25:09,596 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-28 20:25:09,599 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-28 20:25:09,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 20:25:09,607 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-28 20:25:09,611 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-28 20:25:09,614 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-28 20:25:09,627 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-28 20:25:09,631 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-28 20:25:09,635 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-28 20:25:09,639 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-28 20:25:09,642 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-28 20:25:09,645 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-28 20:25:09,649 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-28 20:25:09,651 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-28 20:25:09,654 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-28 20:25:09,658 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-28 20:25:09,664 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-28 20:25:09,668 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-28 20:25:09,672 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-28 20:25:09,956 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 20:25:09,961 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-28 20:25:09,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:09,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:09,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:09,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-28 20:25:09,970 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-28 20:25:09,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:09,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 20:25:09,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:09,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:09,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:09,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 20:25:09,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 20:25:09,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:25:10,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-28 20:25:10,013 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-28 20:25:10,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 20:25:10,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 20:25:10,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 20:25:10,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-28 20:25:10,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-28 20:25:10,036 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-28 20:25:10,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 20:25:10,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 20:25:10,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 20:25:10,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-28 20:25:10,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-28 20:25:10,058 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-28 20:25:10,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 20:25:10,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 20:25:10,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 20:25:10,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-28 20:25:10,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-28 20:25:10,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 20:25:10,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 20:25:10,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 20:25:10,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-28 20:25:10,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,111 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-28 20:25:10,114 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-28 20:25:10,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 20:25:10,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 20:25:10,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-28 20:25:10,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-28 20:25:10,149 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-28 20:25:10,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 20:25:10,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 20:25:10,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-28 20:25:10,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-28 20:25:10,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 20:25:10,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 20:25:10,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 20:25:10,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-28 20:25:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,226 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-28 20:25:10,229 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-28 20:25:10,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 20:25:10,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 20:25:10,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 20:25:10,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-28 20:25:10,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,248 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-28 20:25:10,251 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-28 20:25:10,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 20:25:10,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 20:25:10,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-11-28 20:25:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,277 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-28 20:25:10,281 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-28 20:25:10,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 20:25:10,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 20:25:10,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:10,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-11-28 20:25:10,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,306 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-28 20:25:10,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 20:25:10,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:10,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:10,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:10,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:10,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 20:25:10,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 20:25:10,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-28 20:25:10,373 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-28 20:25:10,373 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-11-28 20:25:10,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,413 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-28 20:25:10,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-28 20:25:10,428 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-28 20:25:10,428 INFO L513 LassoAnalysis]: Proved termination. [2023-11-28 20:25:10,429 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2023-11-28 20:25:10,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-11-28 20:25:10,452 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-28 20:25:10,462 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#set~0!base] could not be translated [2023-11-28 20:25:10,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:10,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:25:10,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:10,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:25:10,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:10,563 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-28 20:25:10,599 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-28 20:25:10,601 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-28 20:25:10,668 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 101 states and 157 transitions. Complement of second has 8 states. [2023-11-28 20:25:10,671 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-28 20:25:10,676 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-28 20:25:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2023-11-28 20:25:10,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-28 20:25:10,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 20:25:10,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-28 20:25:10,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 20:25:10,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-28 20:25:10,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 20:25:10,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 157 transitions. [2023-11-28 20:25:10,687 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2023-11-28 20:25:10,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 48 states and 74 transitions. [2023-11-28 20:25:10,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-11-28 20:25:10,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2023-11-28 20:25:10,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2023-11-28 20:25:10,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:25:10,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2023-11-28 20:25:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2023-11-28 20:25:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-28 20:25:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 47 states have internal predecessors, (74), 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-28 20:25:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 74 transitions. [2023-11-28 20:25:10,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2023-11-28 20:25:10,729 INFO L428 stractBuchiCegarLoop]: Abstraction has 48 states and 74 transitions. [2023-11-28 20:25:10,729 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-28 20:25:10,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 74 transitions. [2023-11-28 20:25:10,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2023-11-28 20:25:10,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:10,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:10,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-28 20:25:10,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-28 20:25:10,732 INFO L748 eck$LassoCheckResult]: Stem: 254#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 221#L33-3 assume !(main_~x~0#1 < 100000); 214#L33-4 main_~x~0#1 := 0; 215#L39-3 [2023-11-28 20:25:10,732 INFO L750 eck$LassoCheckResult]: Loop: 215#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 230#L40-3 assume !true; 232#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 215#L39-3 [2023-11-28 20:25:10,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-28 20:25:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460673767] [2023-11-28 20:25:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:10,793 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-28 20:25:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:10,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460673767] [2023-11-28 20:25:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460673767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:25:10,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:25:10,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:25:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110946056] [2023-11-28 20:25:10,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:25:10,798 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:25:10,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash 54521, now seen corresponding path program 1 times [2023-11-28 20:25:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612007079] [2023-11-28 20:25:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:10,807 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-28 20:25:10,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:10,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612007079] [2023-11-28 20:25:10,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612007079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:25:10,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:25:10,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:25:10,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141838807] [2023-11-28 20:25:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:25:10,809 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-28 20:25:10,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:10,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:25:10,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:25:10,813 INFO L87 Difference]: Start difference. First operand 48 states and 74 transitions. cyclomatic complexity: 31 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-28 20:25:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:10,822 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2023-11-28 20:25:10,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2023-11-28 20:25:10,823 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2023-11-28 20:25:10,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 51 transitions. [2023-11-28 20:25:10,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-28 20:25:10,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-28 20:25:10,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2023-11-28 20:25:10,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:25:10,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-28 20:25:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2023-11-28 20:25:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-28 20:25:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 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-28 20:25:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-28 20:25:10,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-28 20:25:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:25:10,831 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-28 20:25:10,831 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-28 20:25:10,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2023-11-28 20:25:10,832 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2023-11-28 20:25:10,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:10,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:10,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-28 20:25:10,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-28 20:25:10,833 INFO L748 eck$LassoCheckResult]: Stem: 344#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 314#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 315#L33-3 assume !(main_~x~0#1 < 100000); 310#L33-4 main_~x~0#1 := 0; 311#L39-3 [2023-11-28 20:25:10,833 INFO L750 eck$LassoCheckResult]: Loop: 311#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 322#L40-3 assume !(main_~y~0#1 < main_~n~0#1); 324#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 311#L39-3 [2023-11-28 20:25:10,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2023-11-28 20:25:10,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:10,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363021023] [2023-11-28 20:25:10,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:10,868 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-28 20:25:10,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:10,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363021023] [2023-11-28 20:25:10,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363021023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:25:10,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:25:10,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:25:10,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893977122] [2023-11-28 20:25:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:25:10,870 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:25:10,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash 53839, now seen corresponding path program 1 times [2023-11-28 20:25:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914680413] [2023-11-28 20:25:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:10,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:10,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:10,911 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 20:25:10,911 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 20:25:10,911 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 20:25:10,911 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 20:25:10,911 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-28 20:25:10,911 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,911 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 20:25:10,911 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 20:25:10,911 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2023-11-28 20:25:10,912 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 20:25:10,912 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 20:25:10,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 20:25:10,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 20:25:10,959 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 20:25:10,960 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-28 20:25:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,962 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-28 20:25:10,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-28 20:25:10,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-28 20:25:10,984 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-28 20:25:10,984 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-28 20:25:10,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-28 20:25:10,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:10,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:10,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:10,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-28 20:25:10,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-28 20:25:10,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-28 20:25:11,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-11-28 20:25:11,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:11,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:11,013 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:11,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-28 20:25:11,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-28 20:25:11,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-28 20:25:11,352 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-28 20:25:11,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-28 20:25:11,356 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 20:25:11,356 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 20:25:11,356 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 20:25:11,356 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 20:25:11,356 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-28 20:25:11,356 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:11,356 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 20:25:11,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 20:25:11,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2023-11-28 20:25:11,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 20:25:11,356 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 20:25:11,357 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-28 20:25:11,359 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-28 20:25:11,400 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 20:25:11,400 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-28 20:25:11,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:11,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:11,401 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:11,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-28 20:25:11,409 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-28 20:25:11,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:11,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 20:25:11,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:11,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:11,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:11,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 20:25:11,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 20:25:11,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 20:25:11,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-28 20:25:11,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:11,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:11,434 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:11,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-28 20:25:11,437 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-28 20:25:11,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 20:25:11,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 20:25:11,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 20:25:11,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 20:25:11,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 20:25:11,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 20:25:11,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 20:25:11,454 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-28 20:25:11,459 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-28 20:25:11,459 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-28 20:25:11,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 20:25:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:11,461 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 20:25:11,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-28 20:25:11,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-28 20:25:11,468 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-28 20:25:11,468 INFO L513 LassoAnalysis]: Proved termination. [2023-11-28 20:25:11,469 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-11-28 20:25:11,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-28 20:25:11,472 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-28 20:25:11,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:11,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:25:11,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:11,511 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:25:11,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:11,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-28 20:25:11,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-28 20:25:11,565 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-28 20:25:11,566 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-28 20:25:11,566 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-28 20:25:11,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 70 states and 94 transitions. Complement of second has 7 states. [2023-11-28 20:25:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-28 20:25:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-28 20:25:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2023-11-28 20:25:11,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2023-11-28 20:25:11,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 20:25:11,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2023-11-28 20:25:11,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 20:25:11,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2023-11-28 20:25:11,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 20:25:11,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2023-11-28 20:25:11,626 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2023-11-28 20:25:11,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 55 states and 74 transitions. [2023-11-28 20:25:11,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-11-28 20:25:11,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2023-11-28 20:25:11,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 74 transitions. [2023-11-28 20:25:11,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 20:25:11,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 74 transitions. [2023-11-28 20:25:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 74 transitions. [2023-11-28 20:25:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2023-11-28 20:25:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2023-11-28 20:25:11,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 59 transitions. [2023-11-28 20:25:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:11,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:25:11,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:25:11,634 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:11,690 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2023-11-28 20:25:11,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 104 transitions. [2023-11-28 20:25:11,692 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2023-11-28 20:25:11,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 104 transitions. [2023-11-28 20:25:11,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2023-11-28 20:25:11,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2023-11-28 20:25:11,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 104 transitions. [2023-11-28 20:25:11,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 20:25:11,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 104 transitions. [2023-11-28 20:25:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 104 transitions. [2023-11-28 20:25:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 44. [2023-11-28 20:25:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 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-28 20:25:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2023-11-28 20:25:11,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-11-28 20:25:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:25:11,701 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-11-28 20:25:11,701 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-28 20:25:11,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 58 transitions. [2023-11-28 20:25:11,702 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2023-11-28 20:25:11,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:11,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:11,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:25:11,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-28 20:25:11,703 INFO L748 eck$LassoCheckResult]: Stem: 626#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 595#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 596#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 624#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 625#L33-3 assume !(main_~x~0#1 < 100000); 591#L33-4 main_~x~0#1 := 0; 592#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 601#L40-3 [2023-11-28 20:25:11,703 INFO L750 eck$LassoCheckResult]: Loop: 601#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 602#L13 assume !(0 == __VERIFIER_assert_~cond#1); 587#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 588#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 601#L40-3 [2023-11-28 20:25:11,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2023-11-28 20:25:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791412221] [2023-11-28 20:25:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:11,768 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-28 20:25:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791412221] [2023-11-28 20:25:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791412221] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:25:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584249712] [2023-11-28 20:25:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:25:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:11,771 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:25:11,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-28 20:25:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:11,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:25:11,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:11,854 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-28 20:25:11,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:25:11,878 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-28 20:25:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584249712] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:25:11,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:25:11,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-28 20:25:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684027738] [2023-11-28 20:25:11,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:25:11,880 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:25:11,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1922577, now seen corresponding path program 1 times [2023-11-28 20:25:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:11,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711796162] [2023-11-28 20:25:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:11,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:11,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:11,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:11,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:25:11,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:25:11,989 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:12,152 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2023-11-28 20:25:12,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 253 transitions. [2023-11-28 20:25:12,155 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 132 [2023-11-28 20:25:12,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 253 transitions. [2023-11-28 20:25:12,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2023-11-28 20:25:12,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2023-11-28 20:25:12,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 253 transitions. [2023-11-28 20:25:12,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 20:25:12,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 197 states and 253 transitions. [2023-11-28 20:25:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 253 transitions. [2023-11-28 20:25:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 50. [2023-11-28 20:25:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 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-28 20:25:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-11-28 20:25:12,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-28 20:25:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:25:12,170 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-28 20:25:12,170 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-28 20:25:12,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2023-11-28 20:25:12,171 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2023-11-28 20:25:12,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:12,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:12,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2023-11-28 20:25:12,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-28 20:25:12,172 INFO L748 eck$LassoCheckResult]: Stem: 913#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 881#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 914#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 915#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 911#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 912#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 919#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 918#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 917#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 916#L33-3 assume !(main_~x~0#1 < 100000); 874#L33-4 main_~x~0#1 := 0; 875#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 888#L40-3 [2023-11-28 20:25:12,172 INFO L750 eck$LassoCheckResult]: Loop: 888#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 889#L13 assume !(0 == __VERIFIER_assert_~cond#1); 876#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 877#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 888#L40-3 [2023-11-28 20:25:12,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 82232677, now seen corresponding path program 2 times [2023-11-28 20:25:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:12,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381981491] [2023-11-28 20:25:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:12,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-28 20:25:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381981491] [2023-11-28 20:25:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381981491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:25:12,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:25:12,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:25:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384353380] [2023-11-28 20:25:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:25:12,259 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:25:12,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1922577, now seen corresponding path program 2 times [2023-11-28 20:25:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:12,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118674407] [2023-11-28 20:25:12,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:12,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:12,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:25:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:25:12,352 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-28 20:25:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:12,386 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2023-11-28 20:25:12,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2023-11-28 20:25:12,387 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-28 20:25:12,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 63 transitions. [2023-11-28 20:25:12,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-11-28 20:25:12,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-11-28 20:25:12,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2023-11-28 20:25:12,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:25:12,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-28 20:25:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2023-11-28 20:25:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-11-28 20:25:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 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-28 20:25:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2023-11-28 20:25:12,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2023-11-28 20:25:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:25:12,393 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2023-11-28 20:25:12,393 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-28 20:25:12,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2023-11-28 20:25:12,394 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-28 20:25:12,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:12,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:12,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2023-11-28 20:25:12,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 20:25:12,395 INFO L748 eck$LassoCheckResult]: Stem: 1015#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 985#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 986#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1012#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1013#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1016#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1022#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1021#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1020#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1018#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1017#L33-3 assume !(main_~x~0#1 < 100000); 983#L33-4 main_~x~0#1 := 0; 984#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1001#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1002#L47-3 [2023-11-28 20:25:12,395 INFO L750 eck$LassoCheckResult]: Loop: 1002#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 1003#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1002#L47-3 [2023-11-28 20:25:12,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754313, now seen corresponding path program 1 times [2023-11-28 20:25:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:12,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932819] [2023-11-28 20:25:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:12,492 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-28 20:25:12,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932819] [2023-11-28 20:25:12,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932819] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:25:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812840962] [2023-11-28 20:25:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:12,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:25:12,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:12,494 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:25:12,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-28 20:25:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:12,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:25:12,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:12,582 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-28 20:25:12,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:25:12,643 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-28 20:25:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812840962] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:25:12,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:25:12,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-28 20:25:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886411748] [2023-11-28 20:25:12,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:25:12,644 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:25:12,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2023-11-28 20:25:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695853823] [2023-11-28 20:25:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:12,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:12,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:12,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 20:25:12,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:25:12,702 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:13,009 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2023-11-28 20:25:13,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 374 transitions. [2023-11-28 20:25:13,012 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 234 [2023-11-28 20:25:13,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 292 states and 374 transitions. [2023-11-28 20:25:13,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2023-11-28 20:25:13,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2023-11-28 20:25:13,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 374 transitions. [2023-11-28 20:25:13,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:25:13,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 292 states and 374 transitions. [2023-11-28 20:25:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 374 transitions. [2023-11-28 20:25:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 62. [2023-11-28 20:25:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 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-28 20:25:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2023-11-28 20:25:13,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-11-28 20:25:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:25:13,029 INFO L428 stractBuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-11-28 20:25:13,030 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-28 20:25:13,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 74 transitions. [2023-11-28 20:25:13,031 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-28 20:25:13,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:13,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:13,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2023-11-28 20:25:13,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 20:25:13,032 INFO L748 eck$LassoCheckResult]: Stem: 1453#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 1421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1422#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1455#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1456#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1450#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1451#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1472#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1471#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1470#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1469#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1468#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1467#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1466#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1465#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1464#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1463#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1462#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1461#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1460#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1459#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1458#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1457#L33-3 assume !(main_~x~0#1 < 100000); 1419#L33-4 main_~x~0#1 := 0; 1420#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1437#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1438#L47-3 [2023-11-28 20:25:13,033 INFO L750 eck$LassoCheckResult]: Loop: 1438#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 1439#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1438#L47-3 [2023-11-28 20:25:13,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash -95702845, now seen corresponding path program 2 times [2023-11-28 20:25:13,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:13,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316887088] [2023-11-28 20:25:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:13,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:13,312 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-28 20:25:13,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:13,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316887088] [2023-11-28 20:25:13,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316887088] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:25:13,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940606246] [2023-11-28 20:25:13,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:25:13,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:25:13,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:13,315 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:25:13,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-28 20:25:13,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:25:13,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:25:13,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-28 20:25:13,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:13,481 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-28 20:25:13,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:25:13,732 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-28 20:25:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940606246] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:25:13,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:25:13,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-28 20:25:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891925874] [2023-11-28 20:25:13,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:25:13,733 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:25:13,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 2 times [2023-11-28 20:25:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:13,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300225991] [2023-11-28 20:25:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:13,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:13,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:13,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:13,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-28 20:25:13,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-28 20:25:13,795 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:14,448 INFO L93 Difference]: Finished difference Result 592 states and 758 transitions. [2023-11-28 20:25:14,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 592 states and 758 transitions. [2023-11-28 20:25:14,455 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 474 [2023-11-28 20:25:14,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 592 states to 592 states and 758 transitions. [2023-11-28 20:25:14,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2023-11-28 20:25:14,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2023-11-28 20:25:14,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 592 states and 758 transitions. [2023-11-28 20:25:14,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:25:14,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 592 states and 758 transitions. [2023-11-28 20:25:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states and 758 transitions. [2023-11-28 20:25:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 86. [2023-11-28 20:25:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2023-11-28 20:25:14,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 98 transitions. [2023-11-28 20:25:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-28 20:25:14,479 INFO L428 stractBuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2023-11-28 20:25:14,479 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-28 20:25:14,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 98 transitions. [2023-11-28 20:25:14,480 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-28 20:25:14,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:14,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:14,482 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1] [2023-11-28 20:25:14,482 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 20:25:14,483 INFO L748 eck$LassoCheckResult]: Stem: 2283#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 2255#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 2256#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2284#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2285#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2280#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2281#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2325#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2324#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2323#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2322#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2321#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2320#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2319#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2318#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2317#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2316#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2315#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2314#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2313#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2312#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2311#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2310#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2309#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2308#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2307#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2306#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2305#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2304#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2303#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2302#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2301#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2300#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2299#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2298#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2297#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2296#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2295#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2294#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2293#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2292#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2291#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2290#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2289#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2288#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2287#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2286#L33-3 assume !(main_~x~0#1 < 100000); 2251#L33-4 main_~x~0#1 := 0; 2252#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 2270#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2271#L47-3 [2023-11-28 20:25:14,483 INFO L750 eck$LassoCheckResult]: Loop: 2271#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 2272#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2271#L47-3 [2023-11-28 20:25:14,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:14,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970907, now seen corresponding path program 3 times [2023-11-28 20:25:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770547951] [2023-11-28 20:25:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:15,239 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-28 20:25:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770547951] [2023-11-28 20:25:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770547951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:25:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501903761] [2023-11-28 20:25:15,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:25:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:25:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:15,241 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:25:15,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-28 20:25:15,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2023-11-28 20:25:15,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:25:15,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-28 20:25:15,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:15,947 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-28 20:25:15,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:25:16,761 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-28 20:25:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501903761] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:25:16,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:25:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-28 20:25:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587056055] [2023-11-28 20:25:16,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:25:16,762 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:25:16,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 3 times [2023-11-28 20:25:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:16,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269998751] [2023-11-28 20:25:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:16,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:16,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:16,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-28 20:25:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-28 20:25:16,820 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:18,975 INFO L93 Difference]: Finished difference Result 1192 states and 1526 transitions. [2023-11-28 20:25:18,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1192 states and 1526 transitions. [2023-11-28 20:25:18,985 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 954 [2023-11-28 20:25:18,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1192 states to 1192 states and 1526 transitions. [2023-11-28 20:25:18,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1100 [2023-11-28 20:25:18,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1100 [2023-11-28 20:25:18,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1192 states and 1526 transitions. [2023-11-28 20:25:19,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:25:19,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1192 states and 1526 transitions. [2023-11-28 20:25:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states and 1526 transitions. [2023-11-28 20:25:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 134. [2023-11-28 20:25:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 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-28 20:25:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-11-28 20:25:19,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-11-28 20:25:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-28 20:25:19,017 INFO L428 stractBuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-11-28 20:25:19,017 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-28 20:25:19,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 146 transitions. [2023-11-28 20:25:19,018 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-28 20:25:19,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:19,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:19,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1] [2023-11-28 20:25:19,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 20:25:19,024 INFO L748 eck$LassoCheckResult]: Stem: 3909#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 3877#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 3878#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3911#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3912#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3906#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3907#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4000#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3999#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3998#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3997#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3996#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3995#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3994#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3993#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3992#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3991#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3990#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3989#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3988#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3987#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3986#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3985#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3984#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3983#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3982#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3981#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3980#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3979#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3978#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3977#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3976#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3975#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3974#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3973#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3972#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3971#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3970#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3969#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3968#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3967#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3966#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3965#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3964#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3963#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3962#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3961#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3960#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3959#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3958#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3957#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3956#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3955#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3954#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3953#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3952#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3951#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3950#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3949#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3948#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3947#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3946#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3945#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3944#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3943#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3942#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3941#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3940#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3939#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3938#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3937#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3936#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3935#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3934#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3933#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3932#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3931#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3930#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3929#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3928#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3927#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3926#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3925#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3924#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3923#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3922#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3921#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3920#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3919#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3918#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3917#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3916#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3915#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3914#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3913#L33-3 assume !(main_~x~0#1 < 100000); 3875#L33-4 main_~x~0#1 := 0; 3876#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 3893#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 3894#L47-3 [2023-11-28 20:25:19,024 INFO L750 eck$LassoCheckResult]: Loop: 3894#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 3895#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3894#L47-3 [2023-11-28 20:25:19,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:19,025 INFO L85 PathProgramCache]: Analyzing trace with hash -675114997, now seen corresponding path program 4 times [2023-11-28 20:25:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011881268] [2023-11-28 20:25:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:21,086 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-28 20:25:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011881268] [2023-11-28 20:25:21,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011881268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:25:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441498063] [2023-11-28 20:25:21,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:25:21,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:25:21,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:21,088 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:25:21,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-28 20:25:21,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:25:21,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:25:21,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-28 20:25:21,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:21,481 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-28 20:25:21,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:25:24,080 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-28 20:25:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441498063] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:25:24,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:25:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-11-28 20:25:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398628978] [2023-11-28 20:25:24,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:25:24,081 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:25:24,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 4 times [2023-11-28 20:25:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:24,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21604256] [2023-11-28 20:25:24,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:24,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:25:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:25:24,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:25:24,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-28 20:25:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-28 20:25:24,146 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. cyclomatic complexity: 17 Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:39,717 INFO L93 Difference]: Finished difference Result 2392 states and 3062 transitions. [2023-11-28 20:25:39,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2392 states and 3062 transitions. [2023-11-28 20:25:39,730 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 1914 [2023-11-28 20:25:39,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2392 states to 2392 states and 3062 transitions. [2023-11-28 20:25:39,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2204 [2023-11-28 20:25:39,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2204 [2023-11-28 20:25:39,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2392 states and 3062 transitions. [2023-11-28 20:25:39,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:25:39,747 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2392 states and 3062 transitions. [2023-11-28 20:25:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states and 3062 transitions. [2023-11-28 20:25:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 230. [2023-11-28 20:25:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 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-28 20:25:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 242 transitions. [2023-11-28 20:25:39,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 230 states and 242 transitions. [2023-11-28 20:25:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-28 20:25:39,767 INFO L428 stractBuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2023-11-28 20:25:39,767 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-28 20:25:39,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 242 transitions. [2023-11-28 20:25:39,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-28 20:25:39,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 20:25:39,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 20:25:39,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1] [2023-11-28 20:25:39,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 20:25:39,774 INFO L748 eck$LassoCheckResult]: Stem: 7117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 7085#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 7086#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7119#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7120#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7114#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7115#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7304#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7303#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7302#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7301#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7300#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7299#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7298#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7297#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7296#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7295#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7294#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7293#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7292#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7291#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7290#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7289#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7288#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7287#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7286#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7285#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7284#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7283#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7282#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7281#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7280#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7279#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7278#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7277#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7276#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7275#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7274#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7273#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7272#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7271#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7270#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7269#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7268#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7267#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7266#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7265#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7264#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7263#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7262#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7261#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7260#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7259#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7258#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7257#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7256#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7255#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7254#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7253#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7252#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7251#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7250#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7249#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7248#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7247#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7246#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7245#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7244#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7243#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7242#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7241#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7240#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7239#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7238#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7237#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7236#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7235#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7234#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7233#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7232#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7231#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7230#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7229#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7228#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7227#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7226#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7225#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7224#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7223#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7222#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7221#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7220#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7219#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7218#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7217#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7216#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7215#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7214#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7213#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7212#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7211#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7210#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7209#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7208#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7207#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7206#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7205#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7204#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7203#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7202#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7201#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7200#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7199#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7198#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7197#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7196#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7195#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7194#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7193#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7192#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7191#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7190#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7189#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7188#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7187#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7186#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7185#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7184#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7183#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7182#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7181#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7180#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7179#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7178#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7177#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7176#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7175#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7174#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7173#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7172#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7171#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7170#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7169#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7168#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7167#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7166#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7165#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7164#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7163#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7162#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7161#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7160#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7159#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7158#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7157#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7156#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7155#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7154#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7153#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7152#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7151#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7150#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7149#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7148#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7147#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7146#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7145#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7144#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7143#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7142#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7141#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7140#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7139#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7138#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7137#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7136#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7135#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7134#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7133#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7132#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7131#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7130#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7129#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7128#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7127#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7126#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7125#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7124#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7123#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7122#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7121#L33-3 assume !(main_~x~0#1 < 100000); 7083#L33-4 main_~x~0#1 := 0; 7084#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 7101#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 7102#L47-3 [2023-11-28 20:25:39,774 INFO L750 eck$LassoCheckResult]: Loop: 7102#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 7103#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7102#L47-3 [2023-11-28 20:25:39,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733589, now seen corresponding path program 5 times [2023-11-28 20:25:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:25:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551467101] [2023-11-28 20:25:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:25:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:25:45,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:45,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551467101] [2023-11-28 20:25:45,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551467101] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:25:45,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181285930] [2023-11-28 20:25:45,687 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:25:45,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:25:45,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:25:45,689 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:25:45,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_801ef61b-72c2-461f-b1bd-9359be66d8c4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-28 20:39:14,946 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) [2023-11-28 20:39:14,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:15,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-28 20:39:15,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:39:15,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:39:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181285930] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:39:23,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:39:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2023-11-28 20:39:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733654808] [2023-11-28 20:39:23,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:39:23,665 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 20:39:23,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 5 times [2023-11-28 20:39:23,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:23,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930712282] [2023-11-28 20:39:23,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:23,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:39:23,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:39:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:39:23,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:39:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2023-11-28 20:39:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2023-11-28 20:39:23,721 INFO L87 Difference]: Start difference. First operand 230 states and 242 transitions. cyclomatic complexity: 17 Second operand has 193 states, 193 states have (on average 2.005181347150259) internal successors, (387), 193 states have internal predecessors, (387), 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)