./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.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 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:21:43,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:21:43,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:21:43,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:21:43,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:21:43,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:21:43,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:21:43,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:21:43,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:21:43,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:21:43,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:21:43,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:21:43,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:21:43,169 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:21:43,169 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:21:43,170 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:21:43,170 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:21:43,170 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:21:43,170 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:21:43,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:21:43,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:21:43,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:21:43,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:21:43,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:21:43,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:21:43,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:21:43,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:21:43,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:21:43,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:21:43,176 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:21:43,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:21:43,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:21:43,176 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:21:43,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:21:43,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:21:43,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:21:43,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:21:43,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:21:43,177 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:21:43,177 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 -> 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a [2024-11-12 21:21:43,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:21:43,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:21:43,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:21:43,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:21:43,394 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:21:43,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-12 21:21:44,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:21:44,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:21:44,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-12 21:21:44,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d9ef726/e9c3015ae677437e944e5dada0c9d2f3/FLAG2627af95e [2024-11-12 21:21:45,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d9ef726/e9c3015ae677437e944e5dada0c9d2f3 [2024-11-12 21:21:45,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:21:45,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:21:45,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:21:45,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:21:45,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:21:45,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49483c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45, skipping insertion in model container [2024-11-12 21:21:45,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:21:45,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:21:45,565 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:21:45,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:21:45,638 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:21:45,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45 WrapperNode [2024-11-12 21:21:45,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:21:45,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:21:45,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:21:45,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:21:45,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,707 INFO L138 Inliner]: procedures = 122, calls = 55, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 209 [2024-11-12 21:21:45,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:21:45,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:21:45,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:21:45,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:21:45,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,752 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 5, 10]. [2024-11-12 21:21:45,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:21:45,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:21:45,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:21:45,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:21:45,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (1/1) ... [2024-11-12 21:21:45,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:45,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:45,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:45,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-12 21:21:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 21:21:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 21:21:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 21:21:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 21:21:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 21:21:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 21:21:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 21:21:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:21:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 21:21:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 21:21:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 21:21:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 21:21:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 21:21:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 21:21:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 21:21:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:21:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 21:21:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 21:21:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:21:45,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:21:46,002 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:21:46,004 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:21:46,322 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-12 21:21:46,322 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:21:46,333 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:21:46,333 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-12 21:21:46,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:21:46 BoogieIcfgContainer [2024-11-12 21:21:46,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:21:46,334 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:21:46,335 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:21:46,338 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:21:46,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:46,338 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:21:45" (1/3) ... [2024-11-12 21:21:46,339 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585c4b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:21:46, skipping insertion in model container [2024-11-12 21:21:46,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:46,340 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:45" (2/3) ... [2024-11-12 21:21:46,340 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585c4b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:21:46, skipping insertion in model container [2024-11-12 21:21:46,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:46,340 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:21:46" (3/3) ... [2024-11-12 21:21:46,341 INFO L332 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2024-11-12 21:21:46,381 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:21:46,381 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:21:46,381 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:21:46,382 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:21:46,382 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:21:46,382 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:21:46,382 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:21:46,382 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:21:46,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:21:46,399 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2024-11-12 21:21:46,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:46,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:46,404 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:46,404 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:46,404 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:21:46,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:21:46,407 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2024-11-12 21:21:46,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:46,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:46,407 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:46,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:46,412 INFO L747 eck$LassoCheckResult]: Stem: "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(24, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, 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~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#2(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2024-11-12 21:21:46,413 INFO L749 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#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;" "assume !true;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(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;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#2(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2024-11-12 21:21:46,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 21:21:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529356569] [2024-11-12 21:21:46,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:46,535 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:46,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:46,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1807228567, now seen corresponding path program 1 times [2024-11-12 21:21:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:46,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408418949] [2024-11-12 21:21:46,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:46,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408418949] [2024-11-12 21:21:46,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408418949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:46,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078301771] [2024-11-12 21:21:46,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:46,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:46,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:46,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:46,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 21:21:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:46,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 21:21:46,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:46,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078301771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:46,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:46,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:21:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172271089] [2024-11-12 21:21:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:46,744 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:21:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 21:21:46,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 21:21:46,774 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:21:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:46,782 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2024-11-12 21:21:46,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 70 transitions. [2024-11-12 21:21:46,784 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2024-11-12 21:21:46,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 62 transitions. [2024-11-12 21:21:46,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-12 21:21:46,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-12 21:21:46,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2024-11-12 21:21:46,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:21:46,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-11-12 21:21:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2024-11-12 21:21:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-12 21:21:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 41 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:21:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-11-12 21:21:46,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-11-12 21:21:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 21:21:46,817 INFO L426 stractBuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-11-12 21:21:46,817 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:21:46,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 62 transitions. [2024-11-12 21:21:46,818 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2024-11-12 21:21:46,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:46,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:46,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:46,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:46,819 INFO L747 eck$LassoCheckResult]: Stem: "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(24, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, 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~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#2(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2024-11-12 21:21:46,819 INFO L749 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#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;" "call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#2(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;" "assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#2(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;" "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;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(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;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#2(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2024-11-12 21:21:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-12 21:21:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404760385] [2024-11-12 21:21:46,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:46,833 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:46,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:46,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash 639218396, now seen corresponding path program 1 times [2024-11-12 21:21:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:46,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319131127] [2024-11-12 21:21:46,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319131127] [2024-11-12 21:21:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319131127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487487686] [2024-11-12 21:21:47,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:47,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:47,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:47,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:47,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 21:21:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:47,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 21:21:47,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:47,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-12 21:21:47,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-12 21:21:47,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:47,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487487686] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:47,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:47,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-12 21:21:47,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204280241] [2024-11-12 21:21:47,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:47,322 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:21:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:47,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 21:21:47,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 21:21:47,322 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. cyclomatic complexity: 29 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:21:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:47,476 INFO L93 Difference]: Finished difference Result 73 states and 104 transitions. [2024-11-12 21:21:47,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 104 transitions. [2024-11-12 21:21:47,481 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 60 [2024-11-12 21:21:47,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 104 transitions. [2024-11-12 21:21:47,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2024-11-12 21:21:47,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-11-12 21:21:47,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 104 transitions. [2024-11-12 21:21:47,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:21:47,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-11-12 21:21:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 104 transitions. [2024-11-12 21:21:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2024-11-12 21:21:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 45 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:21:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2024-11-12 21:21:47,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 67 transitions. [2024-11-12 21:21:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 21:21:47,493 INFO L426 stractBuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2024-11-12 21:21:47,493 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:21:47,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 67 transitions. [2024-11-12 21:21:47,494 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 39 [2024-11-12 21:21:47,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:47,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:47,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:47,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:47,495 INFO L747 eck$LassoCheckResult]: Stem: "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(24, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, 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~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#2(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2024-11-12 21:21:47,495 INFO L749 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#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;" "call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#2(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;" "assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#2(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;" "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;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(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;" "assume !main_#t~short13#1;" "assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#2(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2024-11-12 21:21:47,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-12 21:21:47,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:47,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606830066] [2024-11-12 21:21:47,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:47,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:47,512 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:47,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:47,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash 641065438, now seen corresponding path program 1 times [2024-11-12 21:21:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:47,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842341091] [2024-11-12 21:21:47,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:47,560 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:47,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:47,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash 264589532, now seen corresponding path program 1 times [2024-11-12 21:21:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:47,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657738286] [2024-11-12 21:21:47,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:47,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657738286] [2024-11-12 21:21:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657738286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440501673] [2024-11-12 21:21:47,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:47,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:47,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:47,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:47,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 21:21:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:47,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 21:21:47,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:47,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-12 21:21:47,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-12 21:21:48,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:48,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440501673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:48,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:48,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 21:21:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85865054] [2024-11-12 21:21:48,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 21:21:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 21:21:50,414 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. cyclomatic complexity: 30 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:21:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:50,632 INFO L93 Difference]: Finished difference Result 96 states and 139 transitions. [2024-11-12 21:21:50,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 139 transitions. [2024-11-12 21:21:50,633 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 79 [2024-11-12 21:21:50,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 96 states and 139 transitions. [2024-11-12 21:21:50,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2024-11-12 21:21:50,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2024-11-12 21:21:50,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 139 transitions. [2024-11-12 21:21:50,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:21:50,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 139 transitions. [2024-11-12 21:21:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 139 transitions. [2024-11-12 21:21:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2024-11-12 21:21:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 56 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:21:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2024-11-12 21:21:50,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 81 transitions. [2024-11-12 21:21:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 21:21:50,640 INFO L426 stractBuchiCegarLoop]: Abstraction has 57 states and 81 transitions. [2024-11-12 21:21:50,640 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:21:50,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 81 transitions. [2024-11-12 21:21:50,641 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 50 [2024-11-12 21:21:50,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:50,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:50,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:50,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:50,642 INFO L747 eck$LassoCheckResult]: Stem: "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(24, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, 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~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#2(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2024-11-12 21:21:50,642 INFO L749 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#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;" "call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#2(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;" "assume !main_#t~short7#1;" "assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(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;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;" [2024-11-12 21:21:50,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-12 21:21:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:50,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438100895] [2024-11-12 21:21:50,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,651 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:50,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -170128228, now seen corresponding path program 1 times [2024-11-12 21:21:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:50,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685806508] [2024-11-12 21:21:50,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,663 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -546604134, now seen corresponding path program 1 times [2024-11-12 21:21:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:50,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912091393] [2024-11-12 21:21:50,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:50,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,679 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:51,276 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:51,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:21:51 BoogieIcfgContainer [2024-11-12 21:21:51,347 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:21:51,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:21:51,348 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:21:51,348 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:21:51,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:21:46" (3/4) ... [2024-11-12 21:21:51,350 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 21:21:51,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 21:21:51,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:21:51,407 INFO L158 Benchmark]: Toolchain (without parser) took 6113.86ms. Allocated memory was 190.8MB in the beginning and 270.5MB in the end (delta: 79.7MB). Free memory was 124.1MB in the beginning and 140.2MB in the end (delta: -16.2MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-12 21:21:51,407 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:21:51,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.35ms. Allocated memory is still 190.8MB. Free memory was 123.9MB in the beginning and 161.8MB in the end (delta: -37.9MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-11-12 21:21:51,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.31ms. Allocated memory is still 190.8MB. Free memory was 161.8MB in the beginning and 158.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 21:21:51,408 INFO L158 Benchmark]: Boogie Preprocessor took 82.17ms. Allocated memory is still 190.8MB. Free memory was 158.7MB in the beginning and 155.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:21:51,408 INFO L158 Benchmark]: RCFGBuilder took 543.52ms. Allocated memory is still 190.8MB. Free memory was 154.7MB in the beginning and 126.7MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 21:21:51,408 INFO L158 Benchmark]: BuchiAutomizer took 5012.78ms. Allocated memory was 190.8MB in the beginning and 270.5MB in the end (delta: 79.7MB). Free memory was 126.7MB in the beginning and 142.3MB in the end (delta: -15.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-11-12 21:21:51,412 INFO L158 Benchmark]: Witness Printer took 58.41ms. Allocated memory is still 270.5MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:21:51,413 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.15ms. Allocated memory is still 104.9MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.35ms. Allocated memory is still 190.8MB. Free memory was 123.9MB in the beginning and 161.8MB in the end (delta: -37.9MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.31ms. Allocated memory is still 190.8MB. Free memory was 161.8MB in the beginning and 158.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.17ms. Allocated memory is still 190.8MB. Free memory was 158.7MB in the beginning and 155.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.52ms. Allocated memory is still 190.8MB. Free memory was 154.7MB in the beginning and 126.7MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 5012.78ms. Allocated memory was 190.8MB in the beginning and 270.5MB in the end (delta: 79.7MB). Free memory was 126.7MB in the beginning and 142.3MB in the end (delta: -15.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 58.41ms. Allocated memory is still 270.5MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 8 locations. The remainder module has 57 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.2s. 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, 66 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, 191 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 692 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 467 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 225 mSDtfsCounter, 217 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: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] !n->left && __VERIFIER_nondet_int() [L563] !n->left && __VERIFIER_nondet_int() [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] !n->right && __VERIFIER_nondet_int() [L568] !n->right && __VERIFIER_nondet_int() [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] !n->left && __VERIFIER_nondet_int() [L563] !n->left && __VERIFIER_nondet_int() [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] !n->right && __VERIFIER_nondet_int() [L568] !n->right && __VERIFIER_nondet_int() [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-12 21:21:51,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 21:21:51,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 21:21:51,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:52,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)