./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:31:39,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:31:39,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:31:39,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:31:39,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:31:39,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:31:39,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:31:39,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:31:39,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:31:39,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:31:39,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:31:39,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:31:39,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:31:39,495 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:31:39,495 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:31:39,496 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:31:39,496 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:31:39,496 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:31:39,496 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:31:39,497 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:31:39,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:31:39,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:31:39,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:31:39,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:31:39,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:31:39,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:31:39,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:31:39,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:31:39,500 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:31:39,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:31:39,500 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:31:39,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:31:39,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:31:39,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:31:39,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:31:39,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:31:39,502 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:31:39,502 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 [2024-11-10 22:31:39,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:31:39,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:31:39,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:31:39,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:31:39,809 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:31:39,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2024-11-10 22:31:41,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:31:41,551 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:31:41,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2024-11-10 22:31:41,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84ba9fa1/51c573efd26e483b83a8b81ed5c1c35d/FLAG5202dadde [2024-11-10 22:31:41,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84ba9fa1/51c573efd26e483b83a8b81ed5c1c35d [2024-11-10 22:31:41,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:31:41,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:31:41,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:31:41,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:31:41,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:31:41,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f1fffe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41, skipping insertion in model container [2024-11-10 22:31:41,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:31:41,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:31:41,871 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:31:41,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:31:41,903 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:31:41,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41 WrapperNode [2024-11-10 22:31:41,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:31:41,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:31:41,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:31:41,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:31:41,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,938 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-11-10 22:31:41,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:31:41,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:31:41,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:31:41,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:31:41,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,971 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-10 22:31:41,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:31:41,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:31:41,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:31:41,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:31:41,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (1/1) ... [2024-11-10 22:31:41,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:42,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:42,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:31:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:31:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 22:31:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:31:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:31:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:31:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:31:42,129 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:31:42,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:31:42,243 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-10 22:31:42,243 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:31:42,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:31:42,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:31:42,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:31:42 BoogieIcfgContainer [2024-11-10 22:31:42,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:31:42,256 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:31:42,258 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:31:42,261 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:31:42,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:42,262 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:31:41" (1/3) ... [2024-11-10 22:31:42,262 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ef8b860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:31:42, skipping insertion in model container [2024-11-10 22:31:42,262 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:42,263 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:41" (2/3) ... [2024-11-10 22:31:42,263 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ef8b860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:31:42, skipping insertion in model container [2024-11-10 22:31:42,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:42,263 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:31:42" (3/3) ... [2024-11-10 22:31:42,264 INFO L332 chiAutomizerObserver]: Analyzing ICFG LexIndexValue-Pointer-2.c [2024-11-10 22:31:42,314 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:31:42,314 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:31:42,314 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:31:42,314 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:31:42,314 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:31:42,315 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:31:42,315 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:31:42,315 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:31:42,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:42,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-10 22:31:42,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:42,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:42,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:31:42,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:31:42,344 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:31:42,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:42,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-10 22:31:42,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:42,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:42,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:31:42,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:31:42,355 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 4#L18-1true [2024-11-10 22:31:42,356 INFO L747 eck$LassoCheckResult]: Loop: 4#L18-1true assume true; 12#L18-2true assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4#L18-1true [2024-11-10 22:31:42,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1632, now seen corresponding path program 1 times [2024-11-10 22:31:42,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:42,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981160871] [2024-11-10 22:31:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:42,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:42,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:42,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:42,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:42,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times [2024-11-10 22:31:42,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:42,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056013971] [2024-11-10 22:31:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:42,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:42,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:42,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:42,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:42,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1568927, now seen corresponding path program 1 times [2024-11-10 22:31:42,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:42,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501597854] [2024-11-10 22:31:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:42,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:42,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:42,888 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:31:42,889 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:31:42,889 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:31:42,889 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:31:42,890 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:31:42,890 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:42,890 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:31:42,890 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:31:42,890 INFO L132 ssoRankerPreferences]: Filename of dumped script: LexIndexValue-Pointer-2.c_Iteration1_Lasso [2024-11-10 22:31:42,890 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:31:42,890 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:31:42,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:42,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:43,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:43,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:43,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:43,322 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:31:43,327 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:31:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:31:43,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-10 22:31:43,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:31:43,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:31:43,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:31:43,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 22:31:43,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,422 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:31:43,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 22:31:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:31:43,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-10 22:31:43,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:31:43,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:31:43,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 22:31:43,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 22:31:43,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:31:43,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:31:43,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,611 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:31:43,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-10 22:31:43,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,648 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:31:43,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-10 22:31:43,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,678 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:31:43,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:43,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:43,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:43,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-10 22:31:43,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,707 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 22:31:43,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,719 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-10 22:31:43,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,724 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-10 22:31:43,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:31:43,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-10 22:31:43,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 22:31:43,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:31:43,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:31:43,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 22:31:43,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,808 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 22:31:43,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:31:43,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:31:43,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:43,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-10 22:31:43,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,850 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 22:31:43,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:31:43,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:43,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:43,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:43,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:43,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:31:43,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:31:43,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:31:43,910 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-10 22:31:43,910 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-10 22:31:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:43,929 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:43,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 22:31:43,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:31:43,951 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:31:43,951 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:31:43,952 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~p~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 2095*v_rep(select #length ULTIMATE.start_main_~p~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 22:31:43,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:31:43,980 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-11-10 22:31:43,995 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:31:43,996 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:31:44,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:44,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:31:44,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:44,063 WARN L253 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:31:44,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:44,111 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:31:44,113 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:44,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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 24 states and 34 transitions. Complement of second has 6 states. [2024-11-10 22:31:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:31:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-10 22:31:44,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-10 22:31:44,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:44,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-10 22:31:44,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:44,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-10 22:31:44,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:44,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2024-11-10 22:31:44,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:44,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 11 states and 15 transitions. [2024-11-10 22:31:44,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-10 22:31:44,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 22:31:44,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2024-11-10 22:31:44,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:44,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2024-11-10 22:31:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2024-11-10 22:31:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-10 22:31:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2024-11-10 22:31:44,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2024-11-10 22:31:44,207 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2024-11-10 22:31:44,207 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:31:44,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2024-11-10 22:31:44,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:44,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:44,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:44,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:31:44,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:31:44,208 INFO L745 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 99#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 94#L18-1 assume true; 96#L18-2 assume !(main_~i~0#1 < 1048); 89#L18 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 90#L22 [2024-11-10 22:31:44,208 INFO L747 eck$LassoCheckResult]: Loop: 90#L22 assume true;assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 91#L22-2 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 92#L22-1 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 93#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 90#L22 [2024-11-10 22:31:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash 48636688, now seen corresponding path program 1 times [2024-11-10 22:31:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499876757] [2024-11-10 22:31:44,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:44,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:44,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499876757] [2024-11-10 22:31:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499876757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:31:44,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:31:44,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:31:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468373232] [2024-11-10 22:31:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:31:44,275 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:31:44,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1260122, now seen corresponding path program 1 times [2024-11-10 22:31:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:44,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303327503] [2024-11-10 22:31:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:44,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:44,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:31:44,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:31:44,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:31:44,414 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:31:44,424 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-11-10 22:31:44,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-11-10 22:31:44,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:44,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 15 transitions. [2024-11-10 22:31:44,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:31:44,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 22:31:44,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-11-10 22:31:44,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:44,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-10 22:31:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-11-10 22:31:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-11-10 22:31:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-10 22:31:44,427 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-10 22:31:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:31:44,429 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-10 22:31:44,429 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:31:44,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-11-10 22:31:44,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:44,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:44,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:44,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-10 22:31:44,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:31:44,431 INFO L745 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 125#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 126#L18-1 assume true; 127#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 128#L18-1 assume true; 129#L18-2 assume !(main_~i~0#1 < 1048); 119#L18 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 120#L22 [2024-11-10 22:31:44,431 INFO L747 eck$LassoCheckResult]: Loop: 120#L22 assume true;assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 121#L22-2 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 122#L22-1 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 123#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 120#L22 [2024-11-10 22:31:44,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash -504718223, now seen corresponding path program 1 times [2024-11-10 22:31:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2914362] [2024-11-10 22:31:44,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2914362] [2024-11-10 22:31:44,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2914362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:31:44,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12613574] [2024-11-10 22:31:44,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:44,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:31:44,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:44,528 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:31:44,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 22:31:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:44,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:31:44,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:44,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:31:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12613574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:31:44,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:31:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 22:31:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079790667] [2024-11-10 22:31:44,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:31:44,614 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:31:44,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1260122, now seen corresponding path program 2 times [2024-11-10 22:31:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613314333] [2024-11-10 22:31:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:44,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:44,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:31:44,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 22:31:44,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 22:31:44,752 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:31:44,770 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-10 22:31:44,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2024-11-10 22:31:44,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:44,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2024-11-10 22:31:44,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:31:44,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 22:31:44,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2024-11-10 22:31:44,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:44,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-10 22:31:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2024-11-10 22:31:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-10 22:31:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-10 22:31:44,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-10 22:31:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 22:31:44,778 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-10 22:31:44,778 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:31:44,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2024-11-10 22:31:44,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:44,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:44,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:44,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1] [2024-11-10 22:31:44,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:31:44,780 INFO L745 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 203#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 204#L18-1 assume true; 205#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 206#L18-1 assume true; 207#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 209#L18-1 assume true; 213#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 212#L18-1 assume true; 211#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 210#L18-1 assume true; 208#L18-2 assume !(main_~i~0#1 < 1048); 197#L18 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 198#L22 [2024-11-10 22:31:44,781 INFO L747 eck$LassoCheckResult]: Loop: 198#L22 assume true;assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 199#L22-2 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 200#L22-1 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 201#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 198#L22 [2024-11-10 22:31:44,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash -428912876, now seen corresponding path program 2 times [2024-11-10 22:31:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:44,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169451669] [2024-11-10 22:31:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:44,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169451669] [2024-11-10 22:31:44,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169451669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:31:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508002014] [2024-11-10 22:31:44,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:31:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:31:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:44,931 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:31:44,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 22:31:44,990 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:31:44,990 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:31:44,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:31:44,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:45,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:31:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:45,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508002014] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:31:45,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:31:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 22:31:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837032641] [2024-11-10 22:31:45,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:31:45,110 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:31:45,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:45,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1260122, now seen corresponding path program 3 times [2024-11-10 22:31:45,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:45,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413087279] [2024-11-10 22:31:45,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:45,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:45,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:45,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:45,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:31:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 22:31:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 22:31:45,225 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:31:45,249 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-10 22:31:45,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2024-11-10 22:31:45,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:45,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 33 transitions. [2024-11-10 22:31:45,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:31:45,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 22:31:45,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2024-11-10 22:31:45,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:45,251 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-10 22:31:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2024-11-10 22:31:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-10 22:31:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-10 22:31:45,254 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-10 22:31:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 22:31:45,255 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-10 22:31:45,256 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:31:45,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2024-11-10 22:31:45,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:45,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:45,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:45,257 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1] [2024-11-10 22:31:45,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:31:45,258 INFO L745 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 348#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 341#L18-1 assume true; 342#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 343#L18-1 assume true; 344#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 350#L18-1 assume true; 366#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 365#L18-1 assume true; 364#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 363#L18-1 assume true; 362#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 361#L18-1 assume true; 360#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 359#L18-1 assume true; 358#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 357#L18-1 assume true; 356#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 355#L18-1 assume true; 354#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 353#L18-1 assume true; 352#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 351#L18-1 assume true; 349#L18-2 assume !(main_~i~0#1 < 1048); 338#L18 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 339#L22 [2024-11-10 22:31:45,258 INFO L747 eck$LassoCheckResult]: Loop: 339#L22 assume true;assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 340#L22-2 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 345#L22-1 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 346#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 339#L22 [2024-11-10 22:31:45,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1842015846, now seen corresponding path program 3 times [2024-11-10 22:31:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547433207] [2024-11-10 22:31:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:45,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:45,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 22:31:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547433207] [2024-11-10 22:31:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547433207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:31:45,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204359432] [2024-11-10 22:31:45,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 22:31:45,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:31:45,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:45,587 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:31:45,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 22:31:45,706 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-10 22:31:45,706 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:31:45,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:31:45,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:45,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:31:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:46,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204359432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:31:46,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:31:46,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-10 22:31:46,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445398133] [2024-11-10 22:31:46,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:31:46,032 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:31:46,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1260122, now seen corresponding path program 4 times [2024-11-10 22:31:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:46,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509709562] [2024-11-10 22:31:46,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:46,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:46,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:31:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 22:31:46,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-10 22:31:46,140 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:31:46,193 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-11-10 22:31:46,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 69 transitions. [2024-11-10 22:31:46,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:46,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 54 states and 57 transitions. [2024-11-10 22:31:46,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:31:46,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 22:31:46,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 57 transitions. [2024-11-10 22:31:46,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:46,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-11-10 22:31:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 57 transitions. [2024-11-10 22:31:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-11-10 22:31:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-11-10 22:31:46,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-10 22:31:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 22:31:46,201 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-10 22:31:46,201 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:31:46,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 56 transitions. [2024-11-10 22:31:46,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:46,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:46,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:46,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1, 1, 1, 1] [2024-11-10 22:31:46,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:31:46,204 INFO L745 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 609#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 610#L18-1 assume true; 611#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 612#L18-1 assume true; 613#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 617#L18-1 assume true; 657#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 656#L18-1 assume true; 655#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 654#L18-1 assume true; 653#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 652#L18-1 assume true; 651#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 650#L18-1 assume true; 649#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 648#L18-1 assume true; 647#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 646#L18-1 assume true; 645#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 644#L18-1 assume true; 643#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 642#L18-1 assume true; 641#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 640#L18-1 assume true; 639#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 638#L18-1 assume true; 637#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 636#L18-1 assume true; 635#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 634#L18-1 assume true; 633#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 632#L18-1 assume true; 631#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 630#L18-1 assume true; 629#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 628#L18-1 assume true; 627#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 626#L18-1 assume true; 625#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 624#L18-1 assume true; 623#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 622#L18-1 assume true; 621#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 620#L18-1 assume true; 619#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 618#L18-1 assume true; 616#L18-2 assume !(main_~i~0#1 < 1048); 605#L18 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 606#L22 [2024-11-10 22:31:46,205 INFO L747 eck$LassoCheckResult]: Loop: 606#L22 assume true;assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 607#L22-2 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 614#L22-1 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 615#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 606#L22 [2024-11-10 22:31:46,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:46,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1704637530, now seen corresponding path program 4 times [2024-11-10 22:31:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29818817] [2024-11-10 22:31:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:46,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29818817] [2024-11-10 22:31:46,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29818817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:31:46,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447318626] [2024-11-10 22:31:46,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:31:46,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:31:46,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:46,931 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:31:46,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-10 22:31:47,039 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:31:47,040 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:31:47,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 22:31:47,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:47,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:31:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:47,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447318626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:31:47,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:31:47,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-10 22:31:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119895234] [2024-11-10 22:31:47,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:31:47,970 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:31:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1260122, now seen corresponding path program 5 times [2024-11-10 22:31:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:47,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774623990] [2024-11-10 22:31:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:47,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:47,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:48,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:31:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 22:31:48,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 22:31:48,066 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. cyclomatic complexity: 5 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:31:48,150 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2024-11-10 22:31:48,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 129 transitions. [2024-11-10 22:31:48,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:48,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 102 states and 105 transitions. [2024-11-10 22:31:48,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:31:48,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 22:31:48,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 105 transitions. [2024-11-10 22:31:48,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:48,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 105 transitions. [2024-11-10 22:31:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 105 transitions. [2024-11-10 22:31:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-10 22:31:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 100 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2024-11-10 22:31:48,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 104 transitions. [2024-11-10 22:31:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-10 22:31:48,161 INFO L425 stractBuchiCegarLoop]: Abstraction has 101 states and 104 transitions. [2024-11-10 22:31:48,161 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:31:48,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 104 transitions. [2024-11-10 22:31:48,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:31:48,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:48,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:48,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1, 1, 1, 1] [2024-11-10 22:31:48,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:31:48,170 INFO L745 eck$LassoCheckResult]: Stem: 1133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1134#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 1127#L18-1 assume true; 1128#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1129#L18-1 assume true; 1130#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1136#L18-1 assume true; 1224#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1223#L18-1 assume true; 1222#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1221#L18-1 assume true; 1220#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1219#L18-1 assume true; 1218#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1217#L18-1 assume true; 1216#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1215#L18-1 assume true; 1214#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1213#L18-1 assume true; 1212#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1211#L18-1 assume true; 1210#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1209#L18-1 assume true; 1208#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1207#L18-1 assume true; 1206#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1205#L18-1 assume true; 1204#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1203#L18-1 assume true; 1202#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1201#L18-1 assume true; 1200#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1199#L18-1 assume true; 1198#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1197#L18-1 assume true; 1196#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1195#L18-1 assume true; 1194#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1193#L18-1 assume true; 1192#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1191#L18-1 assume true; 1190#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1189#L18-1 assume true; 1188#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1187#L18-1 assume true; 1186#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1185#L18-1 assume true; 1184#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1183#L18-1 assume true; 1182#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1181#L18-1 assume true; 1180#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1179#L18-1 assume true; 1178#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1177#L18-1 assume true; 1176#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1175#L18-1 assume true; 1174#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1173#L18-1 assume true; 1172#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1171#L18-1 assume true; 1170#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1169#L18-1 assume true; 1168#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1167#L18-1 assume true; 1166#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1165#L18-1 assume true; 1164#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1163#L18-1 assume true; 1162#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1161#L18-1 assume true; 1160#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1159#L18-1 assume true; 1158#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1157#L18-1 assume true; 1156#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1155#L18-1 assume true; 1154#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1153#L18-1 assume true; 1152#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1151#L18-1 assume true; 1150#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1149#L18-1 assume true; 1148#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1147#L18-1 assume true; 1146#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1145#L18-1 assume true; 1144#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1143#L18-1 assume true; 1142#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1141#L18-1 assume true; 1140#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1139#L18-1 assume true; 1138#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1137#L18-1 assume true; 1135#L18-2 assume !(main_~i~0#1 < 1048); 1124#L18 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 1125#L22 [2024-11-10 22:31:48,171 INFO L747 eck$LassoCheckResult]: Loop: 1125#L22 assume true;assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 1126#L22-2 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 1131#L22-1 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 1132#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 1125#L22 [2024-11-10 22:31:48,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1171428286, now seen corresponding path program 5 times [2024-11-10 22:31:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:48,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872360955] [2024-11-10 22:31:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:48,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872360955] [2024-11-10 22:31:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872360955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:31:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462109561] [2024-11-10 22:31:50,222 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 22:31:50,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:31:50,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:50,225 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:31:50,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-10 22:32:11,217 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-10 22:32:11,217 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:32:11,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 22:32:11,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:32:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:32:11,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:32:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:32:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462109561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:32:14,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:32:14,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-10 22:32:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055384163] [2024-11-10 22:32:14,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:32:14,203 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:32:14,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:32:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1260122, now seen corresponding path program 6 times [2024-11-10 22:32:14,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:32:14,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089372233] [2024-11-10 22:32:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:32:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:32:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:32:14,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:32:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:32:14,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:32:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:32:14,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-10 22:32:14,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-10 22:32:14,303 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. cyclomatic complexity: 5 Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:32:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:32:14,505 INFO L93 Difference]: Finished difference Result 246 states and 249 transitions. [2024-11-10 22:32:14,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 249 transitions. [2024-11-10 22:32:14,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:32:14,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 198 states and 201 transitions. [2024-11-10 22:32:14,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:32:14,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 22:32:14,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 201 transitions. [2024-11-10 22:32:14,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:32:14,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 198 states and 201 transitions. [2024-11-10 22:32:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 201 transitions. [2024-11-10 22:32:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2024-11-10 22:32:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 197 states have (on average 1.015228426395939) internal successors, (200), 196 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:32:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2024-11-10 22:32:14,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 197 states and 200 transitions. [2024-11-10 22:32:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-10 22:32:14,529 INFO L425 stractBuchiCegarLoop]: Abstraction has 197 states and 200 transitions. [2024-11-10 22:32:14,529 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:32:14,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 200 transitions. [2024-11-10 22:32:14,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:32:14,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:32:14,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:32:14,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [95, 94, 1, 1, 1, 1] [2024-11-10 22:32:14,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:32:14,538 INFO L745 eck$LassoCheckResult]: Stem: 2156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2157#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 2150#L18-1 assume true; 2151#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2152#L18-1 assume true; 2153#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2159#L18-1 assume true; 2343#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2342#L18-1 assume true; 2341#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2340#L18-1 assume true; 2339#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2338#L18-1 assume true; 2337#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2336#L18-1 assume true; 2335#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2334#L18-1 assume true; 2333#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2332#L18-1 assume true; 2331#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2330#L18-1 assume true; 2329#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2328#L18-1 assume true; 2327#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2326#L18-1 assume true; 2325#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2324#L18-1 assume true; 2323#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2322#L18-1 assume true; 2321#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2320#L18-1 assume true; 2319#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2318#L18-1 assume true; 2317#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2316#L18-1 assume true; 2315#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2314#L18-1 assume true; 2313#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2312#L18-1 assume true; 2311#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2310#L18-1 assume true; 2309#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2308#L18-1 assume true; 2307#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2306#L18-1 assume true; 2305#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2304#L18-1 assume true; 2303#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2302#L18-1 assume true; 2301#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2300#L18-1 assume true; 2299#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2298#L18-1 assume true; 2297#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2296#L18-1 assume true; 2295#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2294#L18-1 assume true; 2293#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2292#L18-1 assume true; 2291#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2290#L18-1 assume true; 2289#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2288#L18-1 assume true; 2287#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2286#L18-1 assume true; 2285#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2284#L18-1 assume true; 2283#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2282#L18-1 assume true; 2281#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2280#L18-1 assume true; 2279#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2278#L18-1 assume true; 2277#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2276#L18-1 assume true; 2275#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2274#L18-1 assume true; 2273#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2272#L18-1 assume true; 2271#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2270#L18-1 assume true; 2269#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2268#L18-1 assume true; 2267#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2266#L18-1 assume true; 2265#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2264#L18-1 assume true; 2263#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2262#L18-1 assume true; 2261#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2260#L18-1 assume true; 2259#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2258#L18-1 assume true; 2257#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2256#L18-1 assume true; 2255#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2254#L18-1 assume true; 2253#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2252#L18-1 assume true; 2251#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2250#L18-1 assume true; 2249#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2248#L18-1 assume true; 2247#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2246#L18-1 assume true; 2245#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2244#L18-1 assume true; 2243#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2242#L18-1 assume true; 2241#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2240#L18-1 assume true; 2239#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2238#L18-1 assume true; 2237#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2236#L18-1 assume true; 2235#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2234#L18-1 assume true; 2233#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2232#L18-1 assume true; 2231#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2230#L18-1 assume true; 2229#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2228#L18-1 assume true; 2227#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2226#L18-1 assume true; 2225#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2224#L18-1 assume true; 2223#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2222#L18-1 assume true; 2221#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2220#L18-1 assume true; 2219#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2218#L18-1 assume true; 2217#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2216#L18-1 assume true; 2215#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2214#L18-1 assume true; 2213#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2212#L18-1 assume true; 2211#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2210#L18-1 assume true; 2209#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2208#L18-1 assume true; 2207#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2206#L18-1 assume true; 2205#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2204#L18-1 assume true; 2203#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2202#L18-1 assume true; 2201#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2200#L18-1 assume true; 2199#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2198#L18-1 assume true; 2197#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2196#L18-1 assume true; 2195#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2194#L18-1 assume true; 2193#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2192#L18-1 assume true; 2191#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2190#L18-1 assume true; 2189#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2188#L18-1 assume true; 2187#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2186#L18-1 assume true; 2185#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2184#L18-1 assume true; 2183#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2182#L18-1 assume true; 2181#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2180#L18-1 assume true; 2179#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2178#L18-1 assume true; 2177#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2176#L18-1 assume true; 2175#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2174#L18-1 assume true; 2173#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2172#L18-1 assume true; 2171#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2170#L18-1 assume true; 2169#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2168#L18-1 assume true; 2167#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2166#L18-1 assume true; 2165#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2164#L18-1 assume true; 2163#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2162#L18-1 assume true; 2161#L18-2 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2160#L18-1 assume true; 2158#L18-2 assume !(main_~i~0#1 < 1048); 2147#L18 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 2148#L22 [2024-11-10 22:32:14,539 INFO L747 eck$LassoCheckResult]: Loop: 2148#L22 assume true;assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 2149#L22-2 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 2154#L22-1 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 2155#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 2148#L22 [2024-11-10 22:32:14,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:32:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash -89099282, now seen corresponding path program 6 times [2024-11-10 22:32:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:32:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781725981] [2024-11-10 22:32:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:32:14,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:32:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:32:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:32:20,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:32:20,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781725981] [2024-11-10 22:32:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781725981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:32:20,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691636962] [2024-11-10 22:32:20,243 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 22:32:20,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:32:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:32:20,245 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:32:20,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process