./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 32bit --witnessprinter.graph.data.programhash de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:40:54,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:40:54,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:40:54,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:40:54,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:40:54,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:40:54,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:40:54,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:40:54,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:40:54,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:40:54,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:40:54,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:40:54,276 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:40:54,277 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:40:54,278 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:40:54,279 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:40:54,279 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:40:54,279 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:40:54,280 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:40:54,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:40:54,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:40:54,285 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:40:54,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:40:54,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:40:54,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:40:54,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:40:54,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:40:54,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:40:54,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:40:54,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:40:54,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:40:54,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:40:54,287 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:40:54,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:40:54,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:40:54,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:40:54,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:40:54,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:40:54,289 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:40:54,290 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-clean/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-clean/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 [2024-10-12 00:40:54,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:40:54,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:40:54,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:40:54,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:40:54,627 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:40:54,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c [2024-10-12 00:40:56,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:40:56,286 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:40:56,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c [2024-10-12 00:40:56,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/87b5315ba/6f6d04314a134b93b726936660152806/FLAG998563449 [2024-10-12 00:40:56,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/87b5315ba/6f6d04314a134b93b726936660152806 [2024-10-12 00:40:56,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:40:56,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:40:56,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:40:56,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:40:56,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:40:56,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:56,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a85695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56, skipping insertion in model container [2024-10-12 00:40:56,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:56,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:40:56,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:40:56,925 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:40:56,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:40:56,969 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:40:56,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56 WrapperNode [2024-10-12 00:40:56,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:40:56,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:40:56,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:40:56,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:40:56,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:56,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,012 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2024-10-12 00:40:57,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:40:57,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:40:57,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:40:57,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:40:57,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,061 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 4, 6]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-10-12 00:40:57,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:40:57,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:40:57,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:40:57,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:40:57,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (1/1) ... [2024-10-12 00:40:57,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:57,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:57,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:57,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:40:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 00:40:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 00:40:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 00:40:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:40:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:40:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:40:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 00:40:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 00:40:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 00:40:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 00:40:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:40:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:40:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:40:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:40:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:40:57,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:40:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:40:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:40:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:40:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:40:57,315 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:40:57,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:40:57,625 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-12 00:40:57,625 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:40:57,639 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:40:57,639 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:40:57,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:40:57 BoogieIcfgContainer [2024-10-12 00:40:57,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:40:57,640 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:40:57,641 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:40:57,644 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:40:57,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:40:57,644 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:40:56" (1/3) ... [2024-10-12 00:40:57,645 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@302b5ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:40:57, skipping insertion in model container [2024-10-12 00:40:57,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:40:57,645 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:56" (2/3) ... [2024-10-12 00:40:57,646 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@302b5ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:40:57, skipping insertion in model container [2024-10-12 00:40:57,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:40:57,646 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:40:57" (3/3) ... [2024-10-12 00:40:57,647 INFO L332 chiAutomizerObserver]: Analyzing ICFG test25-1.c [2024-10-12 00:40:57,698 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:40:57,698 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:40:57,699 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:40:57,699 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:40:57,699 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:40:57,699 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:40:57,699 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:40:57,699 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:40:57,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-12 00:40:57,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:40:57,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:40:57,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:40:57,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:40:57,730 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:40:57,730 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:40:57,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-12 00:40:57,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:40:57,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:40:57,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:40:57,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:40:57,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:40:57,738 INFO L745 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 17#L26-3true [2024-10-12 00:40:57,738 INFO L747 eck$LassoCheckResult]: Loop: 17#L26-3true assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 11#L26-2true main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17#L26-3true [2024-10-12 00:40:57,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:40:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:40:57,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946089406] [2024-10-12 00:40:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:40:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:40:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:57,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:40:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:57,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:40:57,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:57,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-12 00:40:57,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:40:57,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756357078] [2024-10-12 00:40:57,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:40:57,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:40:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:57,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:40:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:57,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:40:57,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:57,976 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-12 00:40:57,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:40:57,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384728297] [2024-10-12 00:40:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:40:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:40:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:58,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:40:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:58,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:40:58,790 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:40:58,794 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:40:58,795 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:40:58,795 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:40:58,795 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:40:58,795 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:58,795 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:40:58,795 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:40:58,795 INFO L132 ssoRankerPreferences]: Filename of dumped script: test25-1.c_Iteration1_Lasso [2024-10-12 00:40:58,796 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:40:58,796 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:40:58,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:58,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:58,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:58,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:58,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:58,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:58,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:59,565 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:40:59,569 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:40:59,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:40:59,576 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-12 00:40:59,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:40:59,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:40:59,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:40:59,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:40:59,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:40:59,620 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-12 00:40:59,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:40:59,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:40:59,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:40:59,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:40:59,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:40:59,670 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-12 00:40:59,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:40:59,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:40:59,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:40:59,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:40:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:40:59,715 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-12 00:40:59,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:40:59,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:40:59,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:40:59,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:40:59,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:40:59,753 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-12 00:40:59,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:40:59,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:40:59,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:40:59,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:40:59,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:40:59,787 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-12 00:40:59,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:40:59,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:40:59,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:40:59,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:40:59,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:40:59,824 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-12 00:40:59,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:40:59,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:40:59,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:40:59,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:40:59,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,860 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:40:59,863 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-12 00:40:59,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:40:59,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:40:59,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:40:59,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,902 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:40:59,905 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-12 00:40:59,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:40:59,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:40:59,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:40:59,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:40:59,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:59,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:59,948 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:59,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:40:59,952 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-12 00:40:59,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:59,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:59,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:59,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:59,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:40:59,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:40:59,982 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:41:00,017 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-12 00:41:00,017 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:41:00,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:00,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:00,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:41:00,024 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:41:00,039 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:41:00,039 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:41:00,040 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#array~0#1.base)_1) = -16*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#array~0#1.base)_1 Supporting invariants [] [2024-10-12 00:41:00,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:00,093 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-10-12 00:41:00,104 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:41:00,105 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:41:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:00,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:41:00,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:00,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:41:00,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:00,212 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-12 00:41:00,245 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-12 00:41:00,247 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:00,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 47 transitions. Complement of second has 6 states. [2024-10-12 00:41:00,293 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-12 00:41:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-10-12 00:41:00,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-12 00:41:00,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:41:00,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:41:00,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:41:00,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:41:00,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:41:00,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2024-10-12 00:41:00,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:41:00,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 10 states and 12 transitions. [2024-10-12 00:41:00,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-12 00:41:00,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:41:00,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2024-10-12 00:41:00,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:00,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-12 00:41:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2024-10-12 00:41:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-12 00:41:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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-12 00:41:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-10-12 00:41:00,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-12 00:41:00,331 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-12 00:41:00,331 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:41:00,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-10-12 00:41:00,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:41:00,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:00,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:00,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:41:00,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:41:00,333 INFO L745 eck$LassoCheckResult]: Stem: 134#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 137#L26-3 assume !(main_~j~0#1 < 10); 132#L26-4 havoc main_~j~0#1; 133#L31 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#1(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); 128#L34 assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#2(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1; 129#L36-3 [2024-10-12 00:41:00,333 INFO L747 eck$LassoCheckResult]: Loop: 129#L36-3 call main_#t~mem14#1 := read~int#2(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 136#L36-1 assume !!(main_~i~0#1 < main_#t~mem14#1);havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1; 129#L36-3 [2024-10-12 00:41:00,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:00,334 INFO L85 PathProgramCache]: Analyzing trace with hash 889605038, now seen corresponding path program 1 times [2024-10-12 00:41:00,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:00,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856675643] [2024-10-12 00:41:00,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:00,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:00,424 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-12 00:41:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856675643] [2024-10-12 00:41:00,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856675643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:00,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:00,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:41:00,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623432511] [2024-10-12 00:41:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:00,430 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:41:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 1 times [2024-10-12 00:41:00,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:00,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106463549] [2024-10-12 00:41:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:00,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:00,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:00,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:41:00,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:41:00,498 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 00:41:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:00,512 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2024-10-12 00:41:00,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2024-10-12 00:41:00,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:41:00,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2024-10-12 00:41:00,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:41:00,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:41:00,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2024-10-12 00:41:00,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:00,513 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-10-12 00:41:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2024-10-12 00:41:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-10-12 00:41:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 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-12 00:41:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-10-12 00:41:00,515 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-12 00:41:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:41:00,516 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-12 00:41:00,516 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:41:00,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2024-10-12 00:41:00,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:41:00,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:00,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:00,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:00,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:41:00,517 INFO L745 eck$LassoCheckResult]: Stem: 161#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 164#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 157#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 158#L26-3 assume !(main_~j~0#1 < 10); 159#L26-4 havoc main_~j~0#1; 160#L31 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#1(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); 155#L34 assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#2(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1; 156#L36-3 [2024-10-12 00:41:00,517 INFO L747 eck$LassoCheckResult]: Loop: 156#L36-3 call main_#t~mem14#1 := read~int#2(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 163#L36-1 assume !!(main_~i~0#1 < main_#t~mem14#1);havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1; 156#L36-3 [2024-10-12 00:41:00,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash 265180976, now seen corresponding path program 1 times [2024-10-12 00:41:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:00,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101754432] [2024-10-12 00:41:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:00,640 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-12 00:41:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101754432] [2024-10-12 00:41:00,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101754432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:41:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586829683] [2024-10-12 00:41:00,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:00,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:41:00,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:00,643 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:41:00,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-12 00:41:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:00,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:41:00,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:00,741 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-12 00:41:00,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:41:00,765 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-12 00:41:00,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586829683] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:41:00,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:41:00,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:41:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890132045] [2024-10-12 00:41:00,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:41:00,767 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:41:00,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:00,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 2 times [2024-10-12 00:41:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:00,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761813434] [2024-10-12 00:41:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:00,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:00,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:00,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:00,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:41:00,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:41:00,823 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:00,862 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2024-10-12 00:41:00,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2024-10-12 00:41:00,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:41:00,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2024-10-12 00:41:00,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:41:00,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:41:00,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2024-10-12 00:41:00,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:00,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-10-12 00:41:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2024-10-12 00:41:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-12 00:41:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 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-12 00:41:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-10-12 00:41:00,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-10-12 00:41:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:41:00,867 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-10-12 00:41:00,867 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:41:00,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2024-10-12 00:41:00,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:41:00,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:00,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:00,868 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:00,868 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:41:00,868 INFO L745 eck$LassoCheckResult]: Stem: 239#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 242#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 243#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 244#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 235#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 236#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 248#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 247#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 246#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 245#L26-3 assume !(main_~j~0#1 < 10); 237#L26-4 havoc main_~j~0#1; 238#L31 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#1(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); 233#L34 assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#2(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1; 234#L36-3 [2024-10-12 00:41:00,869 INFO L747 eck$LassoCheckResult]: Loop: 234#L36-3 call main_#t~mem14#1 := read~int#2(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 241#L36-1 assume !!(main_~i~0#1 < main_#t~mem14#1);havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1; 234#L36-3 [2024-10-12 00:41:00,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:00,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754442, now seen corresponding path program 2 times [2024-10-12 00:41:00,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:00,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887304583] [2024-10-12 00:41:00,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:00,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:41:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:01,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887304583] [2024-10-12 00:41:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887304583] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:41:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174096472] [2024-10-12 00:41:01,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:41:01,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:41:01,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:01,099 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:41:01,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-12 00:41:01,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:41:01,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:41:01,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:41:01,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:01,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:41:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174096472] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:41:01,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:41:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:41:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342237434] [2024-10-12 00:41:01,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:41:01,313 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:41:01,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 3 times [2024-10-12 00:41:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:01,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182643146] [2024-10-12 00:41:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:01,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:01,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:01,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:41:01,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:41:01,359 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:01,419 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-12 00:41:01,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2024-10-12 00:41:01,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:41:01,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2024-10-12 00:41:01,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:41:01,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:41:01,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2024-10-12 00:41:01,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:01,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-12 00:41:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2024-10-12 00:41:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 00:41:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 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-12 00:41:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-12 00:41:01,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-12 00:41:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:41:01,427 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-12 00:41:01,427 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:41:01,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2024-10-12 00:41:01,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:41:01,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:01,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:01,429 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:01,429 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:41:01,429 INFO L745 eck$LassoCheckResult]: Stem: 377#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 380#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 381#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 382#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 373#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 374#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 398#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 397#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 396#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 395#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 394#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 393#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 392#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 391#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 390#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 389#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 388#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 387#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 386#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 385#L26-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1; 384#L26-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 383#L26-3 assume !(main_~j~0#1 < 10); 375#L26-4 havoc main_~j~0#1; 376#L31 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#1(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); 371#L34 assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#2(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1; 372#L36-3 [2024-10-12 00:41:01,429 INFO L747 eck$LassoCheckResult]: Loop: 372#L36-3 call main_#t~mem14#1 := read~int#2(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 379#L36-1 assume !!(main_~i~0#1 < main_#t~mem14#1);havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1; 372#L36-3 [2024-10-12 00:41:01,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -95702974, now seen corresponding path program 3 times [2024-10-12 00:41:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238416681] [2024-10-12 00:41:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:01,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:01,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 4 times [2024-10-12 00:41:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661559291] [2024-10-12 00:41:01,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:01,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:01,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:01,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1776243929, now seen corresponding path program 1 times [2024-10-12 00:41:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:01,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335145973] [2024-10-12 00:41:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:01,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:01,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace