./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc 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_dsw.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 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:41:35,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:41:35,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:41:35,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:41:35,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:41:35,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:41:35,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:41:35,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:41:35,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:41:35,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:41:35,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:41:35,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:41:35,286 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:41:35,288 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:41:35,289 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:41:35,289 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:41:35,289 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:41:35,289 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:41:35,290 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:41:35,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:41:35,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:41:35,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:41:35,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:41:35,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:41:35,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:41:35,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:41:35,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:41:35,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:41:35,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:41:35,296 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:41:35,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:41:35,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:41:35,297 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:41:35,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:41:35,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:41:35,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:41:35,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:41:35,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:41:35,300 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:41:35,300 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 -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2024-11-19 14:41:35,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:41:35,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:41:35,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:41:35,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:41:35,552 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:41:35,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2024-11-19 14:41:37,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:41:37,252 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:41:37,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2024-11-19 14:41:37,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9d7174a/5f284e2ee57b42789b816b613a9afd6f/FLAGc9d031cf3 [2024-11-19 14:41:37,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9d7174a/5f284e2ee57b42789b816b613a9afd6f [2024-11-19 14:41:37,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:41:37,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:41:37,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:41:37,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:41:37,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:41:37,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:41:37" (1/1) ... [2024-11-19 14:41:37,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f59744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:37, skipping insertion in model container [2024-11-19 14:41:37,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:41:37" (1/1) ... [2024-11-19 14:41:37,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:41:37,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:41:37,966 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:41:38,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:41:38,068 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:41:38,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38 WrapperNode [2024-11-19 14:41:38,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:41:38,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:41:38,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:41:38,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:41:38,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,132 INFO L138 Inliner]: procedures = 124, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 159 [2024-11-19 14:41:38,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:41:38,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:41:38,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:41:38,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:41:38,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,167 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 34, 1]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 17 writes are split as follows [0, 16, 1]. [2024-11-19 14:41:38,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:41:38,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:41:38,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:41:38,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:41:38,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:41:38,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:41:38,224 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-19 14:41:38,228 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-19 14:41:38,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 14:41:38,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:41:38,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:41:38,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 14:41:38,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 14:41:38,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 14:41:38,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 14:41:38,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 14:41:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 14:41:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:41:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:41:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 14:41:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 14:41:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:41:38,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:41:38,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:41:38,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:41:38,793 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-19 14:41:38,793 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:41:38,804 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:41:38,804 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 14:41:38,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:41:38 BoogieIcfgContainer [2024-11-19 14:41:38,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:41:38,805 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:41:38,805 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:41:38,809 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:41:38,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:38,810 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:41:37" (1/3) ... [2024-11-19 14:41:38,811 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d650b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:41:38, skipping insertion in model container [2024-11-19 14:41:38,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:38,811 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (2/3) ... [2024-11-19 14:41:38,812 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d650b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:41:38, skipping insertion in model container [2024-11-19 14:41:38,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:38,812 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:41:38" (3/3) ... [2024-11-19 14:41:38,813 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2024-11-19 14:41:38,862 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:41:38,862 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:41:38,862 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:41:38,862 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:41:38,862 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:41:38,862 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:41:38,862 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:41:38,862 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:41:38,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:41:38,881 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-19 14:41:38,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:38,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:38,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:38,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:38,887 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:41:38,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:41:38,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-19 14:41:38,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:38,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:38,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:38,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:38,898 INFO L745 eck$LassoCheckResult]: Stem: 23#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 8#L-1true 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~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~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); 6#L549-4true [2024-11-19 14:41:38,898 INFO L747 eck$LassoCheckResult]: Loop: 6#L549-4true havoc main_#t~nondet4#1; 11#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; 14#L539-2true assume !true; 20#L538-5true 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; 7#L544true assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 4#L544-2true 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; 5#L544-4true 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; 13#L549true assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 24#L549-2true 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; 6#L549-4true [2024-11-19 14:41:38,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:41:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819410878] [2024-11-19 14:41:38,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:39,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:39,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1807228567, now seen corresponding path program 1 times [2024-11-19 14:41:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622263945] [2024-11-19 14:41:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:39,161 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-19 14:41:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622263945] [2024-11-19 14:41:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622263945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:41:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985510226] [2024-11-19 14:41:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:39,168 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:41:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:39,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:41:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:41:39,208 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-19 14:41:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:39,218 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2024-11-19 14:41:39,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2024-11-19 14:41:39,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-19 14:41:39,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 37 transitions. [2024-11-19 14:41:39,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-19 14:41:39,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:41:39,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 37 transitions. [2024-11-19 14:41:39,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:39,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 37 transitions. [2024-11-19 14:41:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 37 transitions. [2024-11-19 14:41:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 14:41:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:41:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2024-11-19 14:41:39,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 37 transitions. [2024-11-19 14:41:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:41:39,262 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2024-11-19 14:41:39,263 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:41:39,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 37 transitions. [2024-11-19 14:41:39,265 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-19 14:41:39,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:39,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:39,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:39,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:39,267 INFO L745 eck$LassoCheckResult]: Stem: 84#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 76#L-1 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~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~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); 73#L549-4 [2024-11-19 14:41:39,268 INFO L747 eck$LassoCheckResult]: Loop: 73#L549-4 havoc main_#t~nondet4#1; 74#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; 69#L539-2 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; 78#L538-1 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; 64#L538-3 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; 65#L538-5 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; 75#L544 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 70#L544-2 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; 71#L544-4 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; 72#L549 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 86#L549-2 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; 73#L549-4 [2024-11-19 14:41:39,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:41:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639729151] [2024-11-19 14:41:39,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:41:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,301 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:41:39,301 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:39,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:39,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:39,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,336 INFO L85 PathProgramCache]: Analyzing trace with hash 639218396, now seen corresponding path program 1 times [2024-11-19 14:41:39,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252515112] [2024-11-19 14:41:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:39,759 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-19 14:41:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:39,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252515112] [2024-11-19 14:41:39,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252515112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:39,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:39,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:41:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333101473] [2024-11-19 14:41:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:39,761 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:41:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:41:39,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:41:39,762 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. cyclomatic complexity: 16 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-19 14:41:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:39,901 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2024-11-19 14:41:39,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 52 transitions. [2024-11-19 14:41:39,902 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2024-11-19 14:41:39,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 52 transitions. [2024-11-19 14:41:39,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-19 14:41:39,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-19 14:41:39,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 52 transitions. [2024-11-19 14:41:39,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:39,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 52 transitions. [2024-11-19 14:41:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 52 transitions. [2024-11-19 14:41:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2024-11-19 14:41:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5) internal successors, (42), 27 states have internal predecessors, (42), 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-19 14:41:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2024-11-19 14:41:39,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2024-11-19 14:41:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:41:39,910 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2024-11-19 14:41:39,910 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:41:39,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2024-11-19 14:41:39,910 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2024-11-19 14:41:39,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:39,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:39,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:39,911 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:39,912 INFO L745 eck$LassoCheckResult]: Stem: 156#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 145#L-1 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~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~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); 142#L549-4 [2024-11-19 14:41:39,912 INFO L747 eck$LassoCheckResult]: Loop: 142#L549-4 havoc main_#t~nondet4#1; 143#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; 138#L539-2 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; 147#L538-1 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; 148#L538-3 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; 152#L538-5 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; 144#L544 assume !main_#t~short13#1; 139#L544-2 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; 140#L544-4 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; 141#L549 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 155#L549-2 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; 142#L549-4 [2024-11-19 14:41:39,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:41:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047338743] [2024-11-19 14:41:39,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:41:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,935 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:41:39,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:39,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:39,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash 641065438, now seen corresponding path program 1 times [2024-11-19 14:41:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273109933] [2024-11-19 14:41:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:39,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:40,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 264589532, now seen corresponding path program 1 times [2024-11-19 14:41:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165253957] [2024-11-19 14:41:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:40,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:40,319 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-19 14:41:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165253957] [2024-11-19 14:41:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165253957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:40,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:40,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:41:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994436529] [2024-11-19 14:41:40,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:42,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:42,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:41:42,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:41:42,983 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-19 14:41:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:43,145 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2024-11-19 14:41:43,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 68 transitions. [2024-11-19 14:41:43,147 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2024-11-19 14:41:43,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 68 transitions. [2024-11-19 14:41:43,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-19 14:41:43,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-19 14:41:43,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 68 transitions. [2024-11-19 14:41:43,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:43,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-19 14:41:43,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 68 transitions. [2024-11-19 14:41:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-11-19 14:41:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.45) internal successors, (58), 39 states have internal predecessors, (58), 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-19 14:41:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-11-19 14:41:43,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-11-19 14:41:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:41:43,153 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-11-19 14:41:43,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:41:43,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 58 transitions. [2024-11-19 14:41:43,154 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2024-11-19 14:41:43,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:43,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:43,155 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:43,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:43,155 INFO L745 eck$LassoCheckResult]: Stem: 249#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 236#L-1 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~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~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); 237#L549-4 [2024-11-19 14:41:43,155 INFO L747 eck$LassoCheckResult]: Loop: 237#L549-4 havoc main_#t~nondet4#1; 255#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; 251#L539-2 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; 239#L538-1 assume !main_#t~short7#1; 240#L538-3 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; 261#L538-5 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; 256#L544 assume !main_#t~short13#1; 228#L544-2 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; 229#L544-4 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; 258#L549 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 257#L549-2 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; 237#L549-4 [2024-11-19 14:41:43,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:41:43,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:43,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514617846] [2024-11-19 14:41:43,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:41:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:43,171 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:41:43,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:43,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:43,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:43,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash -168281186, now seen corresponding path program 1 times [2024-11-19 14:41:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239280177] [2024-11-19 14:41:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:43,276 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-19 14:41:43,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239280177] [2024-11-19 14:41:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239280177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:43,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:43,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:41:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890903537] [2024-11-19 14:41:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:43,277 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:41:43,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:43,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:41:43,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:41:43,278 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. cyclomatic complexity: 22 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-19 14:41:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:43,415 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2024-11-19 14:41:43,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 67 transitions. [2024-11-19 14:41:43,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-19 14:41:43,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 67 transitions. [2024-11-19 14:41:43,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-19 14:41:43,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-19 14:41:43,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 67 transitions. [2024-11-19 14:41:43,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:43,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-19 14:41:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 67 transitions. [2024-11-19 14:41:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2024-11-19 14:41:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 38 states have internal predecessors, (55), 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-19 14:41:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-19 14:41:43,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-19 14:41:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 14:41:43,423 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-19 14:41:43,423 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:41:43,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 55 transitions. [2024-11-19 14:41:43,424 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-19 14:41:43,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:43,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:43,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:43,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:43,425 INFO L745 eck$LassoCheckResult]: Stem: 344#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 331#L-1 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~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~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); 332#L549-4 [2024-11-19 14:41:43,425 INFO L747 eck$LassoCheckResult]: Loop: 332#L549-4 havoc main_#t~nondet4#1; 342#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; 343#L539-2 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; 334#L538-1 assume !main_#t~short7#1; 335#L538-3 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; 356#L538-5 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; 355#L544 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 354#L544-2 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; 353#L544-4 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; 352#L549 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 351#L549-2 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; 332#L549-4 [2024-11-19 14:41:43,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:41:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124793587] [2024-11-19 14:41:43,426 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:41:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:43,437 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:41:43,437 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:43,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:43,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:43,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash -170128228, now seen corresponding path program 1 times [2024-11-19 14:41:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26162148] [2024-11-19 14:41:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:43,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:43,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:43,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash -546604134, now seen corresponding path program 1 times [2024-11-19 14:41:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744483038] [2024-11-19 14:41:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:43,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:43,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:44,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:44,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:41:44 BoogieIcfgContainer [2024-11-19 14:41:44,070 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:41:44,071 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:41:44,071 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:41:44,071 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:41:44,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:41:38" (3/4) ... [2024-11-19 14:41:44,073 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:41:44,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:41:44,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:41:44,114 INFO L158 Benchmark]: Toolchain (without parser) took 6524.16ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 87.1MB in the beginning and 182.0MB in the end (delta: -94.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:41:44,114 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:41:44,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.76ms. Allocated memory is still 155.2MB. Free memory was 86.8MB in the beginning and 124.9MB in the end (delta: -38.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-11-19 14:41:44,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.25ms. Allocated memory is still 155.2MB. Free memory was 124.9MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:41:44,115 INFO L158 Benchmark]: Boogie Preprocessor took 55.89ms. Allocated memory is still 155.2MB. Free memory was 122.7MB in the beginning and 119.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 14:41:44,115 INFO L158 Benchmark]: RCFGBuilder took 614.30ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 93.4MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 14:41:44,116 INFO L158 Benchmark]: BuchiAutomizer took 5264.87ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 93.4MB in the beginning and 184.1MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:41:44,116 INFO L158 Benchmark]: Witness Printer took 42.55ms. Allocated memory is still 234.9MB. Free memory was 184.1MB in the beginning and 182.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:41:44,118 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.76ms. Allocated memory is still 155.2MB. Free memory was 86.8MB in the beginning and 124.9MB in the end (delta: -38.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.25ms. Allocated memory is still 155.2MB. Free memory was 124.9MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.89ms. Allocated memory is still 155.2MB. Free memory was 122.7MB in the beginning and 119.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 614.30ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 93.4MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 5264.87ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 93.4MB in the beginning and 184.1MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 42.55ms. Allocated memory is still 234.9MB. Free memory was 184.1MB in the beginning and 182.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 132 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 536]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] !n->left && __VERIFIER_nondet_int() [L544] !n->left && __VERIFIER_nondet_int() [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] !n->right && __VERIFIER_nondet_int() [L549] !n->right && __VERIFIER_nondet_int() [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 536]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] !n->left && __VERIFIER_nondet_int() [L544] !n->left && __VERIFIER_nondet_int() [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] !n->right && __VERIFIER_nondet_int() [L549] !n->right && __VERIFIER_nondet_int() [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:41:44,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)