./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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:38:00,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:38:00,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:38:00,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:38:00,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:38:00,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:38:00,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:38:00,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:38:00,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:38:00,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:38:00,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:38:00,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:38:00,319 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:38:00,320 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:38:00,320 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:38:00,320 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:38:00,321 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:38:00,321 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:38:00,321 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:38:00,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:38:00,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:38:00,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:38:00,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:38:00,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:38:00,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:38:00,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:38:00,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:38:00,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:38:00,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:38:00,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:38:00,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:38:00,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:38:00,326 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:38:00,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:38:00,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:38:00,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:38:00,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:38:00,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:38:00,328 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:38:00,329 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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2024-10-15 00:38:00,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:38:00,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:38:00,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:38:00,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:38:00,625 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:38:00,626 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-15 00:38:02,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:38:02,404 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:38:02,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-10-15 00:38:02,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570e7f0fc/855a1a7fd88e4948abed551327e670d6/FLAG27665dc75 [2024-10-15 00:38:02,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570e7f0fc/855a1a7fd88e4948abed551327e670d6 [2024-10-15 00:38:02,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:38:02,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:38:02,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:38:02,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:38:02,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:38:02,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103df69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02, skipping insertion in model container [2024-10-15 00:38:02,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:38:02,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:38:02,761 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:38:02,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:38:02,844 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:38:02,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02 WrapperNode [2024-10-15 00:38:02,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:38:02,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:38:02,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:38:02,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:38:02,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,887 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2024-10-15 00:38:02,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:38:02,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:38:02,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:38:02,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:38:02,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,919 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-15 00:38:02,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:38:02,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:38:02,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:38:02,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:38:02,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (1/1) ... [2024-10-15 00:38:02,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:02,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:02,975 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-10-15 00:38:02,979 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-10-15 00:38:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 00:38:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:38:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-15 00:38:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-15 00:38:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-15 00:38:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-15 00:38:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:38:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:38:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 00:38:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:38:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:38:03,100 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:38:03,102 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:38:03,353 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-15 00:38:03,354 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:38:03,367 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:38:03,367 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-15 00:38:03,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:38:03 BoogieIcfgContainer [2024-10-15 00:38:03,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:38:03,369 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:38:03,369 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:38:03,372 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:38:03,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:38:03,373 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:38:02" (1/3) ... [2024-10-15 00:38:03,373 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1254d4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:38:03, skipping insertion in model container [2024-10-15 00:38:03,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:38:03,374 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:02" (2/3) ... [2024-10-15 00:38:03,374 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1254d4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:38:03, skipping insertion in model container [2024-10-15 00:38:03,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:38:03,375 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:38:03" (3/3) ... [2024-10-15 00:38:03,376 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2024-10-15 00:38:03,440 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:38:03,440 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:38:03,440 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:38:03,440 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:38:03,441 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:38:03,441 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:38:03,441 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:38:03,441 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:38:03,448 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-15 00:38:03,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:38:03,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:03,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:03,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:38:03,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:03,481 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:38:03,482 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-15 00:38:03,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:38:03,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:03,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:03,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:38:03,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:03,491 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-15 00:38:03,491 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-15 00:38:03,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:38:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:03,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812511138] [2024-10-15 00:38:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:03,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:03,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1807228567, now seen corresponding path program 1 times [2024-10-15 00:38:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998474148] [2024-10-15 00:38:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:03,740 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-15 00:38:03,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:38:03,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998474148] [2024-10-15 00:38:03,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998474148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:38:03,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:38:03,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:38:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198762] [2024-10-15 00:38:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:38:03,746 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:38:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:38:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 00:38:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 00:38:03,772 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-15 00:38:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:38:03,777 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2024-10-15 00:38:03,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2024-10-15 00:38:03,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:38:03,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 30 transitions. [2024-10-15 00:38:03,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-15 00:38:03,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-15 00:38:03,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2024-10-15 00:38:03,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:38:03,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-10-15 00:38:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2024-10-15 00:38:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-15 00:38:03,803 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-15 00:38:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2024-10-15 00:38:03,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-10-15 00:38:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:38:03,831 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-10-15 00:38:03,832 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:38:03,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2024-10-15 00:38:03,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:38:03,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:03,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:03,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:38:03,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:03,833 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-15 00:38:03,840 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-15 00:38:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:38:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780268469] [2024-10-15 00:38:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:03,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:03,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash 639218396, now seen corresponding path program 1 times [2024-10-15 00:38:03,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:03,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907070524] [2024-10-15 00:38:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:04,171 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-15 00:38:04,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:38:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907070524] [2024-10-15 00:38:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907070524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:38:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:38:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 00:38:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529427588] [2024-10-15 00:38:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:38:04,173 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:38:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:38:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 00:38:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-15 00:38:04,175 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-15 00:38:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:38:04,341 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2024-10-15 00:38:04,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2024-10-15 00:38:04,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2024-10-15 00:38:04,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2024-10-15 00:38:04,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-15 00:38:04,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-15 00:38:04,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2024-10-15 00:38:04,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:38:04,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2024-10-15 00:38:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2024-10-15 00:38:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2024-10-15 00:38:04,350 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-15 00:38:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2024-10-15 00:38:04,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-10-15 00:38:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:38:04,353 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-10-15 00:38:04,354 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:38:04,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2024-10-15 00:38:04,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2024-10-15 00:38:04,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:04,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:04,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:38:04,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:04,357 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-15 00:38:04,357 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-15 00:38:04,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-15 00:38:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:04,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897311072] [2024-10-15 00:38:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:04,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:04,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:04,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash 641065438, now seen corresponding path program 1 times [2024-10-15 00:38:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459313572] [2024-10-15 00:38:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:04,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:04,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:04,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash 264589532, now seen corresponding path program 1 times [2024-10-15 00:38:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577712700] [2024-10-15 00:38:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:04,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:04,798 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-15 00:38:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:38:04,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577712700] [2024-10-15 00:38:04,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577712700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:38:04,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:38:04,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 00:38:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902155096] [2024-10-15 00:38:04,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:38:28,881 WARN L286 SmtUtils]: Spent 15.57s 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-15 00:38:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:38:28,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 00:38:28,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 00:38:28,884 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-15 00:38:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:38:29,077 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2024-10-15 00:38:29,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2024-10-15 00:38:29,078 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-10-15 00:38:29,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 56 transitions. [2024-10-15 00:38:29,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-10-15 00:38:29,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-10-15 00:38:29,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 56 transitions. [2024-10-15 00:38:29,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:38:29,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-10-15 00:38:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 56 transitions. [2024-10-15 00:38:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-10-15 00:38:29,086 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-15 00:38:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2024-10-15 00:38:29,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-15 00:38:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:38:29,087 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-15 00:38:29,087 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:38:29,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2024-10-15 00:38:29,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-10-15 00:38:29,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:29,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:29,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:38:29,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:29,089 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-15 00:38:29,089 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-15 00:38:29,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-15 00:38:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288414618] [2024-10-15 00:38:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:29,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:29,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:29,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash -170128228, now seen corresponding path program 1 times [2024-10-15 00:38:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375278150] [2024-10-15 00:38:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:29,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:29,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:29,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash -546604134, now seen corresponding path program 1 times [2024-10-15 00:38:29,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:29,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004135228] [2024-10-15 00:38:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:29,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:29,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:29,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:29,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:29,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:38:29 BoogieIcfgContainer [2024-10-15 00:38:29,805 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:38:29,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:38:29,806 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:38:29,806 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:38:29,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:38:03" (3/4) ... [2024-10-15 00:38:29,808 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-15 00:38:29,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-15 00:38:29,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:38:29,844 INFO L158 Benchmark]: Toolchain (without parser) took 27408.20ms. Allocated memory was 134.2MB in the beginning and 291.5MB in the end (delta: 157.3MB). Free memory was 64.5MB in the beginning and 90.0MB in the end (delta: -25.6MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2024-10-15 00:38:29,845 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory was 103.0MB in the beginning and 102.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:38:29,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.87ms. Allocated memory was 134.2MB in the beginning and 224.4MB in the end (delta: 90.2MB). Free memory was 64.3MB in the beginning and 181.4MB in the end (delta: -117.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-10-15 00:38:29,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.10ms. Allocated memory is still 224.4MB. Free memory was 181.4MB in the beginning and 179.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:38:29,849 INFO L158 Benchmark]: Boogie Preprocessor took 44.48ms. Allocated memory is still 224.4MB. Free memory was 179.3MB in the beginning and 176.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:38:29,849 INFO L158 Benchmark]: RCFGBuilder took 434.58ms. Allocated memory is still 224.4MB. Free memory was 176.2MB in the beginning and 147.7MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-15 00:38:29,849 INFO L158 Benchmark]: BuchiAutomizer took 26436.75ms. Allocated memory was 224.4MB in the beginning and 291.5MB in the end (delta: 67.1MB). Free memory was 147.7MB in the beginning and 91.1MB in the end (delta: 56.6MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2024-10-15 00:38:29,849 INFO L158 Benchmark]: Witness Printer took 37.64ms. Allocated memory is still 291.5MB. Free memory was 91.1MB in the beginning and 90.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:38:29,888 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 134.2MB. Free memory was 103.0MB in the beginning and 102.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.87ms. Allocated memory was 134.2MB in the beginning and 224.4MB in the end (delta: 90.2MB). Free memory was 64.3MB in the beginning and 181.4MB in the end (delta: -117.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.10ms. Allocated memory is still 224.4MB. Free memory was 181.4MB in the beginning and 179.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.48ms. Allocated memory is still 224.4MB. Free memory was 179.3MB in the beginning and 176.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.58ms. Allocated memory is still 224.4MB. Free memory was 176.2MB in the beginning and 147.7MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 26436.75ms. Allocated memory was 224.4MB in the beginning and 291.5MB in the end (delta: 67.1MB). Free memory was 147.7MB in the beginning and 91.1MB in the end (delta: 56.6MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. * Witness Printer took 37.64ms. Allocated memory is still 291.5MB. Free memory was 91.1MB in the beginning and 90.0MB in the end (delta: 1.0MB). There was no memory consumed. 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 26.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 25.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. 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-15 00:38:29,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)