./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:29:29,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:29:29,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:29:29,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:29:29,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:29:29,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:29:29,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:29:29,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:29:29,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:29:29,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:29:29,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:29:29,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:29:29,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:29:29,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:29:29,659 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:29:29,659 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:29:29,659 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:29:29,660 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:29:29,660 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:29:29,665 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:29:29,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:29:29,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:29:29,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:29:29,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:29:29,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:29:29,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:29:29,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:29:29,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:29:29,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:29:29,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:29:29,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:29:29,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:29:29,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:29:29,669 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:29:29,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:29:29,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:29:29,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:29:29,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:29:29,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:29:29,670 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:29:29,670 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2024-11-17 08:29:29,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:29:29,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:29:29,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:29:29,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:29:29,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:29:29,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2024-11-17 08:29:31,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:29:31,233 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:29:31,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2024-11-17 08:29:31,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c7aa9e3/9821e55b155542629b227f05cefbeb4c/FLAG4249d5d67 [2024-11-17 08:29:31,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c7aa9e3/9821e55b155542629b227f05cefbeb4c [2024-11-17 08:29:31,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:29:31,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:29:31,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:29:31,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:29:31,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:29:31,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469b72bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31, skipping insertion in model container [2024-11-17 08:29:31,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:29:31,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:29:31,914 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:29:31,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:29:31,975 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:29:31,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31 WrapperNode [2024-11-17 08:29:31,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:29:31,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:29:31,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:29:31,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:29:31,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,009 INFO L138 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2024-11-17 08:29:32,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:29:32,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:29:32,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:29:32,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:29:32,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,038 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 14 writes are split as follows [0, 14]. [2024-11-17 08:29:32,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:29:32,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:29:32,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:29:32,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:29:32,055 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:32,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:29:32,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:29:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:29:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:29:32,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:29:32,201 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:29:32,203 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:29:32,412 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-17 08:29:32,413 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:29:32,426 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:29:32,426 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:29:32,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:32 BoogieIcfgContainer [2024-11-17 08:29:32,427 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:29:32,427 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:29:32,427 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:29:32,430 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:29:32,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:32,431 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:29:31" (1/3) ... [2024-11-17 08:29:32,432 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6baefe91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:29:32, skipping insertion in model container [2024-11-17 08:29:32,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:32,432 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (2/3) ... [2024-11-17 08:29:32,433 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6baefe91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:29:32, skipping insertion in model container [2024-11-17 08:29:32,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:32,433 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:32" (3/3) ... [2024-11-17 08:29:32,434 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2024-11-17 08:29:32,471 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:29:32,471 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:29:32,471 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:29:32,471 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:29:32,471 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:29:32,471 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:29:32,471 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:29:32,472 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:29:32,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:32,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:29:32,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:32,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:32,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:32,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:32,492 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:29:32,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:32,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:29:32,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:32,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:32,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:32,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:32,499 INFO L745 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 21#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 25#L536true [2024-11-17 08:29:32,500 INFO L747 eck$LassoCheckResult]: Loop: 25#L536true assume true;havoc main_#t~nondet4#1; 10#L536-1true assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 8#L538true assume !true; 4#L544-2true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 23#L544-1true assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 6#L544true assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 22#L549-2true call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 3#L549-1true assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 15#L549true assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 25#L536true [2024-11-17 08:29:32,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2336, now seen corresponding path program 1 times [2024-11-17 08:29:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:32,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187156353] [2024-11-17 08:29:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:32,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:32,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:32,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1505351262, now seen corresponding path program 1 times [2024-11-17 08:29:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352178224] [2024-11-17 08:29:32,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:32,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:32,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:32,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352178224] [2024-11-17 08:29:32,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352178224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:32,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:29:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638678811] [2024-11-17 08:29:32,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:32,773 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:29:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:32,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:29:32,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:29:32,808 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-11-17 08:29:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:32,813 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2024-11-17 08:29:32,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2024-11-17 08:29:32,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:29:32,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 31 transitions. [2024-11-17 08:29:32,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:29:32,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-17 08:29:32,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2024-11-17 08:29:32,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:29:32,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 31 transitions. [2024-11-17 08:29:32,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2024-11-17 08:29:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 08:29:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2024-11-17 08:29:32,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 31 transitions. [2024-11-17 08:29:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:29:32,843 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2024-11-17 08:29:32,843 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:29:32,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. [2024-11-17 08:29:32,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:29:32,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:32,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:32,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:32,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:32,845 INFO L745 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 63#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 76#L536 [2024-11-17 08:29:32,845 INFO L747 eck$LassoCheckResult]: Loop: 76#L536 assume true;havoc main_#t~nondet4#1; 77#L536-1 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 61#L538 assume true;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 73#L538-2 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 75#L538-1 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 64#L544-2 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 65#L544-1 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 71#L544 assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 72#L549-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 58#L549-1 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 59#L549 assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 76#L536 [2024-11-17 08:29:32,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2336, now seen corresponding path program 2 times [2024-11-17 08:29:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835950163] [2024-11-17 08:29:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:32,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:32,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:32,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:32,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1508244698, now seen corresponding path program 1 times [2024-11-17 08:29:32,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:32,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001019969] [2024-11-17 08:29:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:33,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001019969] [2024-11-17 08:29:33,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001019969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:33,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:33,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 08:29:33,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296644583] [2024-11-17 08:29:33,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:33,113 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:29:33,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:29:33,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:29:33,114 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:33,224 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2024-11-17 08:29:33,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 46 transitions. [2024-11-17 08:29:33,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2024-11-17 08:29:33,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 46 transitions. [2024-11-17 08:29:33,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-17 08:29:33,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-17 08:29:33,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 46 transitions. [2024-11-17 08:29:33,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:29:33,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 46 transitions. [2024-11-17 08:29:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 46 transitions. [2024-11-17 08:29:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-11-17 08:29:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-17 08:29:33,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-17 08:29:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:29:33,235 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-17 08:29:33,236 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:29:33,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-11-17 08:29:33,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2024-11-17 08:29:33,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:33,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:33,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:33,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:33,238 INFO L745 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 126#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 139#L536 [2024-11-17 08:29:33,238 INFO L747 eck$LassoCheckResult]: Loop: 139#L536 assume true;havoc main_#t~nondet4#1; 140#L536-1 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 124#L538 assume true;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 136#L538-2 assume !main_#t~short7#1; 138#L538-1 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 127#L544-2 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 128#L544-1 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 144#L544 assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 135#L549-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 121#L549-1 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 122#L549 assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 139#L536 [2024-11-17 08:29:33,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:33,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2336, now seen corresponding path program 3 times [2024-11-17 08:29:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:33,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537175206] [2024-11-17 08:29:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:33,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1043912263, now seen corresponding path program 1 times [2024-11-17 08:29:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599584626] [2024-11-17 08:29:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -283474118, now seen corresponding path program 1 times [2024-11-17 08:29:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186458327] [2024-11-17 08:29:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:47,130 WARN L286 SmtUtils]: Spent 13.75s on a formula simplification. DAG size of input: 239 DAG size of output: 179 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)