./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/fermat-alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:19:05,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:19:05,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:19:05,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:19:05,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:19:05,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:19:05,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:19:05,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:19:05,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:19:05,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:19:05,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:19:05,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:19:05,999 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:19:05,999 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:19:05,999 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:19:06,001 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:19:06,001 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:19:06,002 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:19:06,002 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:19:06,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:19:06,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:19:06,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:19:06,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:19:06,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:19:06,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:19:06,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:19:06,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:19:06,008 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:19:06,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:19:06,009 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:19:06,009 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:19:06,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:19:06,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:19:06,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:19:06,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:19:06,014 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:19:06,014 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c [2024-10-12 00:19:06,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:19:06,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:19:06,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:19:06,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:19:06,313 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:19:06,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-10-12 00:19:07,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:19:08,152 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:19:08,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-10-12 00:19:08,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4297c6cd2/8785fcbfa769426784fd14345313483d/FLAG933333ebd [2024-10-12 00:19:08,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4297c6cd2/8785fcbfa769426784fd14345313483d [2024-10-12 00:19:08,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:19:08,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:19:08,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:19:08,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:19:08,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:19:08,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:08,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a4f7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08, skipping insertion in model container [2024-10-12 00:19:08,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:08,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:19:08,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:19:08,886 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:19:08,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:19:08,967 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:19:08,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08 WrapperNode [2024-10-12 00:19:08,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:19:08,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:19:08,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:19:08,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:19:08,976 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:19:08" (1/1) ... [2024-10-12 00:19:08,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:19:08" (1/1) ... [2024-10-12 00:19:09,008 INFO L138 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2024-10-12 00:19:09,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:19:09,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:19:09,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:19:09,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:19:09,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,049 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [7, 8, 8, 4]. 30 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 9 writes are split as follows [2, 3, 3, 1]. [2024-10-12 00:19:09,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:19:09,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:19:09,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:19:09,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:19:09,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (1/1) ... [2024-10-12 00:19:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:09,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:09,111 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:19:09,115 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:19:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:19:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:19:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:19:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 00:19:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:19:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:19:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:19:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 00:19:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:19:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:19:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:19:09,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:19:09,273 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:19:09,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:19:09,451 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-12 00:19:09,452 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:19:09,463 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:19:09,464 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:19:09,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:19:09 BoogieIcfgContainer [2024-10-12 00:19:09,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:19:09,467 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:19:09,467 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:19:09,471 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:19:09,472 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:09,473 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:19:08" (1/3) ... [2024-10-12 00:19:09,474 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4be2ffda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:19:09, skipping insertion in model container [2024-10-12 00:19:09,474 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:09,474 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:08" (2/3) ... [2024-10-12 00:19:09,474 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4be2ffda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:19:09, skipping insertion in model container [2024-10-12 00:19:09,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:09,475 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:19:09" (3/3) ... [2024-10-12 00:19:09,476 INFO L332 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2024-10-12 00:19:09,521 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:19:09,521 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:19:09,521 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:19:09,521 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:19:09,521 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:19:09,522 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:19:09,522 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:19:09,522 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:19:09,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:09,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:19:09,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:09,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:09,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:19:09,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:09,555 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:19:09,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:09,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:19:09,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:09,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:09,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:19:09,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:09,566 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 6#L556-2true [2024-10-12 00:19:09,567 INFO L747 eck$LassoCheckResult]: Loop: 6#L556-2true assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 13#L557true assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 5#L561true assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 7#L561-2true call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4#L565true assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 10#L565-2true call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3#L569true assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 6#L556-2true [2024-10-12 00:19:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:19:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:09,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627162437] [2024-10-12 00:19:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:09,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:09,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:09,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:09,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash -903226603, now seen corresponding path program 1 times [2024-10-12 00:19:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:09,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984707443] [2024-10-12 00:19:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:09,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:19:09,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046307668] [2024-10-12 00:19:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:09,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:09,953 INFO L229 MonitoredProcess]: Starting monitored process 2 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:19:09,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 00:19:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:10,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:10,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:10,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash 643070227, now seen corresponding path program 1 times [2024-10-12 00:19:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192955875] [2024-10-12 00:19:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:10,896 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:19:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192955875] [2024-10-12 00:19:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192955875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:19:10,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:19:10,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:19:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424438053] [2024-10-12 00:19:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:19:25,774 WARN L286 SmtUtils]: Spent 14.86s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:19:38,518 WARN L286 SmtUtils]: Spent 12.36s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 298] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:19:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:19:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:19:38,556 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:38,611 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2024-10-12 00:19:38,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2024-10-12 00:19:38,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:19:38,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 14 transitions. [2024-10-12 00:19:38,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:19:38,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:19:38,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2024-10-12 00:19:38,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:38,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-12 00:19:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2024-10-12 00:19:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 00:19:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-10-12 00:19:38,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-12 00:19:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:19:38,651 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-12 00:19:38,652 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:19:38,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2024-10-12 00:19:38,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:19:38,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:38,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:38,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:19:38,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:38,655 INFO L745 eck$LassoCheckResult]: Stem: 50#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 48#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 49#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 46#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 47#L561-2 [2024-10-12 00:19:38,655 INFO L747 eck$LassoCheckResult]: Loop: 47#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 44#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 45#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 42#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 43#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 53#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 52#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 47#L561-2 [2024-10-12 00:19:38,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:38,657 INFO L85 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 1 times [2024-10-12 00:19:38,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221182020] [2024-10-12 00:19:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:19:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507800556] [2024-10-12 00:19:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:38,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:38,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:38,735 INFO L229 MonitoredProcess]: Starting monitored process 3 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:19:38,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 00:19:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:38,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:38,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:38,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 2 times [2024-10-12 00:19:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:38,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460274656] [2024-10-12 00:19:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:19:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340517305] [2024-10-12 00:19:38,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:19:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:38,874 INFO L229 MonitoredProcess]: Starting monitored process 4 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:19:38,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 00:19:38,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 00:19:38,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:19:38,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:39,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1341656857, now seen corresponding path program 1 times [2024-10-12 00:19:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:39,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95616551] [2024-10-12 00:19:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:39,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:39,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95616551] [2024-10-12 00:19:39,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95616551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:19:39,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:19:39,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:19:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143215832] [2024-10-12 00:19:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:19:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:19:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:19:40,573 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:19:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:40,667 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-10-12 00:19:40,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-10-12 00:19:40,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:19:40,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2024-10-12 00:19:40,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:19:40,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:19:40,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-10-12 00:19:40,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:40,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-12 00:19:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-10-12 00:19:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-12 00:19:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-12 00:19:40,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-12 00:19:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:19:40,674 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-12 00:19:40,674 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:19:40,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-10-12 00:19:40,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:19:40,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:40,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:40,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:19:40,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:40,676 INFO L745 eck$LassoCheckResult]: Stem: 92#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 93#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 96#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 100#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 89#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 90#L561-2 [2024-10-12 00:19:40,676 INFO L747 eck$LassoCheckResult]: Loop: 90#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 87#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 88#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 103#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 102#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 101#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 97#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 90#L561-2 [2024-10-12 00:19:40,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 2 times [2024-10-12 00:19:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590499346] [2024-10-12 00:19:40,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:19:40,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621604421] [2024-10-12 00:19:40,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:19:40,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:40,712 INFO L229 MonitoredProcess]: Starting monitored process 5 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:19:40,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 00:19:40,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 00:19:40,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:19:40,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:40,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1510934149, now seen corresponding path program 1 times [2024-10-12 00:19:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973694098] [2024-10-12 00:19:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:19:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415208761] [2024-10-12 00:19:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:40,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:40,871 INFO L229 MonitoredProcess]: Starting monitored process 6 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:19:40,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 00:19:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:40,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1398915161, now seen corresponding path program 1 times [2024-10-12 00:19:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:40,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175317424] [2024-10-12 00:19:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:40,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:19:41,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998779370] [2024-10-12 00:19:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:41,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:41,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:41,007 INFO L229 MonitoredProcess]: Starting monitored process 7 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:19:41,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 00:19:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:41,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:41,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:53,902 WARN L286 SmtUtils]: Spent 12.19s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 298] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:19:55,432 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:55,432 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:55,433 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:55,433 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:55,433 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:19:55,433 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:55,433 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:55,433 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:55,433 INFO L132 ssoRankerPreferences]: Filename of dumped script: fermat-alloca.i_Iteration3_Lasso [2024-10-12 00:19:55,433 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:55,434 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:55,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:55,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:08,980 WARN L286 SmtUtils]: Spent 12.50s on a formula simplification. DAG size of input: 91 DAG size of output: 86 (called from [L 270] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2024-10-12 00:20:08,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:08,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:08,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:08,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:08,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:08,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:09,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:09,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:09,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:09,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:09,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:21,368 WARN L286 SmtUtils]: Spent 12.18s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2024-10-12 00:20:22,131 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:20:22,136 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:20:22,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,141 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:20:22,142 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:20:22,144 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:20:22,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,185 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:20:22,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,189 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:20:22,190 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:20:22,190 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:20:22,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:20:22,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,218 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:20:22,219 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:20:22,220 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:20:22,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,254 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:20:22,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,257 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:20:22,259 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:20:22,260 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:20:22,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:20:22,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,304 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:20:22,305 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:20:22,306 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:20:22,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,339 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:20:22,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,342 INFO L229 MonitoredProcess]: Starting monitored process 13 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:20:22,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:20:22,345 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:20:22,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:20:22,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,388 INFO L229 MonitoredProcess]: Starting monitored process 14 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:20:22,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:20:22,391 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:20:22,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,434 INFO L229 MonitoredProcess]: Starting monitored process 15 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:20:22,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:20:22,438 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:20:22,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:22,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,479 INFO L229 MonitoredProcess]: Starting monitored process 16 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:20:22,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:20:22,484 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:20:22,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:20:22,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,527 INFO L229 MonitoredProcess]: Starting monitored process 17 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:20:22,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:20:22,532 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:20:22,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:20:22,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,569 INFO L229 MonitoredProcess]: Starting monitored process 18 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:20:22,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:20:22,573 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:20:22,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:22,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:22,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:20:22,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,617 INFO L229 MonitoredProcess]: Starting monitored process 19 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:20:22,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:20:22,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:20:22,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:20:22,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,657 INFO L229 MonitoredProcess]: Starting monitored process 20 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:20:22,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:20:22,661 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:20:22,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:20:22,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,698 INFO L229 MonitoredProcess]: Starting monitored process 21 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:20:22,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:20:22,701 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:20:22,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:22,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:22,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:22,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:22,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,736 INFO L229 MonitoredProcess]: Starting monitored process 22 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:20:22,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:20:22,737 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:20:22,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:22,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:22,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,775 INFO L229 MonitoredProcess]: Starting monitored process 23 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:20:22,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:20:22,779 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:20:22,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:22,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:22,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:22,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,835 INFO L229 MonitoredProcess]: Starting monitored process 24 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:20:22,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:20:22,838 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:20:22,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:22,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:22,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:22,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:22,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:22,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:22,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:22,882 INFO L229 MonitoredProcess]: Starting monitored process 25 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:20:22,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:20:22,885 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:20:22,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:22,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:22,895 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:20:22,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:22,919 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:20:22,920 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:20:22,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:20:23,354 INFO L443 ModelExtractionUtils]: Simplification made 52 calls to the SMT solver. [2024-10-12 00:20:23,354 INFO L444 ModelExtractionUtils]: 3 out of 46 variables were initially zero. Simplification set additionally 40 variables to zero. [2024-10-12 00:20:23,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:23,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:23,359 INFO L229 MonitoredProcess]: Starting monitored process 26 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:20:23,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:20:23,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:20:23,403 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-10-12 00:20:23,403 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:20:23,404 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~a~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#3 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~a~0#1.base) 0)_1 Supporting invariants [] [2024-10-12 00:20:23,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:23,691 INFO L156 tatePredicateManager]: 39 out of 40 supporting invariants were superfluous and have been removed [2024-10-12 00:20:23,704 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:20:23,705 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:20:23,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2024-10-12 00:20:23,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-12 00:20:23,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-12 00:20:23,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~MAX~0!base,]]] [2024-10-12 00:20:23,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:23,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:20:23,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:23,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:20:23,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:24,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-12 00:20:24,185 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:20:24,189 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:20:24,191 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:20:24,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 30 transitions. Complement of second has 8 states. [2024-10-12 00:20:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:20:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:20:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2024-10-12 00:20:24,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 7 letters. [2024-10-12 00:20:24,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:24,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 12 letters. Loop has 7 letters. [2024-10-12 00:20:24,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:24,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 14 letters. [2024-10-12 00:20:24,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:24,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2024-10-12 00:20:24,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:20:24,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2024-10-12 00:20:24,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-12 00:20:24,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:20:24,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2024-10-12 00:20:24,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:20:24,423 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-12 00:20:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2024-10-12 00:20:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-12 00:20:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-12 00:20:24,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-12 00:20:24,425 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-12 00:20:24,425 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:20:24,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2024-10-12 00:20:24,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:20:24,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:24,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:24,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:24,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:24,427 INFO L745 eck$LassoCheckResult]: Stem: 370#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 373#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 377#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 375#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 374#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 360#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 361#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 356#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 357#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 368#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 364#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 365#L561-2 [2024-10-12 00:20:24,427 INFO L747 eck$LassoCheckResult]: Loop: 365#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 372#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 381#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 380#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 379#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 378#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 376#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 365#L561-2 [2024-10-12 00:20:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1398915159, now seen corresponding path program 1 times [2024-10-12 00:20:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:24,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957537062] [2024-10-12 00:20:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:24,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957537062] [2024-10-12 00:20:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957537062] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402807367] [2024-10-12 00:20:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:24,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:24,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:24,883 INFO L229 MonitoredProcess]: Starting monitored process 27 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:20:24,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-12 00:20:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:24,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:20:24,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:24,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:20:24,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 00:20:25,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:25,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:20:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:25,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:25,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402807367] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:25,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:25,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-10-12 00:20:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089681803] [2024-10-12 00:20:25,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:25,253 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:20:25,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 3 times [2024-10-12 00:20:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106848941] [2024-10-12 00:20:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:20:25,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059242855] [2024-10-12 00:20:25,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:20:25,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:25,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:25,267 INFO L229 MonitoredProcess]: Starting monitored process 28 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:20:25,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-12 00:20:25,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-12 00:20:25,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:20:25,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:25,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:26,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:20:26,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:20:26,666 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. cyclomatic complexity: 6 Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:26,887 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-10-12 00:20:26,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 67 transitions. [2024-10-12 00:20:26,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:20:26,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 46 states and 49 transitions. [2024-10-12 00:20:26,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:20:26,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:20:26,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 49 transitions. [2024-10-12 00:20:26,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:20:26,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-10-12 00:20:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 49 transitions. [2024-10-12 00:20:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-10-12 00:20:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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:20:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-10-12 00:20:26,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-12 00:20:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:20:26,895 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-12 00:20:26,896 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:20:26,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 43 transitions. [2024-10-12 00:20:26,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:20:26,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:26,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:26,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2024-10-12 00:20:26,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:26,898 INFO L745 eck$LassoCheckResult]: Stem: 549#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 550#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 553#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 557#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 540#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 541#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 551#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 565#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 564#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 563#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 548#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 542#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 543#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 566#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 571#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 570#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 569#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 568#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 567#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 552#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 538#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 539#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 534#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 535#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 546#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 562#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 561#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 560#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 559#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 532#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 533#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 545#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 547#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 554#L561-2 [2024-10-12 00:20:26,899 INFO L747 eck$LassoCheckResult]: Loop: 554#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 536#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 537#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 544#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 558#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 556#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 555#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 554#L561-2 [2024-10-12 00:20:26,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1830413909, now seen corresponding path program 2 times [2024-10-12 00:20:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:26,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089708133] [2024-10-12 00:20:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:26,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:28,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089708133] [2024-10-12 00:20:28,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089708133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:28,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952123800] [2024-10-12 00:20:28,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:20:28,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:28,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:28,082 INFO L229 MonitoredProcess]: Starting monitored process 29 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:20:28,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-12 00:20:28,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:20:28,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:20:28,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:20:28,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:28,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:20:28,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 00:20:28,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:28,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:28,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:28,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:28,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:20:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:28,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952123800] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:29,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2024-10-12 00:20:29,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277532813] [2024-10-12 00:20:29,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:29,211 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:20:29,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 4 times [2024-10-12 00:20:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097532387] [2024-10-12 00:20:29,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:29,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:20:29,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258195833] [2024-10-12 00:20:29,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:20:29,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:29,227 INFO L229 MonitoredProcess]: Starting monitored process 30 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:20:29,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-12 00:20:29,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:20:29,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:20:29,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:29,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 00:20:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-10-12 00:20:30,642 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. cyclomatic complexity: 5 Second operand has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:31,481 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2024-10-12 00:20:31,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 127 transitions. [2024-10-12 00:20:31,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:20:31,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 88 states and 91 transitions. [2024-10-12 00:20:31,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:20:31,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:20:31,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 91 transitions. [2024-10-12 00:20:31,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:20:31,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-10-12 00:20:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 91 transitions. [2024-10-12 00:20:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2024-10-12 00:20:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 81 states have internal predecessors, (85), 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:20:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-10-12 00:20:31,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-10-12 00:20:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 00:20:31,494 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-10-12 00:20:31,495 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:20:31,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 85 transitions. [2024-10-12 00:20:31,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:20:31,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:31,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:31,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1] [2024-10-12 00:20:31,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:31,498 INFO L745 eck$LassoCheckResult]: Stem: 958#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 959#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 961#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 965#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 949#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 950#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 960#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1022#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1021#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1020#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 1019#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 951#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 952#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 947#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 948#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 943#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 944#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 955#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 957#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1018#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1017#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1016#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1015#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1014#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 1013#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1012#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1011#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1010#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1009#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1008#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1007#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 1006#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1005#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1004#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1003#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1002#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1001#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1000#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 999#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 998#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 997#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 996#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 995#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 994#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 993#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 992#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 991#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 990#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 989#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 988#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 987#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 986#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 985#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 984#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 983#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 982#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 981#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 980#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 979#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 978#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 977#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 976#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 970#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 975#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 974#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 973#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 972#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 971#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 969#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 968#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 967#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 941#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 942#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 954#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 956#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 962#L561-2 [2024-10-12 00:20:31,499 INFO L747 eck$LassoCheckResult]: Loop: 962#L561-2 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 945#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 946#L565-2 call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 953#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 966#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4); 964#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 963#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 962#L561-2 [2024-10-12 00:20:31,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:31,499 INFO L85 PathProgramCache]: Analyzing trace with hash 589434155, now seen corresponding path program 3 times [2024-10-12 00:20:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167459801] [2024-10-12 00:20:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:34,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167459801] [2024-10-12 00:20:34,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167459801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:34,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095197312] [2024-10-12 00:20:34,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:20:34,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:34,477 INFO L229 MonitoredProcess]: Starting monitored process 31 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:20:34,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-12 00:20:35,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-12 00:20:35,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:20:35,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 00:20:35,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:35,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 00:20:35,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:20:35,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:35,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:35,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:36,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:36,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:36,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:36,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:36,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:36,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:36,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:20:36,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:20:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:36,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095197312] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:38,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 47 [2024-10-12 00:20:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640430996] [2024-10-12 00:20:38,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:38,378 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:20:38,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 5 times [2024-10-12 00:20:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:38,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695417508] [2024-10-12 00:20:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:20:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46053714] [2024-10-12 00:20:38,389 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:20:38,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,392 INFO L229 MonitoredProcess]: Starting monitored process 32 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:20:38,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-12 00:20:38,491 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 00:20:38,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:20:38,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:38,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:41,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-12 00:20:41,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=1597, Unknown=0, NotChecked=0, Total=2256 [2024-10-12 00:20:41,092 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. cyclomatic complexity: 5 Second operand has 48 states, 47 states have (on average 4.74468085106383) internal successors, (223), 48 states have internal predecessors, (223), 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)