./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 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-acceleration/array_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu --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.3-dev-9bd2c7f
[2023-11-19 08:03:18,132 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 08:03:18,239 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf
[2023-11-19 08:03:18,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 08:03:18,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 08:03:18,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 08:03:18,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 08:03:18,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 08:03:18,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 08:03:18,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 08:03:18,277 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 08:03:18,278 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2023-11-19 08:03:18,278 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2023-11-19 08:03:18,279 INFO L153 SettingsManager]: * Use old map elimination=false
[2023-11-19 08:03:18,280 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2023-11-19 08:03:18,280 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2023-11-19 08:03:18,281 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2023-11-19 08:03:18,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 08:03:18,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2023-11-19 08:03:18,282 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 08:03:18,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 08:03:18,284 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 08:03:18,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 08:03:18,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2023-11-19 08:03:18,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2023-11-19 08:03:18,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2023-11-19 08:03:18,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-19 08:03:18,286 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 08:03:18,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 08:03:18,287 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2023-11-19 08:03:18,288 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 08:03:18,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 08:03:18,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 08:03:18,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 08:03:18,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 08:03:18,291 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2023-11-19 08:03:18,291 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_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/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_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu
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
[2023-11-19 08:03:18,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 08:03:18,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 08:03:18,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 08:03:18,668 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 08:03:18,671 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 08:03:18,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/loop-acceleration/array_2-2.i
[2023-11-19 08:03:21,969 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 08:03:22,221 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 08:03:22,222 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/sv-benchmarks/c/loop-acceleration/array_2-2.i
[2023-11-19 08:03:22,231 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/data/41fffceb2/5b06f1ba09a7480cb38c4b3426a9af26/FLAG141786669
[2023-11-19 08:03:22,246 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/data/41fffceb2/5b06f1ba09a7480cb38c4b3426a9af26
[2023-11-19 08:03:22,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 08:03:22,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 08:03:22,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 08:03:22,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 08:03:22,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 08:03:22,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727f495a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22, skipping insertion in model container
[2023-11-19 08:03:22,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,294 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 08:03:22,462 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 08:03:22,475 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 08:03:22,493 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 08:03:22,509 INFO L206 MainTranslator]: Completed translation
[2023-11-19 08:03:22,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22 WrapperNode
[2023-11-19 08:03:22,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 08:03:22,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 08:03:22,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 08:03:22,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 08:03:22,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,564 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56
[2023-11-19 08:03:22,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 08:03:22,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 08:03:22,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 08:03:22,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 08:03:22,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 08:03:22,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 08:03:22,594 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 08:03:22,594 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 08:03:22,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (1/1) ...
[2023-11-19 08:03:22,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:22,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:22,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:22,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2023-11-19 08:03:22,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 08:03:22,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 08:03:22,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 08:03:22,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 08:03:22,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 08:03:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 08:03:22,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2023-11-19 08:03:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 08:03:22,744 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 08:03:22,747 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 08:03:22,932 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 08:03:22,941 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 08:03:22,941 INFO L302 CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-19 08:03:22,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:22 BoogieIcfgContainer
[2023-11-19 08:03:22,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 08:03:22,946 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2023-11-19 08:03:22,946 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2023-11-19 08:03:22,950 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2023-11-19 08:03:22,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-11-19 08:03:22,951 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 08:03:22" (1/3) ...
[2023-11-19 08:03:22,952 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b029fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:03:22, skipping insertion in model container
[2023-11-19 08:03:22,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-11-19 08:03:22,953 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:22" (2/3) ...
[2023-11-19 08:03:22,953 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b029fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:03:22, skipping insertion in model container
[2023-11-19 08:03:22,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-11-19 08:03:22,953 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:22" (3/3) ...
[2023-11-19 08:03:22,955 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_2-2.i
[2023-11-19 08:03:23,014 INFO L303 stractBuchiCegarLoop]: Interprodecural is true
[2023-11-19 08:03:23,014 INFO L304 stractBuchiCegarLoop]: Hoare is false
[2023-11-19 08:03:23,014 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2023-11-19 08:03:23,014 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2023-11-19 08:03:23,014 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2023-11-19 08:03:23,015 INFO L308 stractBuchiCegarLoop]: Difference is false
[2023-11-19 08:03:23,015 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2023-11-19 08:03:23,015 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2023-11-19 08:03:23,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:23,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4
[2023-11-19 08:03:23,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-19 08:03:23,056 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-11-19 08:03:23,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2023-11-19 08:03:23,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2023-11-19 08:03:23,061 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2023-11-19 08:03:23,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:23,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4
[2023-11-19 08:03:23,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-19 08:03:23,063 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-11-19 08:03:23,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2023-11-19 08:03:23,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2023-11-19 08:03:23,082 INFO L748 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 6#L25-3true
[2023-11-19 08:03:23,083 INFO L750 eck$LassoCheckResult]: Loop: 6#L25-3true assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10#L25-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6#L25-3true
[2023-11-19 08:03:23,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2023-11-19 08:03:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:23,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371584206]
[2023-11-19 08:03:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:23,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:23,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:23,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:23,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times
[2023-11-19 08:03:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:23,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55702432]
[2023-11-19 08:03:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:23,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:23,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:23,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:23,396 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times
[2023-11-19 08:03:23,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:23,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048824332]
[2023-11-19 08:03:23,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:23,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:23,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:23,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:24,139 INFO L210 LassoAnalysis]: Preferences:
[2023-11-19 08:03:24,140 INFO L126 ssoRankerPreferences]: Compute integeral hull: false
[2023-11-19 08:03:24,140 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-11-19 08:03:24,140 INFO L128 ssoRankerPreferences]: Term annotations enabled: false
[2023-11-19 08:03:24,141 INFO L129 ssoRankerPreferences]: Use exernal solver: false
[2023-11-19 08:03:24,141 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:24,141 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false
[2023-11-19 08:03:24,141 INFO L132 ssoRankerPreferences]: Path of dumped script:
[2023-11-19 08:03:24,141 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_2-2.i_Iteration1_Lasso
[2023-11-19 08:03:24,141 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank
[2023-11-19 08:03:24,142 INFO L276 LassoAnalysis]: Starting lasso preprocessing...
[2023-11-19 08:03:24,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-11-19 08:03:24,875 INFO L294 LassoAnalysis]: Preprocessing complete.
[2023-11-19 08:03:24,880 INFO L490 LassoAnalysis]: Using template 'affine'.
[2023-11-19 08:03:24,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:24,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:24,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2023-11-19 08:03:24,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-11-19 08:03:24,920 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-11-19 08:03:24,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2023-11-19 08:03:24,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-11-19 08:03:24,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-11-19 08:03:24,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-11-19 08:03:24,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2023-11-19 08:03:24,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2023-11-19 08:03:24,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-11-19 08:03:24,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2023-11-19 08:03:24,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:24,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:24,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:24,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2023-11-19 08:03:24,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-11-19 08:03:24,996 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-11-19 08:03:24,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2023-11-19 08:03:24,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-11-19 08:03:24,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-11-19 08:03:24,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-11-19 08:03:24,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2023-11-19 08:03:24,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2023-11-19 08:03:25,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-11-19 08:03:25,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0
[2023-11-19 08:03:25,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:25,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:25,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-11-19 08:03:25,065 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-11-19 08:03:25,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2023-11-19 08:03:25,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-11-19 08:03:25,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-11-19 08:03:25,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-11-19 08:03:25,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2023-11-19 08:03:25,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2023-11-19 08:03:25,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2023-11-19 08:03:25,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-11-19 08:03:25,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2023-11-19 08:03:25,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:25,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:25,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:25,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2023-11-19 08:03:25,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-11-19 08:03:25,127 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-11-19 08:03:25,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2023-11-19 08:03:25,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-11-19 08:03:25,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-11-19 08:03:25,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-11-19 08:03:25,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2023-11-19 08:03:25,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2023-11-19 08:03:25,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-11-19 08:03:25,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0
[2023-11-19 08:03:25,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:25,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:25,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:25,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-11-19 08:03:25,189 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-11-19 08:03:25,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-11-19 08:03:25,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-11-19 08:03:25,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-11-19 08:03:25,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-11-19 08:03:25,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-11-19 08:03:25,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2023-11-19 08:03:25,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-11-19 08:03:25,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2023-11-19 08:03:25,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:25,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:25,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:25,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-11-19 08:03:25,269 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-11-19 08:03:25,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-11-19 08:03:25,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-11-19 08:03:25,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-11-19 08:03:25,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-11-19 08:03:25,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-11-19 08:03:25,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2023-11-19 08:03:25,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-11-19 08:03:25,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0
[2023-11-19 08:03:25,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:25,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:25,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:25,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2023-11-19 08:03:25,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-11-19 08:03:25,341 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-11-19 08:03:25,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-11-19 08:03:25,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-11-19 08:03:25,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-11-19 08:03:25,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-11-19 08:03:25,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-11-19 08:03:25,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2023-11-19 08:03:25,425 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver.
[2023-11-19 08:03:25,425 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero.
[2023-11-19 08:03:25,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-19 08:03:25,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:25,476 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-19 08:03:25,488 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2023-11-19 08:03:25,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2023-11-19 08:03:25,507 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2023-11-19 08:03:25,508 INFO L513 LassoAnalysis]: Proved termination.
[2023-11-19 08:03:25,508 INFO L515 LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select #length ULTIMATE.start_main_~#B~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 4095*v_rep(select #length ULTIMATE.start_main_~#B~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1
Supporting invariants []
[2023-11-19 08:03:25,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0
[2023-11-19 08:03:25,580 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed
[2023-11-19 08:03:25,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#B~0!base] could not be translated
[2023-11-19 08:03:25,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:25,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-11-19 08:03:25,625 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 08:03:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:25,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-11-19 08:03:25,644 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 08:03:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:25,708 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2023-11-19 08:03:25,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:25,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 43 transitions. Complement of second has 8 states.
[2023-11-19 08:03:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2023-11-19 08:03:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions.
[2023-11-19 08:03:25,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters.
[2023-11-19 08:03:25,775 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2023-11-19 08:03:25,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 2 letters.
[2023-11-19 08:03:25,776 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2023-11-19 08:03:25,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 4 letters.
[2023-11-19 08:03:25,776 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2023-11-19 08:03:25,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions.
[2023-11-19 08:03:25,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:25,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 8 states and 10 transitions.
[2023-11-19 08:03:25,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5
[2023-11-19 08:03:25,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6
[2023-11-19 08:03:25,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions.
[2023-11-19 08:03:25,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:25,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions.
[2023-11-19 08:03:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions.
[2023-11-19 08:03:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8.
[2023-11-19 08:03:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions.
[2023-11-19 08:03:25,810 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions.
[2023-11-19 08:03:25,810 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions.
[2023-11-19 08:03:25,810 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2023-11-19 08:03:25,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions.
[2023-11-19 08:03:25,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:25,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-19 08:03:25,811 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-11-19 08:03:25,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2023-11-19 08:03:25,812 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2023-11-19 08:03:25,812 INFO L748 eck$LassoCheckResult]: Stem: 136#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 135#L25-3 assume !(main_~i~0#1 < 2048); 134#L25-4 main_~i~0#1 := 0; 132#L29-3
[2023-11-19 08:03:25,812 INFO L750 eck$LassoCheckResult]: Loop: 132#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 133#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 132#L29-3
[2023-11-19 08:03:25,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times
[2023-11-19 08:03:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:25,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875434006]
[2023-11-19 08:03:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:25,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:25,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875434006]
[2023-11-19 08:03:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875434006] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:03:25,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:03:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 08:03:25,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082014450]
[2023-11-19 08:03:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:03:25,884 INFO L753 eck$LassoCheckResult]: stem already infeasible
[2023-11-19 08:03:25,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:25,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times
[2023-11-19 08:03:25,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:25,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718432878]
[2023-11-19 08:03:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:25,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:25,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:25,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 08:03:26,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 08:03:26,032 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 08:03:26,055 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions.
[2023-11-19 08:03:26,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions.
[2023-11-19 08:03:26,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:26,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions.
[2023-11-19 08:03:26,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8
[2023-11-19 08:03:26,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8
[2023-11-19 08:03:26,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions.
[2023-11-19 08:03:26,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:26,061 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions.
[2023-11-19 08:03:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions.
[2023-11-19 08:03:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8.
[2023-11-19 08:03:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions.
[2023-11-19 08:03:26,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions.
[2023-11-19 08:03:26,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 08:03:26,069 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions.
[2023-11-19 08:03:26,069 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2023-11-19 08:03:26,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions.
[2023-11-19 08:03:26,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:26,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-19 08:03:26,070 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-11-19 08:03:26,070 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2023-11-19 08:03:26,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2023-11-19 08:03:26,071 INFO L748 eck$LassoCheckResult]: Stem: 161#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 159#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 155#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 156#L25-3 assume !(main_~i~0#1 < 2048); 160#L25-4 main_~i~0#1 := 0; 157#L29-3
[2023-11-19 08:03:26,071 INFO L750 eck$LassoCheckResult]: Loop: 157#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 158#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 157#L29-3
[2023-11-19 08:03:26,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times
[2023-11-19 08:03:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586862410]
[2023-11-19 08:03:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586862410]
[2023-11-19 08:03:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586862410] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 08:03:26,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334954323]
[2023-11-19 08:03:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:26,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 08:03:26,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:26,136 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 08:03:26,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-19 08:03:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:26,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-11-19 08:03:26,194 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 08:03:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:26,207 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 08:03:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:26,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334954323] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 08:03:26,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 08:03:26,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2023-11-19 08:03:26,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489041693]
[2023-11-19 08:03:26,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 08:03:26,227 INFO L753 eck$LassoCheckResult]: stem already infeasible
[2023-11-19 08:03:26,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times
[2023-11-19 08:03:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:26,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898602999]
[2023-11-19 08:03:26,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:26,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:26,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:26,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 08:03:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2023-11-19 08:03:26,332 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 08:03:26,387 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions.
[2023-11-19 08:03:26,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions.
[2023-11-19 08:03:26,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:26,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions.
[2023-11-19 08:03:26,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13
[2023-11-19 08:03:26,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13
[2023-11-19 08:03:26,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions.
[2023-11-19 08:03:26,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:26,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions.
[2023-11-19 08:03:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions.
[2023-11-19 08:03:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14.
[2023-11-19 08:03:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions.
[2023-11-19 08:03:26,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions.
[2023-11-19 08:03:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 08:03:26,394 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions.
[2023-11-19 08:03:26,395 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============
[2023-11-19 08:03:26,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions.
[2023-11-19 08:03:26,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:26,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-19 08:03:26,396 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-11-19 08:03:26,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1]
[2023-11-19 08:03:26,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2023-11-19 08:03:26,397 INFO L748 eck$LassoCheckResult]: Stem: 232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 228#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 229#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 230#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 224#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 225#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 237#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 236#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 235#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 234#L25-3 assume !(main_~i~0#1 < 2048); 231#L25-4 main_~i~0#1 := 0; 226#L29-3
[2023-11-19 08:03:26,397 INFO L750 eck$LassoCheckResult]: Loop: 226#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 227#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 226#L29-3
[2023-11-19 08:03:26,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times
[2023-11-19 08:03:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:26,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208253041]
[2023-11-19 08:03:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:26,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:26,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208253041]
[2023-11-19 08:03:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208253041] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 08:03:26,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327793784]
[2023-11-19 08:03:26,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-19 08:03:26,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 08:03:26,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:26,614 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 08:03:26,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-11-19 08:03:26,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-19 08:03:26,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 08:03:26,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-11-19 08:03:26,705 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 08:03:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:26,737 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 08:03:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:26,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327793784] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 08:03:26,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 08:03:26,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13
[2023-11-19 08:03:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187129222]
[2023-11-19 08:03:26,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 08:03:26,814 INFO L753 eck$LassoCheckResult]: stem already infeasible
[2023-11-19 08:03:26,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times
[2023-11-19 08:03:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724795124]
[2023-11-19 08:03:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:26,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:26,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:26,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0
[2023-11-19 08:03:26,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:26,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2023-11-19 08:03:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2023-11-19 08:03:26,979 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 08:03:27,120 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions.
[2023-11-19 08:03:27,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions.
[2023-11-19 08:03:27,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:27,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions.
[2023-11-19 08:03:27,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25
[2023-11-19 08:03:27,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25
[2023-11-19 08:03:27,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions.
[2023-11-19 08:03:27,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:27,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 46 transitions.
[2023-11-19 08:03:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions.
[2023-11-19 08:03:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26.
[2023-11-19 08:03:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions.
[2023-11-19 08:03:27,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions.
[2023-11-19 08:03:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2023-11-19 08:03:27,139 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions.
[2023-11-19 08:03:27,139 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============
[2023-11-19 08:03:27,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions.
[2023-11-19 08:03:27,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:27,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-19 08:03:27,140 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-11-19 08:03:27,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1]
[2023-11-19 08:03:27,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2023-11-19 08:03:27,142 INFO L748 eck$LassoCheckResult]: Stem: 373#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 374#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 369#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 370#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 371#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 365#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 366#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 390#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 389#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 388#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 387#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 386#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 385#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 384#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 383#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 382#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 381#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 380#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 379#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 378#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 377#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 376#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 375#L25-3 assume !(main_~i~0#1 < 2048); 372#L25-4 main_~i~0#1 := 0; 367#L29-3
[2023-11-19 08:03:27,142 INFO L750 eck$LassoCheckResult]: Loop: 367#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 368#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 367#L29-3
[2023-11-19 08:03:27,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times
[2023-11-19 08:03:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488066038]
[2023-11-19 08:03:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488066038]
[2023-11-19 08:03:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488066038] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 08:03:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297011040]
[2023-11-19 08:03:27,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-19 08:03:27,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 08:03:27,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:27,466 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 08:03:27,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-11-19 08:03:29,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2023-11-19 08:03:29,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 08:03:29,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core
[2023-11-19 08:03:29,014 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 08:03:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:29,074 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 08:03:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297011040] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 08:03:29,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 08:03:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25
[2023-11-19 08:03:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842897028]
[2023-11-19 08:03:29,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 08:03:29,356 INFO L753 eck$LassoCheckResult]: stem already infeasible
[2023-11-19 08:03:29,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times
[2023-11-19 08:03:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995364894]
[2023-11-19 08:03:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:29,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:29,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-11-19 08:03:29,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600
[2023-11-19 08:03:29,473 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 08:03:29,748 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions.
[2023-11-19 08:03:29,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 94 transitions.
[2023-11-19 08:03:29,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:29,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 94 transitions.
[2023-11-19 08:03:29,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49
[2023-11-19 08:03:29,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49
[2023-11-19 08:03:29,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 94 transitions.
[2023-11-19 08:03:29,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:29,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 94 transitions.
[2023-11-19 08:03:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 94 transitions.
[2023-11-19 08:03:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 50.
[2023-11-19 08:03:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions.
[2023-11-19 08:03:29,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions.
[2023-11-19 08:03:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2023-11-19 08:03:29,776 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions.
[2023-11-19 08:03:29,776 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============
[2023-11-19 08:03:29,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions.
[2023-11-19 08:03:29,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:29,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-19 08:03:29,778 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-11-19 08:03:29,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1]
[2023-11-19 08:03:29,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2023-11-19 08:03:29,781 INFO L748 eck$LassoCheckResult]: Stem: 658#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 659#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 654#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 655#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 656#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 650#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 651#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 699#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 698#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 697#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 696#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 695#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 694#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 693#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 692#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 691#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 690#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 689#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 688#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 687#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 686#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 685#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 684#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 683#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 682#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 681#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 680#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 679#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 678#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 677#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 676#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 675#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 674#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 673#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 672#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 671#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 670#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 669#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 668#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 667#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 666#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 665#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 664#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 663#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 662#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 661#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 660#L25-3 assume !(main_~i~0#1 < 2048); 657#L25-4 main_~i~0#1 := 0; 652#L29-3
[2023-11-19 08:03:29,784 INFO L750 eck$LassoCheckResult]: Loop: 652#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 653#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 652#L29-3
[2023-11-19 08:03:29,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:29,785 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times
[2023-11-19 08:03:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519068140]
[2023-11-19 08:03:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:30,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:30,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519068140]
[2023-11-19 08:03:30,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519068140] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 08:03:30,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364094989]
[2023-11-19 08:03:30,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-19 08:03:30,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 08:03:30,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:30,816 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 08:03:30,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-11-19 08:03:30,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-19 08:03:30,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 08:03:30,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-19 08:03:30,993 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 08:03:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:31,095 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 08:03:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364094989] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 08:03:32,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 08:03:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49
[2023-11-19 08:03:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864888653]
[2023-11-19 08:03:32,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 08:03:32,012 INFO L753 eck$LassoCheckResult]: stem already infeasible
[2023-11-19 08:03:32,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times
[2023-11-19 08:03:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:32,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057210382]
[2023-11-19 08:03:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:32,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:32,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:03:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:03:32,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:03:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:03:32,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-11-19 08:03:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352
[2023-11-19 08:03:32,150 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 08:03:32,779 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions.
[2023-11-19 08:03:32,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 190 transitions.
[2023-11-19 08:03:32,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:32,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 190 transitions.
[2023-11-19 08:03:32,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97
[2023-11-19 08:03:32,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97
[2023-11-19 08:03:32,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 190 transitions.
[2023-11-19 08:03:32,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:03:32,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 189 states and 190 transitions.
[2023-11-19 08:03:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 190 transitions.
[2023-11-19 08:03:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98.
[2023-11-19 08:03:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:03:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions.
[2023-11-19 08:03:32,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions.
[2023-11-19 08:03:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2023-11-19 08:03:32,817 INFO L428 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions.
[2023-11-19 08:03:32,817 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============
[2023-11-19 08:03:32,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions.
[2023-11-19 08:03:32,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2023-11-19 08:03:32,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-19 08:03:32,818 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-11-19 08:03:32,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1]
[2023-11-19 08:03:32,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2023-11-19 08:03:32,822 INFO L748 eck$LassoCheckResult]: Stem: 1231#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 1232#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 1227#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1228#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1229#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1223#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1224#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1320#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1319#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1318#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1317#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1316#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1315#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1314#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1313#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1312#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1311#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1310#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1309#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1308#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1307#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1306#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1305#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1304#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1303#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1302#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1301#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1300#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1299#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1298#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1297#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1296#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1295#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1294#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1293#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1292#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1291#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1290#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1289#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1288#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1287#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1286#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1285#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1284#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1283#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1282#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1281#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1280#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1279#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1278#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1277#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1276#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1275#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1274#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1273#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1272#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1271#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1270#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1269#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1268#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1267#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1266#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1265#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1264#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1263#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1262#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1261#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1260#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1259#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1258#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1257#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1256#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1255#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1254#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1253#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1252#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1251#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1250#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1249#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1248#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1247#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1246#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1245#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1244#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1243#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1242#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1241#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1240#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1239#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1238#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1237#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1236#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1235#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1234#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1233#L25-3 assume !(main_~i~0#1 < 2048); 1230#L25-4 main_~i~0#1 := 0; 1225#L29-3
[2023-11-19 08:03:32,823 INFO L750 eck$LassoCheckResult]: Loop: 1225#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 1226#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1225#L29-3
[2023-11-19 08:03:32,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:03:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times
[2023-11-19 08:03:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:03:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434472455]
[2023-11-19 08:03:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:03:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:03:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:03:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:03:36,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:03:36,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434472455]
[2023-11-19 08:03:36,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434472455] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 08:03:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268330476]
[2023-11-19 08:03:36,061 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-11-19 08:03:36,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 08:03:36,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:03:36,063 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 08:03:36,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9104ee09-ee6f-49c5-8733-22df02229e0d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process