./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-8fc3dc6-m [2025-03-17 20:17:18,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:17:18,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:17:18,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:17:18,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:17:18,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:17:18,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:17:18,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:17:18,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:17:18,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:17:18,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:17:18,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:17:18,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:17:18,119 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:17:18,119 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:17:18,119 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:17:18,119 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:17:18,119 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:17:18,119 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:17:18,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:17:18,120 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:17:18,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:17:18,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:17:18,121 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:17:18,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:17:18,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:17:18,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:17:18,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:17:18,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:17:18,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:17:18,122 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:17:18,122 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 [2025-03-17 20:17:18,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:17:18,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:17:18,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:17:18,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:17:18,368 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:17:18,369 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 [2025-03-17 20:17:19,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58081bb2/38e0bfab68604505ab97107c7ff81be8/FLAGbbcf639f2 [2025-03-17 20:17:19,757 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:17:19,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2025-03-17 20:17:19,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58081bb2/38e0bfab68604505ab97107c7ff81be8/FLAGbbcf639f2 [2025-03-17 20:17:20,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58081bb2/38e0bfab68604505ab97107c7ff81be8 [2025-03-17 20:17:20,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:17:20,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:17:20,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:17:20,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:17:20,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:17:20,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728a25fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20, skipping insertion in model container [2025-03-17 20:17:20,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:17:20,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:17:20,304 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:17:20,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:17:20,355 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:17:20,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20 WrapperNode [2025-03-17 20:17:20,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:17:20,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:17:20,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:17:20,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:17:20,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,389 INFO L138 Inliner]: procedures = 122, calls = 55, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 199 [2025-03-17 20:17:20,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:17:20,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:17:20,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:17:20,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:17:20,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,413 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]. [2025-03-17 20:17:20,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:17:20,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:17:20,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:17:20,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:17:20,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:20,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:20,453 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) [2025-03-17 20:17:20,455 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 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 20:17:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 20:17:20,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 20:17:20,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 20:17:20,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 20:17:20,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:17:20,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:17:20,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:17:20,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 20:17:20,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:17:20,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:17:20,561 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:17:20,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:17:20,834 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L609: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 20:17:20,834 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L602: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 20:17:20,834 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L596: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 20:17:20,846 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-17 20:17:20,847 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:17:20,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:17:20,857 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:17:20,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:20 BoogieIcfgContainer [2025-03-17 20:17:20,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:17:20,858 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:17:20,858 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:17:20,862 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:17:20,863 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:20,863 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:17:20" (1/3) ... [2025-03-17 20:17:20,864 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44fe8b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:17:20, skipping insertion in model container [2025-03-17 20:17:20,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:20,864 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (2/3) ... [2025-03-17 20:17:20,864 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44fe8b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:17:20, skipping insertion in model container [2025-03-17 20:17:20,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:20,864 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:20" (3/3) ... [2025-03-17 20:17:20,865 INFO L363 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2025-03-17 20:17:20,896 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:17:20,896 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:17:20,896 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:17:20,896 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:17:20,896 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:17:20,896 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:17:20,896 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:17:20,896 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:17:20,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 46 states have internal predecessors, (76), 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) [2025-03-17 20:17:20,913 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2025-03-17 20:17:20,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:20,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:20,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:20,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:20,917 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:17:20,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 46 states have internal predecessors, (76), 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) [2025-03-17 20:17:20,919 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2025-03-17 20:17:20,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:20,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:20,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:20,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:20,923 INFO L752 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);" [2025-03-17 20:17:20,923 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#2(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#2(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;" "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;" [2025-03-17 20:17:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 1 times [2025-03-17 20:17:20,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:20,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785241888] [2025-03-17 20:17:20,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:20,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:21,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:21,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash 325385743, now seen corresponding path program 1 times [2025-03-17 20:17:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761032766] [2025-03-17 20:17:21,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:17:21,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:17:21,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:21,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:21,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761032766] [2025-03-17 20:17:21,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761032766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:21,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:21,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:17:21,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421948152] [2025-03-17 20:17:21,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:21,145 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:17:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:21,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 20:17:21,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 20:17:21,167 INFO L87 Difference]: Start difference. First operand has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 46 states have internal predecessors, (76), 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) [2025-03-17 20:17:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:21,175 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2025-03-17 20:17:21,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 66 transitions. [2025-03-17 20:17:21,178 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2025-03-17 20:17:21,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 40 states and 60 transitions. [2025-03-17 20:17:21,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-17 20:17:21,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-17 20:17:21,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 60 transitions. [2025-03-17 20:17:21,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:21,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-03-17 20:17:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 60 transitions. [2025-03-17 20:17:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 20:17:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 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) [2025-03-17 20:17:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2025-03-17 20:17:21,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-03-17 20:17:21,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 20:17:21,211 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-03-17 20:17:21,211 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:17:21,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 60 transitions. [2025-03-17 20:17:21,212 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2025-03-17 20:17:21,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:21,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:21,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:21,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:21,215 INFO L752 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);" [2025-03-17 20:17:21,215 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~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~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#2(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#2(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;" "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;" [2025-03-17 20:17:21,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 2 times [2025-03-17 20:17:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082631501] [2025-03-17 20:17:21,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:17:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:17:21,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,235 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:21,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:21,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1974714964, now seen corresponding path program 1 times [2025-03-17 20:17:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199520419] [2025-03-17 20:17:21,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:21,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:21,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199520419] [2025-03-17 20:17:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199520419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:17:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279977693] [2025-03-17 20:17:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:21,528 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:17:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:21,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:17:21,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:17:21,528 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. cyclomatic complexity: 29 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) [2025-03-17 20:17:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:21,625 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2025-03-17 20:17:21,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 101 transitions. [2025-03-17 20:17:21,627 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 60 [2025-03-17 20:17:21,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 101 transitions. [2025-03-17 20:17:21,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-03-17 20:17:21,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-17 20:17:21,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 101 transitions. [2025-03-17 20:17:21,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:21,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 101 transitions. [2025-03-17 20:17:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 101 transitions. [2025-03-17 20:17:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2025-03-17 20:17:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 43 states have internal predecessors, (65), 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) [2025-03-17 20:17:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2025-03-17 20:17:21,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 20:17:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:17:21,636 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 20:17:21,636 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:17:21,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 65 transitions. [2025-03-17 20:17:21,637 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 39 [2025-03-17 20:17:21,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:21,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:21,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:21,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:21,638 INFO L752 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);" [2025-03-17 20:17:21,638 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~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;" "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;" [2025-03-17 20:17:21,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 3 times [2025-03-17 20:17:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242673472] [2025-03-17 20:17:21,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:17:21,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:17:21,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:21,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:21,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash -230951317, now seen corresponding path program 1 times [2025-03-17 20:17:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609942452] [2025-03-17 20:17:21,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:21,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:21,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609942452] [2025-03-17 20:17:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609942452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:21,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:21,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:17:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094217476] [2025-03-17 20:17:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:21,860 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:17:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:21,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:17:21,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:17:21,861 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. cyclomatic complexity: 30 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) [2025-03-17 20:17:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:22,005 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2025-03-17 20:17:22,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,006 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 60 [2025-03-17 20:17:22,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 101 transitions. [2025-03-17 20:17:22,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-03-17 20:17:22,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-17 20:17:22,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:22,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 101 transitions. [2025-03-17 20:17:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2025-03-17 20:17:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 43 states have internal predecessors, (64), 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) [2025-03-17 20:17:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2025-03-17 20:17:22,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-17 20:17:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:17:22,012 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-17 20:17:22,012 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:17:22,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 64 transitions. [2025-03-17 20:17:22,012 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 39 [2025-03-17 20:17:22,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:22,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:22,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:22,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:22,013 INFO L752 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);" [2025-03-17 20:17:22,013 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~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;" [2025-03-17 20:17:22,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 4 times [2025-03-17 20:17:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:22,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088641671] [2025-03-17 20:17:22,013 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:17:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:22,021 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-17 20:17:22,025 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:22,026 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:17:22,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:22,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:22,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:22,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:22,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1973761652, now seen corresponding path program 1 times [2025-03-17 20:17:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:22,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219849826] [2025-03-17 20:17:22,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:22,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:22,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:22,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:22,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:22,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:22,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:22,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:22,090 INFO L85 PathProgramCache]: Analyzing trace with hash 760345459, now seen corresponding path program 1 times [2025-03-17 20:17:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:22,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026772811] [2025-03-17 20:17:22,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:22,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:22,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:22,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:22,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:22,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:22,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026772811] [2025-03-17 20:17:22,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026772811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:22,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:22,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:17:22,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142677864] [2025-03-17 20:17:22,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:24,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:17:24,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:17:24,643 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) [2025-03-17 20:17:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:24,793 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2025-03-17 20:17:24,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 135 transitions. [2025-03-17 20:17:24,795 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 79 [2025-03-17 20:17:24,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 135 transitions. [2025-03-17 20:17:24,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2025-03-17 20:17:24,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2025-03-17 20:17:24,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 135 transitions. [2025-03-17 20:17:24,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:24,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-17 20:17:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 135 transitions. [2025-03-17 20:17:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2025-03-17 20:17:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 54 states have internal predecessors, (78), 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) [2025-03-17 20:17:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2025-03-17 20:17:24,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-03-17 20:17:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:17:24,803 INFO L432 stractBuchiCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-03-17 20:17:24,803 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:17:24,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 78 transitions. [2025-03-17 20:17:24,803 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 50 [2025-03-17 20:17:24,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:24,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:24,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:24,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:24,804 INFO L752 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);" [2025-03-17 20:17:24,807 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~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;" [2025-03-17 20:17:24,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 5 times [2025-03-17 20:17:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:24,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063226176] [2025-03-17 20:17:24,808 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:17:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:24,813 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:24,818 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:24,818 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:17:24,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:24,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:24,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:24,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:24,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:24,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:24,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:24,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash -231874837, now seen corresponding path program 1 times [2025-03-17 20:17:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371689154] [2025-03-17 20:17:24,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:24,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:24,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:24,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:24,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:24,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:24,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:24,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:24,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:24,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:24,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:24,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1792735022, now seen corresponding path program 1 times [2025-03-17 20:17:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970221103] [2025-03-17 20:17:24,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:24,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:24,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:24,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:24,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:24,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:24,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:24,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:24,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:24,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:24,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:25,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:17:25 BoogieIcfgContainer [2025-03-17 20:17:25,240 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:17:25,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:17:25,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:17:25,241 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:17:25,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:20" (3/4) ... [2025-03-17 20:17:25,243 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 20:17:25,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 20:17:25,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:17:25,267 INFO L158 Benchmark]: Toolchain (without parser) took 5223.99ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 77.6MB in the end (delta: 75.9MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,267 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:25,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.52ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 135.7MB in the end (delta: 17.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.98ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 133.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:25,268 INFO L158 Benchmark]: Boogie Preprocessor took 35.25ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 130.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,268 INFO L158 Benchmark]: IcfgBuilder took 432.26ms. Allocated memory is still 201.3MB. Free memory was 130.7MB in the beginning and 103.7MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,268 INFO L158 Benchmark]: BuchiAutomizer took 4381.92ms. Allocated memory is still 201.3MB. Free memory was 103.7MB in the beginning and 80.0MB in the end (delta: 23.7MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,269 INFO L158 Benchmark]: Witness Printer took 26.28ms. Allocated memory is still 201.3MB. Free memory was 80.0MB in the beginning and 77.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,270 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.18ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.52ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 135.7MB in the end (delta: 17.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.98ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 133.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.25ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 130.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 432.26ms. Allocated memory is still 201.3MB. Free memory was 130.7MB in the beginning and 103.7MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 4381.92ms. Allocated memory is still 201.3MB. Free memory was 103.7MB in the beginning and 80.0MB in the end (delta: 23.7MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 26.28ms. Allocated memory is still 201.3MB. Free memory was 80.0MB in the beginning and 77.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 55 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 90 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 448 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 313 mSDtfsCounter, 211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 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() [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] COND TRUE n->left && n->right [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() [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] COND TRUE n->left && n->right [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! [2025-03-17 20:17:25,283 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)