./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i -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 c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:17:45,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:17:46,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:17:46,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:17:46,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:17:46,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:17:46,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:17:46,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:17:46,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:17:46,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:17:46,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:17:46,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:17:46,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:17:46,053 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:17:46,054 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:17:46,055 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:17:46,055 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:17:46,055 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:17:46,056 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:17:46,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:17:46,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:17:46,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:17:46,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:17:46,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:17:46,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:17:46,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:17:46,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:17:46,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:17:46,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:17:46,062 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:17:46,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:17:46,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:17:46,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:17:46,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:17:46,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:17:46,065 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:17:46,065 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 -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2024-10-15 00:17:46,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:17:46,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:17:46,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:17:46,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:17:46,374 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:17:46,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2024-10-15 00:17:47,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:17:48,161 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:17:48,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2024-10-15 00:17:48,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e60dc55e/b7705c7459db4ebe8b076e3c76bb959f/FLAGf406f36f5 [2024-10-15 00:17:48,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e60dc55e/b7705c7459db4ebe8b076e3c76bb959f [2024-10-15 00:17:48,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:17:48,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:17:48,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:17:48,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:17:48,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:17:48,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a09eddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48, skipping insertion in model container [2024-10-15 00:17:48,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:17:48,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:17:48,570 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:17:48,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:17:48,658 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:17:48,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48 WrapperNode [2024-10-15 00:17:48,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:17:48,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:17:48,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:17:48,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:17:48,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,708 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-10-15 00:17:48,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:17:48,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:17:48,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:17:48,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:17:48,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,741 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-10-15 00:17:48,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:17:48,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:17:48,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:17:48,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:17:48,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (1/1) ... [2024-10-15 00:17:48,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:48,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:48,805 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-10-15 00:17:48,811 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-10-15 00:17:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:17:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:17:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:17:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:17:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:17:48,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:17:48,982 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:17:48,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:17:49,093 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-15 00:17:49,093 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:17:49,111 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:17:49,112 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 00:17:49,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:17:49 BoogieIcfgContainer [2024-10-15 00:17:49,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:17:49,114 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:17:49,114 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:17:49,118 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:17:49,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:17:49,119 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:17:48" (1/3) ... [2024-10-15 00:17:49,120 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ea3f230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:17:49, skipping insertion in model container [2024-10-15 00:17:49,122 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:17:49,122 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:17:48" (2/3) ... [2024-10-15 00:17:49,122 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ea3f230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:17:49, skipping insertion in model container [2024-10-15 00:17:49,122 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:17:49,122 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:17:49" (3/3) ... [2024-10-15 00:17:49,124 INFO L332 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2024-10-15 00:17:49,181 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:17:49,181 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:17:49,181 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:17:49,181 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:17:49,181 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:17:49,182 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:17:49,182 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:17:49,182 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:17:49,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-10-15 00:17:49,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:17:49,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:49,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:49,209 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:17:49,209 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:49,209 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:17:49,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-10-15 00:17:49,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:17:49,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:49,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:49,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:17:49,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:49,221 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 13#L367true assume !(main_~length~0#1 < 1); 10#L367-2true assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 14#L371true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 16#L373true assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 3#L375-3true [2024-10-15 00:17:49,221 INFO L747 eck$LassoCheckResult]: Loop: 3#L375-3true assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 8#L375-2true main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 3#L375-3true [2024-10-15 00:17:49,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:49,227 INFO L85 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2024-10-15 00:17:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:49,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543161159] [2024-10-15 00:17:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:49,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:49,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:49,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:49,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-10-15 00:17:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423824307] [2024-10-15 00:17:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:49,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:49,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:49,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash 180522064, now seen corresponding path program 1 times [2024-10-15 00:17:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881936181] [2024-10-15 00:17:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:49,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:49,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:49,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:49,895 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:17:49,897 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:17:49,897 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:17:49,897 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:17:49,897 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:17:49,897 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:49,897 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:17:49,898 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:17:49,898 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2024-10-15 00:17:49,898 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:17:49,898 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:17:49,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:49,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:50,475 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:17:50,479 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:17:50,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,484 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-10-15 00:17:50,485 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-10-15 00:17:50,487 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-10-15 00:17:50,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,524 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-10-15 00:17:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,528 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-10-15 00:17:50,530 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-10-15 00:17:50,531 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-10-15 00:17:50,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,559 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-10-15 00:17:50,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,562 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-10-15 00:17:50,564 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-10-15 00:17:50,566 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-10-15 00:17:50,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,603 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-10-15 00:17:50,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,607 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-10-15 00:17:50,609 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-10-15 00:17:50,609 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-10-15 00:17:50,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:17:50,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,647 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-10-15 00:17:50,649 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-10-15 00:17:50,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-10-15 00:17:50,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,686 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-10-15 00:17:50,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,688 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-10-15 00:17:50,690 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-10-15 00:17:50,691 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-10-15 00:17:50,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:50,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,721 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-10-15 00:17:50,722 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-10-15 00:17:50,722 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-10-15 00:17:50,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,751 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-10-15 00:17:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,754 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-10-15 00:17:50,755 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-10-15 00:17:50,757 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-10-15 00:17:50,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,791 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-10-15 00:17:50,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,794 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-10-15 00:17:50,795 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-10-15 00:17:50,797 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-10-15 00:17:50,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-15 00:17:50,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,833 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-10-15 00:17:50,835 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-10-15 00:17:50,836 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-10-15 00:17:50,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-15 00:17:50,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,872 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-10-15 00:17:50,873 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-10-15 00:17:50,875 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-10-15 00:17:50,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:50,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:50,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:50,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:50,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:50,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,907 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-10-15 00:17:50,908 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-10-15 00:17:50,909 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-10-15 00:17:50,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:50,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:50,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:50,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:50,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:17:50,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:17:50,942 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:17:50,965 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-15 00:17:50,965 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-15 00:17:50,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:50,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:50,988 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-10-15 00:17:50,991 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-10-15 00:17:50,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:17:51,011 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:17:51,012 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:17:51,012 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-15 00:17:51,028 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-10-15 00:17:51,038 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-15 00:17:51,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:17:51,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:17:51,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-10-15 00:17:51,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:51,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:17:51,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:51,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:17:51,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:51,169 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:17:51,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-15 00:17:51,223 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 27 states and 39 transitions. Complement of second has 6 states. [2024-10-15 00:17:51,225 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-10-15 00:17:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-15 00:17:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-10-15 00:17:51,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-15 00:17:51,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:17:51,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 2 letters. [2024-10-15 00:17:51,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:17:51,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-15 00:17:51,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:17:51,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 39 transitions. [2024-10-15 00:17:51,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:51,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 12 states and 16 transitions. [2024-10-15 00:17:51,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-15 00:17:51,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:17:51,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2024-10-15 00:17:51,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:17:51,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-15 00:17:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2024-10-15 00:17:51,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-15 00:17:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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-10-15 00:17:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-10-15 00:17:51,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-15 00:17:51,259 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-15 00:17:51,259 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:17:51,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-10-15 00:17:51,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:51,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:51,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:51,260 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:17:51,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:51,260 INFO L745 eck$LassoCheckResult]: Stem: 110#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 112#L367 assume !(main_~length~0#1 < 1); 104#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 105#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 113#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 106#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 107#L375-4 main_~j~0#1 := 1; 102#L380-2 [2024-10-15 00:17:51,261 INFO L747 eck$LassoCheckResult]: Loop: 102#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 103#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 102#L380-2 [2024-10-15 00:17:51,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash 180522006, now seen corresponding path program 1 times [2024-10-15 00:17:51,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:51,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231906616] [2024-10-15 00:17:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:51,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:51,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:17:51,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231906616] [2024-10-15 00:17:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231906616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:17:51,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:17:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:17:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732810370] [2024-10-15 00:17:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:17:51,389 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:17:51,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:51,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 1 times [2024-10-15 00:17:51,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:51,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696365699] [2024-10-15 00:17:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:51,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:51,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:51,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:51,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:17:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:17:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:17:51,493 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-10-15 00:17:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:17:51,517 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-10-15 00:17:51,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-10-15 00:17:51,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:51,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2024-10-15 00:17:51,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:17:51,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:17:51,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-10-15 00:17:51,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:17:51,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-15 00:17:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-10-15 00:17:51,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-10-15 00:17:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-10-15 00:17:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-10-15 00:17:51,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-15 00:17:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:17:51,522 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-15 00:17:51,523 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:17:51,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-10-15 00:17:51,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:51,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:51,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:51,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:17:51,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:51,524 INFO L745 eck$LassoCheckResult]: Stem: 142#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 144#L367 assume !(main_~length~0#1 < 1); 140#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 141#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 145#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 136#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 137#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 138#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 139#L375-4 main_~j~0#1 := 1; 134#L380-2 [2024-10-15 00:17:51,524 INFO L747 eck$LassoCheckResult]: Loop: 134#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 135#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 134#L380-2 [2024-10-15 00:17:51,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1683012600, now seen corresponding path program 1 times [2024-10-15 00:17:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:51,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122018774] [2024-10-15 00:17:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:51,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:51,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:51,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:51,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 2 times [2024-10-15 00:17:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:51,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196168920] [2024-10-15 00:17:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:51,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:51,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:51,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1827560517, now seen corresponding path program 1 times [2024-10-15 00:17:51,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794370983] [2024-10-15 00:17:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:51,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-15 00:17:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:17:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794370983] [2024-10-15 00:17:51,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794370983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:17:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565839388] [2024-10-15 00:17:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:51,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:17:51,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:51,773 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:17:51,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-15 00:17:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:51,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:17:51,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:51,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:17:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:51,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565839388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:17:51,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:17:51,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-10-15 00:17:51,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488273763] [2024-10-15 00:17:51,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:17:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:17:51,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 00:17:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-15 00:17:51,973 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-10-15 00:17:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:17:52,037 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-15 00:17:52,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2024-10-15 00:17:52,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:52,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 15 states and 17 transitions. [2024-10-15 00:17:52,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:17:52,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:17:52,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-10-15 00:17:52,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:17:52,040 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-15 00:17:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-10-15 00:17:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-15 00:17:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 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-10-15 00:17:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-10-15 00:17:52,043 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-15 00:17:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 00:17:52,045 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-15 00:17:52,045 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:17:52,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-10-15 00:17:52,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:52,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:52,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:52,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:17:52,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:52,048 INFO L745 eck$LassoCheckResult]: Stem: 262#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 264#L367 assume !(main_~length~0#1 < 1); 256#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 257#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 265#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 258#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 259#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 260#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 261#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 267#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 266#L375-4 main_~j~0#1 := 1; 254#L380-2 [2024-10-15 00:17:52,048 INFO L747 eck$LassoCheckResult]: Loop: 254#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 255#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 254#L380-2 [2024-10-15 00:17:52,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1827505318, now seen corresponding path program 2 times [2024-10-15 00:17:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267493530] [2024-10-15 00:17:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:52,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:52,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:52,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 3 times [2024-10-15 00:17:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611333613] [2024-10-15 00:17:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:52,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:52,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:52,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash 409014941, now seen corresponding path program 2 times [2024-10-15 00:17:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:52,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312474720] [2024-10-15 00:17:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:52,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:52,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:52,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:52,480 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:17:52,480 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:17:52,480 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:17:52,480 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:17:52,480 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:17:52,480 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:52,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:17:52,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:17:52,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2024-10-15 00:17:52,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:17:52,480 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:17:52,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:52,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:17:53,010 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:17:53,010 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:17:53,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,015 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-10-15 00:17:53,016 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-10-15 00:17:53,017 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-10-15 00:17:53,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,050 INFO L229 MonitoredProcess]: Starting monitored process 17 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-10-15 00:17:53,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 00:17:53,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:17:53,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-15 00:17:53,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,086 INFO L229 MonitoredProcess]: Starting monitored process 18 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-10-15 00:17:53,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 00:17:53,091 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-10-15 00:17:53,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,120 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10-15 00:17:53,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 00:17:53,122 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-10-15 00:17:53,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,151 INFO L229 MonitoredProcess]: Starting monitored process 20 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-10-15 00:17:53,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 00:17:53,153 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-10-15 00:17:53,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,177 INFO L229 MonitoredProcess]: Starting monitored process 21 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-10-15 00:17:53,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 00:17:53,180 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-10-15 00:17:53,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,211 INFO L229 MonitoredProcess]: Starting monitored process 22 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-10-15 00:17:53,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:17:53,213 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-10-15 00:17:53,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,240 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10-15 00:17:53,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-15 00:17:53,242 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-10-15 00:17:53,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,272 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10-15 00:17:53,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 00:17:53,275 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-10-15 00:17:53,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:17:53,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:17:53,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:17:53,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,311 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10-15 00:17:53,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-15 00:17:53,313 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-10-15 00:17:53,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:17:53,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:17:53,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-15 00:17:53,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,359 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10-15 00:17:53,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-15 00:17:53,361 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-10-15 00:17:53,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:17:53,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:17:53,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:17:53,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-15 00:17:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,401 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10-15 00:17:53,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-15 00:17:53,403 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-10-15 00:17:53,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:17:53,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:17:53,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:17:53,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:17:53,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:17:53,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:17:53,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:17:53,469 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-15 00:17:53,469 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-10-15 00:17:53,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:17:53,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:53,473 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10-15 00:17:53,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:17:53,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-15 00:17:53,487 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:17:53,487 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:17:53,487 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2) = -2*ULTIMATE.start_main_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2024-10-15 00:17:53,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-15 00:17:53,516 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:17:53,521 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:17:53,521 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:17:53,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:53,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:17:53,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:53,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:17:53,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:53,697 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-15 00:17:53,697 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-15 00:17:53,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 states and 22 transitions. Complement of second has 6 states. [2024-10-15 00:17:53,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:17:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-15 00:17:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-10-15 00:17:53,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2024-10-15 00:17:53,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:17:53,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2024-10-15 00:17:53,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:17:53,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-15 00:17:53,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:17:53,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2024-10-15 00:17:53,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:53,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2024-10-15 00:17:53,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:17:53,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:17:53,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-10-15 00:17:53,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:17:53,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-15 00:17:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-10-15 00:17:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-15 00:17:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 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-10-15 00:17:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-15 00:17:53,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-15 00:17:53,760 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-15 00:17:53,760 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:17:53,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2024-10-15 00:17:53,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:53,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:53,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:53,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:17:53,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:53,762 INFO L745 eck$LassoCheckResult]: Stem: 392#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 390#L367 assume !(main_~length~0#1 < 1); 384#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 385#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 391#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 386#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 387#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 388#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 389#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 396#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 394#L375-4 main_~j~0#1 := 1; 395#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 383#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 379#L380-2 [2024-10-15 00:17:53,762 INFO L747 eck$LassoCheckResult]: Loop: 379#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 380#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 379#L380-2 [2024-10-15 00:17:53,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash 409014943, now seen corresponding path program 1 times [2024-10-15 00:17:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:53,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008818073] [2024-10-15 00:17:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:54,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-15 00:17:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:54,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:17:54,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008818073] [2024-10-15 00:17:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008818073] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:17:54,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004668524] [2024-10-15 00:17:54,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:54,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:17:54,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:54,210 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:17:54,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-15 00:17:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:54,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:17:54,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:54,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 00:17:54,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-15 00:17:54,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:17:54,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-10-15 00:17:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:54,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:17:54,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2024-10-15 00:17:54,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:17:54,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 726 treesize of output 630 [2024-10-15 00:17:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004668524] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:17:54,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:17:54,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2024-10-15 00:17:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951285876] [2024-10-15 00:17:54,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:17:54,643 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:17:54,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:54,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 4 times [2024-10-15 00:17:54,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:54,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279418408] [2024-10-15 00:17:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:54,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:54,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:54,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:17:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 00:17:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-10-15 00:17:54,734 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 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-10-15 00:17:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:17:54,971 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-15 00:17:54,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2024-10-15 00:17:54,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:54,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 25 transitions. [2024-10-15 00:17:54,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:17:54,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:17:54,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-10-15 00:17:54,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:17:54,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-15 00:17:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-10-15 00:17:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-15 00:17:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:17:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-15 00:17:54,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-15 00:17:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 00:17:54,976 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-15 00:17:54,976 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:17:54,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-10-15 00:17:54,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:54,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:54,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:54,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:17:54,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:54,977 INFO L745 eck$LassoCheckResult]: Stem: 538#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 540#L367 assume !(main_~length~0#1 < 1); 535#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 536#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 541#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 531#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 532#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 533#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 534#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 543#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 542#L375-4 main_~j~0#1 := 1; 527#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 528#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 529#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 530#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 537#L380-2 [2024-10-15 00:17:54,977 INFO L747 eck$LassoCheckResult]: Loop: 537#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 544#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 537#L380-2 [2024-10-15 00:17:54,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2073631454, now seen corresponding path program 1 times [2024-10-15 00:17:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573641255] [2024-10-15 00:17:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:17:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573641255] [2024-10-15 00:17:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573641255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:17:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335093838] [2024-10-15 00:17:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:17:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:55,079 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:17:55,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-15 00:17:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:55,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:17:55,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:55,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:17:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335093838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:17:55,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:17:55,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-15 00:17:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792119552] [2024-10-15 00:17:55,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:17:55,246 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:17:55,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 5 times [2024-10-15 00:17:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:55,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629883515] [2024-10-15 00:17:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:55,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:55,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:55,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:17:55,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 00:17:55,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-15 00:17:55,329 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:17:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:17:55,374 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-10-15 00:17:55,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2024-10-15 00:17:55,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:55,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 24 transitions. [2024-10-15 00:17:55,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:17:55,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:17:55,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2024-10-15 00:17:55,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:17:55,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-15 00:17:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2024-10-15 00:17:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-15 00:17:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-10-15 00:17:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-15 00:17:55,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-15 00:17:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 00:17:55,382 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-15 00:17:55,382 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:17:55,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2024-10-15 00:17:55,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:55,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:55,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:55,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:17:55,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:55,383 INFO L745 eck$LassoCheckResult]: Stem: 686#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 688#L367 assume !(main_~length~0#1 < 1); 680#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 681#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 689#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 682#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 683#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 684#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 685#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 694#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 693#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 692#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 690#L375-4 main_~j~0#1 := 1; 691#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 678#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 677#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 679#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 675#L380-2 [2024-10-15 00:17:55,383 INFO L747 eck$LassoCheckResult]: Loop: 675#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 676#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 675#L380-2 [2024-10-15 00:17:55,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash -457174268, now seen corresponding path program 2 times [2024-10-15 00:17:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067110645] [2024-10-15 00:17:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:17:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067110645] [2024-10-15 00:17:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067110645] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:17:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121132563] [2024-10-15 00:17:55,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:17:55,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:17:55,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:55,768 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:17:55,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-15 00:17:55,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:17:55,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:17:55,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-15 00:17:55,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:55,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 00:17:55,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-15 00:17:56,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:17:56,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-15 00:17:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:56,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:17:56,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-15 00:17:56,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:17:56,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 152 [2024-10-15 00:17:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121132563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:17:56,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:17:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2024-10-15 00:17:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61273452] [2024-10-15 00:17:56,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:17:56,339 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:17:56,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:56,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 6 times [2024-10-15 00:17:56,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:56,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850849885] [2024-10-15 00:17:56,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:56,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:56,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:56,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:17:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 00:17:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2024-10-15 00:17:56,416 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 6 Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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-10-15 00:17:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:17:56,686 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-10-15 00:17:56,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2024-10-15 00:17:56,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:17:56,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 44 transitions. [2024-10-15 00:17:56,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-15 00:17:56,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-15 00:17:56,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2024-10-15 00:17:56,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:17:56,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-15 00:17:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2024-10-15 00:17:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2024-10-15 00:17:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-10-15 00:17:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-15 00:17:56,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-15 00:17:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 00:17:56,696 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-15 00:17:56,696 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:17:56,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2024-10-15 00:17:56,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:56,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:56,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:56,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:17:56,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:56,698 INFO L745 eck$LassoCheckResult]: Stem: 881#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 883#L367 assume !(main_~length~0#1 < 1); 877#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 878#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 884#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 873#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 874#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 887#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 893#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 875#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 876#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 891#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 885#L375-4 main_~j~0#1 := 1; 886#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 894#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 871#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 872#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 880#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 879#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 869#L380-2 [2024-10-15 00:17:56,698 INFO L747 eck$LassoCheckResult]: Loop: 869#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 870#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 869#L380-2 [2024-10-15 00:17:56,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1257807801, now seen corresponding path program 3 times [2024-10-15 00:17:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352039152] [2024-10-15 00:17:56,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:17:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352039152] [2024-10-15 00:17:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352039152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:17:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818232262] [2024-10-15 00:17:56,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:17:56,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:17:56,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:56,802 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:17:56,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-15 00:17:56,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-15 00:17:56,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:17:56,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:17:56,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:56,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:17:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:57,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818232262] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:17:57,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:17:57,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2024-10-15 00:17:57,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124516655] [2024-10-15 00:17:57,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:17:57,004 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:17:57,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 7 times [2024-10-15 00:17:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133299240] [2024-10-15 00:17:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:57,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:17:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:17:57,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:17:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:17:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 00:17:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-15 00:17:57,085 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 9 Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-10-15 00:17:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:17:57,135 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-15 00:17:57,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2024-10-15 00:17:57,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:57,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 35 transitions. [2024-10-15 00:17:57,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:17:57,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:17:57,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2024-10-15 00:17:57,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:17:57,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-15 00:17:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2024-10-15 00:17:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-15 00:17:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-10-15 00:17:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-15 00:17:57,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-15 00:17:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 00:17:57,140 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-15 00:17:57,140 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:17:57,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2024-10-15 00:17:57,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:17:57,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:17:57,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:17:57,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:17:57,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:17:57,141 INFO L745 eck$LassoCheckResult]: Stem: 1078#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1079#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1080#L367 assume !(main_~length~0#1 < 1); 1070#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1071#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1081#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1072#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1073#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1074#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1075#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1084#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1095#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1094#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1093#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1087#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1088#L375-4 main_~j~0#1 := 1; 1085#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1086#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1068#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1069#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1077#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1076#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1066#L380-2 [2024-10-15 00:17:57,141 INFO L747 eck$LassoCheckResult]: Loop: 1066#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1067#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1066#L380-2 [2024-10-15 00:17:57,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:17:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash -948777687, now seen corresponding path program 4 times [2024-10-15 00:17:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:17:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030604950] [2024-10-15 00:17:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:17:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:17:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:17:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:57,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:17:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030604950] [2024-10-15 00:17:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030604950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:17:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911554529] [2024-10-15 00:17:57,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:17:57,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:17:57,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:17:57,619 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:17:57,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-15 00:17:57,689 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:17:57,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:17:57,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-15 00:17:57,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:17:57,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-15 00:17:57,836 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-15 00:17:57,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2024-10-15 00:17:58,280 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2024-10-15 00:17:58,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 36 [2024-10-15 00:17:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:17:58,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:18:23,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-10-15 00:18:23,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:23,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 99 [2024-10-15 00:18:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911554529] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:18:23,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:18:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2024-10-15 00:18:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827670312] [2024-10-15 00:18:23,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:18:23,408 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:18:23,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 8 times [2024-10-15 00:18:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397325924] [2024-10-15 00:18:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:23,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:23,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:23,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:18:23,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-15 00:18:23,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=828, Unknown=2, NotChecked=0, Total=992 [2024-10-15 00:18:23,492 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:36,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-15 00:18:37,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-15 00:18:41,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-15 00:18:47,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-15 00:18:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:18:47,520 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-10-15 00:18:47,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2024-10-15 00:18:47,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:18:47,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 41 states and 47 transitions. [2024-10-15 00:18:47,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-15 00:18:47,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-15 00:18:47,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2024-10-15 00:18:47,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:18:47,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-15 00:18:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2024-10-15 00:18:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-15 00:18:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 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-10-15 00:18:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-15 00:18:47,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-15 00:18:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-15 00:18:47,526 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-15 00:18:47,526 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:18:47,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2024-10-15 00:18:47,527 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-10-15 00:18:47,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:47,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:47,528 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:47,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:18:47,528 INFO L745 eck$LassoCheckResult]: Stem: 1363#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1365#L367 assume !(main_~length~0#1 < 1); 1360#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1361#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1366#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1356#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1357#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1358#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1359#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1381#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1380#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1379#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1378#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1377#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1376#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1375#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1374#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1371#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1367#L375-4 main_~j~0#1 := 1; 1368#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1387#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1386#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1362#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1351#L380-2 [2024-10-15 00:18:47,529 INFO L747 eck$LassoCheckResult]: Loop: 1351#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1352#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1351#L380-2 [2024-10-15 00:18:47,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:47,529 INFO L85 PathProgramCache]: Analyzing trace with hash -885753430, now seen corresponding path program 5 times [2024-10-15 00:18:47,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:47,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23214814] [2024-10-15 00:18:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:47,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23214814] [2024-10-15 00:18:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23214814] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:18:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217939858] [2024-10-15 00:18:48,223 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 00:18:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:18:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:48,225 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:18:48,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-10-15 00:18:48,286 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-10-15 00:18:48,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:18:48,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-15 00:18:48,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:18:48,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 00:18:48,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-15 00:18:48,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:48,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2024-10-15 00:18:48,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:48,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:48,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:48,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-15 00:18:48,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:48,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:48,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:48,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-15 00:18:48,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:48,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-15 00:18:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:48,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:18:49,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-15 00:18:49,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:49,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 88 [2024-10-15 00:18:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 00:18:49,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217939858] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:18:49,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:18:49,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 31 [2024-10-15 00:18:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134194185] [2024-10-15 00:18:49,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:18:49,175 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:18:49,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2024-10-15 00:18:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439839231] [2024-10-15 00:18:49,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:49,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:49,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:18:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-15 00:18:49,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2024-10-15 00:18:49,255 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 11 Second operand has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 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-10-15 00:18:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:18:49,567 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-10-15 00:18:49,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2024-10-15 00:18:49,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:18:49,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 31 states and 34 transitions. [2024-10-15 00:18:49,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:18:49,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:18:49,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2024-10-15 00:18:49,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:18:49,568 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-15 00:18:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2024-10-15 00:18:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-10-15 00:18:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-10-15 00:18:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-10-15 00:18:49,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-15 00:18:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 00:18:49,573 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-15 00:18:49,573 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:18:49,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2024-10-15 00:18:49,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:18:49,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:49,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:49,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:49,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:18:49,577 INFO L745 eck$LassoCheckResult]: Stem: 1616#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1618#L367 assume !(main_~length~0#1 < 1); 1608#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1609#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1619#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1610#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1611#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1612#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1613#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1632#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1631#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1630#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1629#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1628#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1627#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1626#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1625#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1624#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1623#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1622#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1620#L375-4 main_~j~0#1 := 1; 1621#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1615#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1606#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1607#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1633#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1614#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1604#L380-2 [2024-10-15 00:18:49,577 INFO L747 eck$LassoCheckResult]: Loop: 1604#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1605#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1604#L380-2 [2024-10-15 00:18:49,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash -93884209, now seen corresponding path program 6 times [2024-10-15 00:18:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394566266] [2024-10-15 00:18:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:50,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394566266] [2024-10-15 00:18:50,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394566266] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:18:50,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201052552] [2024-10-15 00:18:50,432 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 00:18:50,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:18:50,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:50,434 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:18:50,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-15 00:18:50,521 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-10-15 00:18:50,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:18:50,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-15 00:18:50,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:18:50,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 00:18:50,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-15 00:18:50,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:50,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:50,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:50,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-15 00:18:50,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:50,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:50,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:50,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-15 00:18:50,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:50,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:50,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:50,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-15 00:18:51,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:51,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-15 00:18:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:51,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:18:52,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-15 00:18:52,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:52,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 88 [2024-10-15 00:18:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 7 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:18:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201052552] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:18:52,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:18:52,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 45 [2024-10-15 00:18:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099062980] [2024-10-15 00:18:52,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:18:52,136 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:18:52,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 9 times [2024-10-15 00:18:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927713942] [2024-10-15 00:18:52,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:52,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:52,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:52,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:18:52,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-15 00:18:52,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2024-10-15 00:18:52,220 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. cyclomatic complexity: 6 Second operand has 46 states, 45 states have (on average 1.6) internal successors, (72), 46 states have internal predecessors, (72), 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-10-15 00:18:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:18:52,931 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-10-15 00:18:52,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2024-10-15 00:18:52,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:18:52,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 36 transitions. [2024-10-15 00:18:52,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:18:52,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:18:52,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2024-10-15 00:18:52,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:18:52,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-10-15 00:18:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2024-10-15 00:18:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-15 00:18:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-10-15 00:18:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-10-15 00:18:52,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-10-15 00:18:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-15 00:18:52,939 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-10-15 00:18:52,939 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:18:52,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 35 transitions. [2024-10-15 00:18:52,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:18:52,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:52,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:52,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:52,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:18:52,940 INFO L745 eck$LassoCheckResult]: Stem: 1922#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1923#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1924#L367 assume !(main_~length~0#1 < 1); 1917#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1918#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1925#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1913#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1914#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1915#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1916#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1937#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1936#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1935#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1934#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1933#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1932#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1931#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1930#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1929#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1928#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1927#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1926#L375-4 main_~j~0#1 := 1; 1909#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1910#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1940#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1921#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1911#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1912#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1938#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1919#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1920#L380-2 [2024-10-15 00:18:52,940 INFO L747 eck$LassoCheckResult]: Loop: 1920#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1939#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1920#L380-2 [2024-10-15 00:18:52,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:52,941 INFO L85 PathProgramCache]: Analyzing trace with hash -28412078, now seen corresponding path program 7 times [2024-10-15 00:18:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039770491] [2024-10-15 00:18:52,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:52,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039770491] [2024-10-15 00:18:53,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039770491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:18:53,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837842841] [2024-10-15 00:18:53,744 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-15 00:18:53,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:18:53,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:53,746 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:18:53,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-10-15 00:18:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:53,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-15 00:18:53,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:18:53,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-15 00:18:53,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-15 00:18:53,911 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-10-15 00:18:53,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 24 [2024-10-15 00:18:53,984 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-10-15 00:18:53,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 24 [2024-10-15 00:18:54,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:54,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2024-10-15 00:18:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:54,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:18:54,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-15 00:18:54,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:54,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 187 [2024-10-15 00:18:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:18:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837842841] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:18:54,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:18:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 26 [2024-10-15 00:18:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262885061] [2024-10-15 00:18:54,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:18:54,631 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:18:54,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 10 times [2024-10-15 00:18:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276172046] [2024-10-15 00:18:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:54,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:54,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:54,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:18:54,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-15 00:18:54,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-10-15 00:18:54,715 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. cyclomatic complexity: 6 Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:18:54,984 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-15 00:18:54,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2024-10-15 00:18:54,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:18:54,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2024-10-15 00:18:54,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:18:54,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:18:54,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2024-10-15 00:18:54,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:18:54,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-15 00:18:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2024-10-15 00:18:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-15 00:18:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-10-15 00:18:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-15 00:18:54,987 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-15 00:18:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-15 00:18:54,988 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-15 00:18:54,989 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:18:54,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2024-10-15 00:18:54,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:18:54,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:54,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:54,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:54,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:18:54,990 INFO L745 eck$LassoCheckResult]: Stem: 2198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2200#L367 assume !(main_~length~0#1 < 1); 2189#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2190#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2201#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2191#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2192#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2193#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2194#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2213#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2212#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2211#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2210#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2209#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2208#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2207#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2206#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2205#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2204#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2203#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2202#L375-4 main_~j~0#1 := 1; 2185#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2186#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2187#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2188#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2197#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2218#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2217#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2216#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2215#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2195#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2196#L380-2 [2024-10-15 00:18:54,990 INFO L747 eck$LassoCheckResult]: Loop: 2196#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2214#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2196#L380-2 [2024-10-15 00:18:54,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1534203627, now seen corresponding path program 8 times [2024-10-15 00:18:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2488574] [2024-10-15 00:18:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2488574] [2024-10-15 00:18:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2488574] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:18:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073120693] [2024-10-15 00:18:55,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:18:55,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:18:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:55,652 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:18:55,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-10-15 00:18:55,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:18:55,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:18:55,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-15 00:18:55,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:18:55,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 00:18:55,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-15 00:18:56,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:56,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 00:18:56,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:56,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-15 00:18:56,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:56,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-15 00:18:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:56,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:18:56,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-15 00:18:56,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:18:56,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 187 [2024-10-15 00:18:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073120693] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:18:56,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:18:56,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 39 [2024-10-15 00:18:56,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99017174] [2024-10-15 00:18:56,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:18:56,874 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:18:56,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 11 times [2024-10-15 00:18:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203674046] [2024-10-15 00:18:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:56,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:56,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:18:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-15 00:18:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2024-10-15 00:18:56,952 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. cyclomatic complexity: 6 Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 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-10-15 00:18:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:18:57,407 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-10-15 00:18:57,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 41 transitions. [2024-10-15 00:18:57,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:18:57,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 40 transitions. [2024-10-15 00:18:57,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:18:57,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:18:57,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 40 transitions. [2024-10-15 00:18:57,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:18:57,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-10-15 00:18:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 40 transitions. [2024-10-15 00:18:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-15 00:18:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-10-15 00:18:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-10-15 00:18:57,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-15 00:18:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-15 00:18:57,412 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-15 00:18:57,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-15 00:18:57,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2024-10-15 00:18:57,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:18:57,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:57,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:57,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:57,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:18:57,418 INFO L745 eck$LassoCheckResult]: Stem: 2503#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2505#L367 assume !(main_~length~0#1 < 1); 2494#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2495#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2506#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2496#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2497#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2498#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2499#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2518#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2517#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2516#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2515#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2514#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2513#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2512#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2511#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2510#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2509#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2508#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2507#L375-4 main_~j~0#1 := 1; 2490#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2491#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2492#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2493#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2502#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2525#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2524#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2523#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2522#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2521#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2520#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2500#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2501#L380-2 [2024-10-15 00:18:57,418 INFO L747 eck$LassoCheckResult]: Loop: 2501#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2519#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2501#L380-2 [2024-10-15 00:18:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1195903464, now seen corresponding path program 9 times [2024-10-15 00:18:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524840815] [2024-10-15 00:18:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:58,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524840815] [2024-10-15 00:18:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524840815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:18:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513889236] [2024-10-15 00:18:58,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:18:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:18:58,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:58,296 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:18:58,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-10-15 00:18:58,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-15 00:18:58,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:18:58,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 00:18:58,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:18:58,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-15 00:18:58,695 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-15 00:18:58,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2024-10-15 00:18:59,503 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2024-10-15 00:18:59,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 36 [2024-10-15 00:18:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 25 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:59,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:13,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-10-15 00:19:13,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:19:13,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 208 [2024-10-15 00:19:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:13,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513889236] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:13,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:13,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 50 [2024-10-15 00:19:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579643007] [2024-10-15 00:19:13,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:13,483 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:13,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 12 times [2024-10-15 00:19:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:13,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661201977] [2024-10-15 00:19:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:13,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:13,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:13,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-15 00:19:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2230, Unknown=1, NotChecked=0, Total=2550 [2024-10-15 00:19:13,556 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. cyclomatic complexity: 6 Second operand has 51 states, 50 states have (on average 1.62) internal successors, (81), 51 states have internal predecessors, (81), 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)