./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-acceleration/array_2-2.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for termination
Using default analysis
Version a0165632
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_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-acceleration/array_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 866342b97e5be917007cb97e07a0644c7c9d2aa9b428c32cf026d727d672a191
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:49:08,691 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:49:08,768 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf
[2024-11-08 17:49:08,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:49:08,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:49:08,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:49:08,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:49:08,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:49:08,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:49:08,811 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:49:08,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:49:08,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:49:08,813 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:49:08,814 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-08 17:49:08,816 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-08 17:49:08,817 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-08 17:49:08,817 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-08 17:49:08,817 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-08 17:49:08,817 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-08 17:49:08,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:49:08,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-08 17:49:08,823 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:49:08,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 17:49:08,823 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:49:08,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:49:08,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-08 17:49:08,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-08 17:49:08,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-08 17:49:08,824 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:49:08,824 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 17:49:08,825 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:49:08,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:49:08,825 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-08 17:49:08,825 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:49:08,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:49:08,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:49:08,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:49:08,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 17:49:08,829 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-08 17:49:08,829 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_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 866342b97e5be917007cb97e07a0644c7c9d2aa9b428c32cf026d727d672a191
[2024-11-08 17:49:09,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:49:09,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:49:09,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:49:09,178 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:49:09,178 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:49:09,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/loop-acceleration/array_2-2.i
Unable to find full path for "g++"
[2024-11-08 17:49:11,149 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:49:11,348 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:49:11,349 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/sv-benchmarks/c/loop-acceleration/array_2-2.i
[2024-11-08 17:49:11,360 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/data/d65b2c3d2/14556911724f47ebabb2a5e536e957ac/FLAG5389c0180
[2024-11-08 17:49:11,725 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/data/d65b2c3d2/14556911724f47ebabb2a5e536e957ac
[2024-11-08 17:49:11,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:49:11,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:49:11,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:49:11,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:49:11,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:49:11,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:49:11" (1/1) ...
[2024-11-08 17:49:11,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35313094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:11, skipping insertion in model container
[2024-11-08 17:49:11,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:49:11" (1/1) ...
[2024-11-08 17:49:11,773 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:49:12,119 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:49:12,132 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:49:12,157 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:49:12,186 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:49:12,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12 WrapperNode
[2024-11-08 17:49:12,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:49:12,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:49:12,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:49:12,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:49:12,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,226 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53
[2024-11-08 17:49:12,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:49:12,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:49:12,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:49:12,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:49:12,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,265 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2].
[2024-11-08 17:49:12,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:49:12,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:49:12,283 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:49:12,284 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:49:12,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (1/1) ...
[2024-11-08 17:49:12,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:12,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:12,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:12,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:49:12,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:49:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 17:49:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-08 17:49:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-11-08 17:49:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-08 17:49:12,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-08 17:49:12,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-08 17:49:12,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2
[2024-11-08 17:49:12,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:49:12,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:49:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-08 17:49:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-08 17:49:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2
[2024-11-08 17:49:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-08 17:49:12,435 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:49:12,438 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:49:12,589 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-08 17:49:12,589 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:49:12,610 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:49:12,614 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 17:49:12,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:49:12 BoogieIcfgContainer
[2024-11-08 17:49:12,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:49:12,618 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-08 17:49:12,618 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-08 17:49:12,629 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-08 17:49:12,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 17:49:12,635 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 05:49:11" (1/3) ...
[2024-11-08 17:49:12,636 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11ace416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 05:49:12, skipping insertion in model container
[2024-11-08 17:49:12,637 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 17:49:12,637 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:12" (2/3) ...
[2024-11-08 17:49:12,639 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11ace416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 05:49:12, skipping insertion in model container
[2024-11-08 17:49:12,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 17:49:12,643 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:49:12" (3/3) ...
[2024-11-08 17:49:12,644 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_2-2.i
[2024-11-08 17:49:12,749 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-08 17:49:12,749 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-08 17:49:12,749 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-08 17:49:12,750 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-08 17:49:12,750 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-08 17:49:12,750 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-08 17:49:12,750 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-08 17:49:12,750 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-08 17:49:12,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:12,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4
[2024-11-08 17:49:12,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:49:12,773 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:49:12,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 17:49:12,779 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:49:12,779 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-08 17:49:12,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:12,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4
[2024-11-08 17:49:12,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:49:12,781 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:49:12,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 17:49:12,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:49:12,792 INFO L745 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 6#L25-3true
[2024-11-08 17:49:12,793 INFO L747 eck$LassoCheckResult]: Loop: 6#L25-3true assume main_~i~0#1 < 2048; 7#L25-1true assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 6#L25-3true
[2024-11-08 17:49:12,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2024-11-08 17:49:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:12,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519479745]
[2024-11-08 17:49:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:12,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:49:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:12,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:49:12,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1158, now seen corresponding path program 1 times
[2024-11-08 17:49:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:12,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565885747]
[2024-11-08 17:49:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:12,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:49:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:12,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:49:12,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times
[2024-11-08 17:49:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:12,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949568348]
[2024-11-08 17:49:12,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:13,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:49:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:13,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:49:13,659 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:49:13,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:49:13,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:49:13,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:49:13,661 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:49:13,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:13,662 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:49:13,662 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:49:13,662 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_2-2.i_Iteration1_Lasso
[2024-11-08 17:49:13,662 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:49:13,663 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:49:13,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:13,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:13,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:13,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:13,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:13,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:14,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:14,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:14,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:14,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:14,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:49:14,442 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:49:14,447 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:49:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,472 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:49:14,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:49:14,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2024-11-08 17:49:14,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,530 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:49:14,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:49:14,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0
[2024-11-08 17:49:14,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,583 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:49:14,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:49:14,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:49:14,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2024-11-08 17:49:14,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,634 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:49:14,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:49:14,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:49:14,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-11-08 17:49:14,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,672 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,692 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:49:14,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:49:14,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:49:14,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2024-11-08 17:49:14,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,723 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,744 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:49:14,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:49:14,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:49:14,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2024-11-08 17:49:14,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,798 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:49:14,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:49:14,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2024-11-08 17:49:14,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,836 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,854 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:49:14,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:49:14,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0
[2024-11-08 17:49:14,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,888 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,908 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:49:14,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:49:14,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2024-11-08 17:49:14,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,940 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,959 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:49:14,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:14,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:49:14,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:49:14,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:49:14,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0
[2024-11-08 17:49:14,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:14,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:14,985 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:14,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process
[2024-11-08 17:49:14,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:49:14,999 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:49:14,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:49:14,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:49:14,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:49:15,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:49:15,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:49:15,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:49:15,036 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2024-11-08 17:49:15,036 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero.
[2024-11-08 17:49:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:49:15,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:15,048 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:49:15,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process
[2024-11-08 17:49:15,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:49:15,080 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-08 17:49:15,080 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:49:15,081 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 4095
Supporting invariants []
[2024-11-08 17:49:15,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0
[2024-11-08 17:49:15,139 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed
[2024-11-08 17:49:15,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:15,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 17:49:15,217 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:49:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:15,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:49:15,246 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:49:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:15,313 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 17:49:15,317 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:15,377 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 40 transitions. Complement of second has 6 states.
[2024-11-08 17:49:15,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 17:49:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions.
[2024-11-08 17:49:15,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 2 letters.
[2024-11-08 17:49:15,391 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:49:15,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters.
[2024-11-08 17:49:15,393 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:49:15,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 4 letters.
[2024-11-08 17:49:15,393 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:49:15,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions.
[2024-11-08 17:49:15,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:15,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 8 states and 10 transitions.
[2024-11-08 17:49:15,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5
[2024-11-08 17:49:15,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6
[2024-11-08 17:49:15,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions.
[2024-11-08 17:49:15,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 17:49:15,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions.
[2024-11-08 17:49:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions.
[2024-11-08 17:49:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8.
[2024-11-08 17:49:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions.
[2024-11-08 17:49:15,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions.
[2024-11-08 17:49:15,436 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions.
[2024-11-08 17:49:15,436 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-08 17:49:15,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions.
[2024-11-08 17:49:15,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:15,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:49:15,438 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:49:15,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2024-11-08 17:49:15,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:49:15,439 INFO L745 eck$LassoCheckResult]: Stem: 120#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 121#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 116#L25-3 assume !(main_~i~0#1 < 2048); 118#L25-4 main_~i~0#1 := 0; 114#L29-3
[2024-11-08 17:49:15,439 INFO L747 eck$LassoCheckResult]: Loop: 114#L29-3 assume main_~i~0#1 < 2048; 115#L29-1 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#2(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 114#L29-3
[2024-11-08 17:49:15,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash 925861, now seen corresponding path program 1 times
[2024-11-08 17:49:15,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:15,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223816907]
[2024-11-08 17:49:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:15,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:15,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:49:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223816907]
[2024-11-08 17:49:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223816907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:49:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:49:15,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:49:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757512969]
[2024-11-08 17:49:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:49:15,582 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:49:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 1 times
[2024-11-08 17:49:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457488031]
[2024-11-08 17:49:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:15,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:49:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:15,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:49:15,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0
[2024-11-08 17:49:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:49:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:49:15,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:49:15,783 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:49:15,804 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions.
[2024-11-08 17:49:15,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions.
[2024-11-08 17:49:15,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:15,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions.
[2024-11-08 17:49:15,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8
[2024-11-08 17:49:15,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8
[2024-11-08 17:49:15,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions.
[2024-11-08 17:49:15,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 17:49:15,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions.
[2024-11-08 17:49:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions.
[2024-11-08 17:49:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8.
[2024-11-08 17:49:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions.
[2024-11-08 17:49:15,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions.
[2024-11-08 17:49:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:49:15,809 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions.
[2024-11-08 17:49:15,809 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-08 17:49:15,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions.
[2024-11-08 17:49:15,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:15,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:49:15,810 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:49:15,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2024-11-08 17:49:15,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:49:15,811 INFO L745 eck$LassoCheckResult]: Stem: 145#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 141#L25-3 assume main_~i~0#1 < 2048; 142#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 143#L25-3 assume !(main_~i~0#1 < 2048); 144#L25-4 main_~i~0#1 := 0; 139#L29-3
[2024-11-08 17:49:15,811 INFO L747 eck$LassoCheckResult]: Loop: 139#L29-3 assume main_~i~0#1 < 2048; 140#L29-1 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#2(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 139#L29-3
[2024-11-08 17:49:15,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash 889540458, now seen corresponding path program 1 times
[2024-11-08 17:49:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96371402]
[2024-11-08 17:49:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:15,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:15,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:49:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96371402]
[2024-11-08 17:49:15,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96371402] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:49:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465240616]
[2024-11-08 17:49:15,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:15,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:49:15,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:15,916 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:49:15,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-11-08 17:49:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:15,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 17:49:15,990 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:49:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:16,012 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:49:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465240616] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:49:16,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:49:16,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2024-11-08 17:49:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218950686]
[2024-11-08 17:49:16,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:49:16,037 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:49:16,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 2 times
[2024-11-08 17:49:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:16,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465706877]
[2024-11-08 17:49:16,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:16,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:49:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:16,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:49:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:49:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 17:49:16,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-08 17:49:16,149 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:49:16,204 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions.
[2024-11-08 17:49:16,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions.
[2024-11-08 17:49:16,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:16,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions.
[2024-11-08 17:49:16,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13
[2024-11-08 17:49:16,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13
[2024-11-08 17:49:16,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions.
[2024-11-08 17:49:16,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 17:49:16,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions.
[2024-11-08 17:49:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions.
[2024-11-08 17:49:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14.
[2024-11-08 17:49:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions.
[2024-11-08 17:49:16,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions.
[2024-11-08 17:49:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 17:49:16,214 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions.
[2024-11-08 17:49:16,214 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-08 17:49:16,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions.
[2024-11-08 17:49:16,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:16,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:49:16,216 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:49:16,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1]
[2024-11-08 17:49:16,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:49:16,217 INFO L745 eck$LassoCheckResult]: Stem: 215#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 210#L25-3 assume main_~i~0#1 < 2048; 211#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 212#L25-3 assume main_~i~0#1 < 2048; 213#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 221#L25-3 assume main_~i~0#1 < 2048; 220#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 219#L25-3 assume main_~i~0#1 < 2048; 218#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 217#L25-3 assume !(main_~i~0#1 < 2048); 214#L25-4 main_~i~0#1 := 0; 208#L29-3
[2024-11-08 17:49:16,217 INFO L747 eck$LassoCheckResult]: Loop: 208#L29-3 assume main_~i~0#1 < 2048; 209#L29-1 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#2(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 208#L29-3
[2024-11-08 17:49:16,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash -251892679, now seen corresponding path program 2 times
[2024-11-08 17:49:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:16,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488907964]
[2024-11-08 17:49:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:16,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:49:16,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488907964]
[2024-11-08 17:49:16,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488907964] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:49:16,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793280107]
[2024-11-08 17:49:16,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:49:16,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:49:16,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:16,486 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:49:16,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-11-08 17:49:16,585 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 17:49:16,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:49:16,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:49:16,588 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:49:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:16,617 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:49:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:16,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793280107] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:49:16,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:49:16,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13
[2024-11-08 17:49:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615499202]
[2024-11-08 17:49:16,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:49:16,699 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:49:16,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 3 times
[2024-11-08 17:49:16,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:16,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86794375]
[2024-11-08 17:49:16,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:16,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:49:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:16,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:49:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:49:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-08 17:49:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2024-11-08 17:49:16,802 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:49:16,913 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions.
[2024-11-08 17:49:16,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions.
[2024-11-08 17:49:16,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:16,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions.
[2024-11-08 17:49:16,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25
[2024-11-08 17:49:16,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25
[2024-11-08 17:49:16,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions.
[2024-11-08 17:49:16,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 17:49:16,916 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 46 transitions.
[2024-11-08 17:49:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions.
[2024-11-08 17:49:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26.
[2024-11-08 17:49:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions.
[2024-11-08 17:49:16,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions.
[2024-11-08 17:49:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-08 17:49:16,919 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions.
[2024-11-08 17:49:16,919 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-08 17:49:16,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions.
[2024-11-08 17:49:16,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:16,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:49:16,920 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:49:16,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1]
[2024-11-08 17:49:16,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:49:16,921 INFO L745 eck$LassoCheckResult]: Stem: 356#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 351#L25-3 assume main_~i~0#1 < 2048; 352#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 353#L25-3 assume main_~i~0#1 < 2048; 354#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 374#L25-3 assume main_~i~0#1 < 2048; 373#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 372#L25-3 assume main_~i~0#1 < 2048; 371#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 370#L25-3 assume main_~i~0#1 < 2048; 369#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 368#L25-3 assume main_~i~0#1 < 2048; 367#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 366#L25-3 assume main_~i~0#1 < 2048; 365#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 364#L25-3 assume main_~i~0#1 < 2048; 363#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 362#L25-3 assume main_~i~0#1 < 2048; 361#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 360#L25-3 assume main_~i~0#1 < 2048; 359#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 358#L25-3 assume !(main_~i~0#1 < 2048); 355#L25-4 main_~i~0#1 := 0; 349#L29-3
[2024-11-08 17:49:16,921 INFO L747 eck$LassoCheckResult]: Loop: 349#L29-3 assume main_~i~0#1 < 2048; 350#L29-1 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#2(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 349#L29-3
[2024-11-08 17:49:16,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:16,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1048039447, now seen corresponding path program 3 times
[2024-11-08 17:49:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340949527]
[2024-11-08 17:49:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:17,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:49:17,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340949527]
[2024-11-08 17:49:17,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340949527] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:49:17,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165078515]
[2024-11-08 17:49:17,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 17:49:17,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:49:17,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:17,345 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:49:17,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-11-08 17:49:17,966 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2024-11-08 17:49:17,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:49:17,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 17:49:17,972 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:49:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:18,040 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:49:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165078515] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:49:18,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:49:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25
[2024-11-08 17:49:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175015289]
[2024-11-08 17:49:18,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:49:18,380 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:49:18,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 4 times
[2024-11-08 17:49:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750054586]
[2024-11-08 17:49:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:18,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:49:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:18,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:49:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:49:18,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-11-08 17:49:18,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600
[2024-11-08 17:49:18,487 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:49:18,751 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions.
[2024-11-08 17:49:18,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 94 transitions.
[2024-11-08 17:49:18,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:18,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 94 transitions.
[2024-11-08 17:49:18,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49
[2024-11-08 17:49:18,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49
[2024-11-08 17:49:18,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 94 transitions.
[2024-11-08 17:49:18,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 17:49:18,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 94 transitions.
[2024-11-08 17:49:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 94 transitions.
[2024-11-08 17:49:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 50.
[2024-11-08 17:49:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions.
[2024-11-08 17:49:18,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions.
[2024-11-08 17:49:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2024-11-08 17:49:18,764 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions.
[2024-11-08 17:49:18,764 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-08 17:49:18,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions.
[2024-11-08 17:49:18,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:18,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:49:18,766 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:49:18,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1]
[2024-11-08 17:49:18,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:49:18,767 INFO L745 eck$LassoCheckResult]: Stem: 641#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 636#L25-3 assume main_~i~0#1 < 2048; 637#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 638#L25-3 assume main_~i~0#1 < 2048; 639#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 643#L25-3 assume main_~i~0#1 < 2048; 683#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 682#L25-3 assume main_~i~0#1 < 2048; 681#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 680#L25-3 assume main_~i~0#1 < 2048; 679#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 678#L25-3 assume main_~i~0#1 < 2048; 677#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 676#L25-3 assume main_~i~0#1 < 2048; 675#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 674#L25-3 assume main_~i~0#1 < 2048; 673#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 672#L25-3 assume main_~i~0#1 < 2048; 671#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 670#L25-3 assume main_~i~0#1 < 2048; 669#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 668#L25-3 assume main_~i~0#1 < 2048; 667#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 666#L25-3 assume main_~i~0#1 < 2048; 665#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 664#L25-3 assume main_~i~0#1 < 2048; 663#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 662#L25-3 assume main_~i~0#1 < 2048; 661#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 660#L25-3 assume main_~i~0#1 < 2048; 659#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 658#L25-3 assume main_~i~0#1 < 2048; 657#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 656#L25-3 assume main_~i~0#1 < 2048; 655#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 654#L25-3 assume main_~i~0#1 < 2048; 653#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 652#L25-3 assume main_~i~0#1 < 2048; 651#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 650#L25-3 assume main_~i~0#1 < 2048; 649#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 648#L25-3 assume main_~i~0#1 < 2048; 647#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 646#L25-3 assume main_~i~0#1 < 2048; 645#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 644#L25-3 assume !(main_~i~0#1 < 2048); 640#L25-4 main_~i~0#1 := 0; 634#L29-3
[2024-11-08 17:49:18,767 INFO L747 eck$LassoCheckResult]: Loop: 634#L29-3 assume main_~i~0#1 < 2048; 635#L29-1 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#2(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 634#L29-3
[2024-11-08 17:49:18,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1220247763, now seen corresponding path program 4 times
[2024-11-08 17:49:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761809749]
[2024-11-08 17:49:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:19,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:49:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761809749]
[2024-11-08 17:49:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761809749] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:49:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112593567]
[2024-11-08 17:49:19,721 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 17:49:19,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:49:19,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:19,724 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:49:19,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2024-11-08 17:49:19,904 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 17:49:19,904 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:49:19,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 24 conjuncts are in the unsatisfiable core
[2024-11-08 17:49:19,910 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:49:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:20,009 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:49:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112593567] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:49:21,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:49:21,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49
[2024-11-08 17:49:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794018252]
[2024-11-08 17:49:21,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:49:21,030 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:49:21,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 5 times
[2024-11-08 17:49:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446018212]
[2024-11-08 17:49:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:21,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:49:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:49:21,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:49:21,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:49:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2024-11-08 17:49:21,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352
[2024-11-08 17:49:21,136 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:49:21,783 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions.
[2024-11-08 17:49:21,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 190 transitions.
[2024-11-08 17:49:21,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:21,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 190 transitions.
[2024-11-08 17:49:21,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97
[2024-11-08 17:49:21,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97
[2024-11-08 17:49:21,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 190 transitions.
[2024-11-08 17:49:21,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 17:49:21,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 189 states and 190 transitions.
[2024-11-08 17:49:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 190 transitions.
[2024-11-08 17:49:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98.
[2024-11-08 17:49:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:49:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions.
[2024-11-08 17:49:21,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions.
[2024-11-08 17:49:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2024-11-08 17:49:21,798 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions.
[2024-11-08 17:49:21,798 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-08 17:49:21,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions.
[2024-11-08 17:49:21,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-08 17:49:21,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:49:21,800 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:49:21,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1]
[2024-11-08 17:49:21,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:49:21,803 INFO L745 eck$LassoCheckResult]: Stem: 1214#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 1215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 1209#L25-3 assume main_~i~0#1 < 2048; 1210#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1211#L25-3 assume main_~i~0#1 < 2048; 1212#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1304#L25-3 assume main_~i~0#1 < 2048; 1303#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1302#L25-3 assume main_~i~0#1 < 2048; 1301#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1300#L25-3 assume main_~i~0#1 < 2048; 1299#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1298#L25-3 assume main_~i~0#1 < 2048; 1297#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1296#L25-3 assume main_~i~0#1 < 2048; 1295#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1294#L25-3 assume main_~i~0#1 < 2048; 1293#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1292#L25-3 assume main_~i~0#1 < 2048; 1291#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1290#L25-3 assume main_~i~0#1 < 2048; 1289#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1288#L25-3 assume main_~i~0#1 < 2048; 1287#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1286#L25-3 assume main_~i~0#1 < 2048; 1285#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1284#L25-3 assume main_~i~0#1 < 2048; 1283#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1282#L25-3 assume main_~i~0#1 < 2048; 1281#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1280#L25-3 assume main_~i~0#1 < 2048; 1279#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1278#L25-3 assume main_~i~0#1 < 2048; 1277#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1276#L25-3 assume main_~i~0#1 < 2048; 1275#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1274#L25-3 assume main_~i~0#1 < 2048; 1273#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1272#L25-3 assume main_~i~0#1 < 2048; 1271#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1270#L25-3 assume main_~i~0#1 < 2048; 1269#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1268#L25-3 assume main_~i~0#1 < 2048; 1267#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1266#L25-3 assume main_~i~0#1 < 2048; 1265#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1264#L25-3 assume main_~i~0#1 < 2048; 1263#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1262#L25-3 assume main_~i~0#1 < 2048; 1261#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1260#L25-3 assume main_~i~0#1 < 2048; 1259#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1258#L25-3 assume main_~i~0#1 < 2048; 1257#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1256#L25-3 assume main_~i~0#1 < 2048; 1255#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1254#L25-3 assume main_~i~0#1 < 2048; 1253#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1252#L25-3 assume main_~i~0#1 < 2048; 1251#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1250#L25-3 assume main_~i~0#1 < 2048; 1249#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1248#L25-3 assume main_~i~0#1 < 2048; 1247#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1246#L25-3 assume main_~i~0#1 < 2048; 1245#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1244#L25-3 assume main_~i~0#1 < 2048; 1243#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1242#L25-3 assume main_~i~0#1 < 2048; 1241#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1240#L25-3 assume main_~i~0#1 < 2048; 1239#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1238#L25-3 assume main_~i~0#1 < 2048; 1237#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1236#L25-3 assume main_~i~0#1 < 2048; 1235#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1234#L25-3 assume main_~i~0#1 < 2048; 1233#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1232#L25-3 assume main_~i~0#1 < 2048; 1231#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1230#L25-3 assume main_~i~0#1 < 2048; 1229#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1228#L25-3 assume main_~i~0#1 < 2048; 1227#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1226#L25-3 assume main_~i~0#1 < 2048; 1225#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1224#L25-3 assume main_~i~0#1 < 2048; 1223#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1222#L25-3 assume main_~i~0#1 < 2048; 1221#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1220#L25-3 assume main_~i~0#1 < 2048; 1219#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1218#L25-3 assume main_~i~0#1 < 2048; 1217#L25-1 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#2(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1216#L25-3 assume !(main_~i~0#1 < 2048); 1213#L25-4 main_~i~0#1 := 0; 1207#L29-3
[2024-11-08 17:49:21,803 INFO L747 eck$LassoCheckResult]: Loop: 1207#L29-3 assume main_~i~0#1 < 2048; 1208#L29-1 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#2(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1207#L29-3
[2024-11-08 17:49:21,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:49:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1570276939, now seen corresponding path program 5 times
[2024-11-08 17:49:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:49:21,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473923341]
[2024-11-08 17:49:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:49:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:49:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:49:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:49:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473923341]
[2024-11-08 17:49:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473923341] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:49:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824061411]
[2024-11-08 17:49:25,003 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 17:49:25,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:49:25,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:49:25,005 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:49:25,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e52ba502-a3db-4687-92f3-6902f2cf279c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process