./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:41:27,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:41:27,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:41:27,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:41:27,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:41:27,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:41:27,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:41:27,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:41:27,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:41:27,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:41:27,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:41:27,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:41:27,200 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:41:27,200 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:41:27,200 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:41:27,201 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:41:27,201 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:41:27,205 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:41:27,206 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:41:27,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:41:27,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:41:27,207 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:41:27,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:41:27,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:41:27,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:41:27,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:41:27,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:41:27,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:41:27,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:41:27,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:41:27,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:41:27,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:41:27,211 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:41:27,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:41:27,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:41:27,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:41:27,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:41:27,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:41:27,214 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:41:27,214 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2024-10-12 00:41:27,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:41:27,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:41:27,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:41:27,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:41:27,512 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:41:27,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-10-12 00:41:29,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:41:29,306 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:41:29,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-10-12 00:41:29,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/636f0aa28/ef76af975faf4e87925e391e6bc21f5d/FLAGd91945ec3 [2024-10-12 00:41:29,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/636f0aa28/ef76af975faf4e87925e391e6bc21f5d [2024-10-12 00:41:29,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:41:29,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:41:29,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:41:29,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:41:29,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:41:29,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112e9f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29, skipping insertion in model container [2024-10-12 00:41:29,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:41:29,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:41:29,740 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:41:29,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:41:29,814 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:41:29,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29 WrapperNode [2024-10-12 00:41:29,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:41:29,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:41:29,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:41:29,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:41:29,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,861 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2024-10-12 00:41:29,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:41:29,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:41:29,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:41:29,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:41:29,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,914 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2024-10-12 00:41:29,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:41:29,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:41:29,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:41:29,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:41:29,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (1/1) ... [2024-10-12 00:41:29,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:29,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:29,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:41:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 00:41:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 00:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 00:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 00:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 00:41:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:41:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:41:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:41:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:41:30,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:41:30,204 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:41:30,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:41:30,551 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-12 00:41:30,552 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:41:30,567 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:41:30,568 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 00:41:30,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:41:30 BoogieIcfgContainer [2024-10-12 00:41:30,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:41:30,570 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:41:30,570 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:41:30,574 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:41:30,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:41:30,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:41:29" (1/3) ... [2024-10-12 00:41:30,576 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12da98bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:41:30, skipping insertion in model container [2024-10-12 00:41:30,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:41:30,576 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:29" (2/3) ... [2024-10-12 00:41:30,577 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12da98bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:41:30, skipping insertion in model container [2024-10-12 00:41:30,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:41:30,577 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:41:30" (3/3) ... [2024-10-12 00:41:30,579 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2024-10-12 00:41:30,639 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:41:30,640 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:41:30,640 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:41:30,640 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:41:30,640 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:41:30,640 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:41:30,641 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:41:30,641 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:41:30,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) 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-10-12 00:41:30,664 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:41:30,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:30,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:30,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:41:30,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:30,670 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:41:30,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) 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-10-12 00:41:30,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:41:30,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:30,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:30,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:41:30,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:30,679 INFO L745 eck$LassoCheckResult]: Stem: 20#$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(18, 2); 9#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~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#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_~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(12);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);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 5#L552-4true [2024-10-12 00:41:30,679 INFO L747 eck$LassoCheckResult]: Loop: 5#L552-4true havoc main_#t~nondet4#1; 16#L538-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; 24#L541-2true assume !true; 7#L540-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; 6#L546true assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 18#L546-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; 12#L546-4true call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 13#L552true assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 15#L552-2true assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#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, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#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~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 5#L552-4true [2024-10-12 00:41:30,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:41:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629399203] [2024-10-12 00:41:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:30,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:30,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:30,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1807228567, now seen corresponding path program 1 times [2024-10-12 00:41:30,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996161309] [2024-10-12 00:41:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:31,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996161309] [2024-10-12 00:41:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996161309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:31,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:41:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620015752] [2024-10-12 00:41:31,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:31,016 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:41:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:41:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:41:31,054 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.608695652173913) 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) 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-10-12 00:41:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:31,060 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2024-10-12 00:41:31,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2024-10-12 00:41:31,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:41:31,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 30 transitions. [2024-10-12 00:41:31,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-12 00:41:31,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-12 00:41:31,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2024-10-12 00:41:31,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:31,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-10-12 00:41:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2024-10-12 00:41:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 00:41:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2024-10-12 00:41:31,089 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-10-12 00:41:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:41:31,094 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-10-12 00:41:31,094 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:41:31,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2024-10-12 00:41:31,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:41:31,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:31,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:31,096 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:41:31,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:31,097 INFO L745 eck$LassoCheckResult]: Stem: 73#$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(18, 2); 66#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~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#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_~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(12);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);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 60#L552-4 [2024-10-12 00:41:31,097 INFO L747 eck$LassoCheckResult]: Loop: 60#L552-4 havoc main_#t~nondet4#1; 61#L538-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; 72#L541-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; 58#L540-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; 59#L540-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; 64#L540-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; 62#L546 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 63#L546-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; 69#L546-4 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 70#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 71#L552-2 assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#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, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#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~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 60#L552-4 [2024-10-12 00:41:31,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:41:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:31,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513489427] [2024-10-12 00:41:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:31,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:31,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:31,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 639218396, now seen corresponding path program 1 times [2024-10-12 00:41:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:31,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465102002] [2024-10-12 00:41:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465102002] [2024-10-12 00:41:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465102002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:31,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:31,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:41:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522934404] [2024-10-12 00:41:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:31,476 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:41:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:41:31,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:41:31,478 INFO L87 Difference]: Start difference. First operand 20 states and 30 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-10-12 00:41:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:31,719 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2024-10-12 00:41:31,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2024-10-12 00:41:31,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2024-10-12 00:41:31,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2024-10-12 00:41:31,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-12 00:41:31,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-12 00:41:31,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2024-10-12 00:41:31,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:31,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2024-10-12 00:41:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2024-10-12 00:41:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2024-10-12 00:41:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2024-10-12 00:41:31,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-10-12 00:41:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:41:31,737 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-10-12 00:41:31,738 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:41:31,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2024-10-12 00:41:31,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2024-10-12 00:41:31,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:31,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:31,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:41:31,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:31,742 INFO L745 eck$LassoCheckResult]: Stem: 136#$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(18, 2); 129#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~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#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_~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(12);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);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 122#L552-4 [2024-10-12 00:41:31,742 INFO L747 eck$LassoCheckResult]: Loop: 122#L552-4 havoc main_#t~nondet4#1; 123#L538-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; 135#L541-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; 119#L540-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; 120#L540-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; 140#L540-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; 124#L546 assume !main_#t~short13#1; 125#L546-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; 132#L546-4 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 133#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 134#L552-2 assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#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, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#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~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 122#L552-4 [2024-10-12 00:41:31,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:31,743 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:41:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798496070] [2024-10-12 00:41:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:31,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:31,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:31,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash 641065438, now seen corresponding path program 1 times [2024-10-12 00:41:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:31,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012655888] [2024-10-12 00:41:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:31,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:31,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 264589532, now seen corresponding path program 1 times [2024-10-12 00:41:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213291945] [2024-10-12 00:41:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:32,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:32,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213291945] [2024-10-12 00:41:32,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213291945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:32,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:41:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857306083] [2024-10-12 00:41:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:50,519 WARN L286 SmtUtils]: Spent 10.24s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 298] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:41:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:41:50,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:41:50,522 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 13 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-10-12 00:41:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:50,687 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2024-10-12 00:41:50,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2024-10-12 00:41:50,688 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-10-12 00:41:50,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 56 transitions. [2024-10-12 00:41:50,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-10-12 00:41:50,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-10-12 00:41:50,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 56 transitions. [2024-10-12 00:41:50,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:50,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-10-12 00:41:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 56 transitions. [2024-10-12 00:41:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-10-12 00:41:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2024-10-12 00:41:50,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-12 00:41:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:41:50,695 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-12 00:41:50,695 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:41:50,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2024-10-12 00:41:50,696 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-10-12 00:41:50,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:50,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:50,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:41:50,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:50,697 INFO L745 eck$LassoCheckResult]: Stem: 218#$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(18, 2); 205#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~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#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_~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(12);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);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 199#L552-4 [2024-10-12 00:41:50,697 INFO L747 eck$LassoCheckResult]: Loop: 199#L552-4 havoc main_#t~nondet4#1; 200#L538-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; 221#L541-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; 197#L540-1 assume !main_#t~short7#1; 198#L540-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; 207#L540-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; 229#L546 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 227#L546-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; 208#L546-4 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 209#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 212#L552-2 assume !main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1; 199#L552-4 [2024-10-12 00:41:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:41:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115692603] [2024-10-12 00:41:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:50,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:50,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:50,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash -170128228, now seen corresponding path program 1 times [2024-10-12 00:41:50,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:50,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522059257] [2024-10-12 00:41:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:50,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:50,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:50,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash -546604134, now seen corresponding path program 1 times [2024-10-12 00:41:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823834195] [2024-10-12 00:41:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:50,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:50,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:51,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:51,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:41:51 BoogieIcfgContainer [2024-10-12 00:41:51,410 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:41:51,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:41:51,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:41:51,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:41:51,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:41:30" (3/4) ... [2024-10-12 00:41:51,414 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:41:51,451 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:41:51,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:41:51,452 INFO L158 Benchmark]: Toolchain (without parser) took 22112.15ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 94.5MB in the beginning and 159.2MB in the end (delta: -64.7MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-10-12 00:41:51,453 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory was 110.1MB in the beginning and 109.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:41:51,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.08ms. Allocated memory is still 151.0MB. Free memory was 94.3MB in the beginning and 75.0MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 00:41:51,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.75ms. Allocated memory is still 151.0MB. Free memory was 75.0MB in the beginning and 72.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:41:51,454 INFO L158 Benchmark]: Boogie Preprocessor took 82.22ms. Allocated memory is still 151.0MB. Free memory was 72.6MB in the beginning and 69.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:41:51,454 INFO L158 Benchmark]: RCFGBuilder took 620.35ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 69.4MB in the beginning and 155.0MB in the end (delta: -85.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 00:41:51,455 INFO L158 Benchmark]: BuchiAutomizer took 20840.41ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 155.0MB in the beginning and 160.7MB in the end (delta: -5.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-10-12 00:41:51,455 INFO L158 Benchmark]: Witness Printer took 41.21ms. Allocated memory is still 245.4MB. Free memory was 160.7MB in the beginning and 159.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:41:51,457 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.17ms. Allocated memory is still 151.0MB. Free memory was 110.1MB in the beginning and 109.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.08ms. Allocated memory is still 151.0MB. Free memory was 94.3MB in the beginning and 75.0MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.75ms. Allocated memory is still 151.0MB. Free memory was 75.0MB in the beginning and 72.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.22ms. Allocated memory is still 151.0MB. Free memory was 72.6MB in the beginning and 69.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 620.35ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 69.4MB in the beginning and 155.0MB in the end (delta: -85.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 20840.41ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 155.0MB in the beginning and 160.7MB in the end (delta: -5.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 41.21ms. Allocated memory is still 245.4MB. Free memory was 160.7MB in the beginning and 159.2MB in the end (delta: 1.5MB). 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 20.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 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, 40 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 81 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 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: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] !n->left && __VERIFIER_nondet_int() [L546] !n->left && __VERIFIER_nondet_int() [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] !n->right && __VERIFIER_nondet_int() [L552] !n->right && __VERIFIER_nondet_int() [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 538]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] !n->left && __VERIFIER_nondet_int() [L546] !n->left && __VERIFIER_nondet_int() [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] !n->right && __VERIFIER_nondet_int() [L552] !n->right && __VERIFIER_nondet_int() [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-12 00:41:51,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)