./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety/test-0214.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety/test-0214.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:30:05,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:30:05,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:30:05,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:30:05,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:30:05,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:30:05,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:30:05,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:30:05,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:30:05,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:30:05,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:30:05,080 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:30:05,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:30:05,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:30:05,081 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:30:05,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:30:05,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:30:05,081 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:30:05,081 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:30:05,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:30:05,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:30:05,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:30:05,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:30:05,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:30:05,081 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:30:05,081 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-jdk21/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 -> 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 [2025-01-10 07:30:05,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:30:05,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:30:05,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:30:05,342 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:30:05,342 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:30:05,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0214.i [2025-01-10 07:30:06,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/072ea1b0d/9d31ee19663643848e51996c2e616892/FLAG61cab4354 [2025-01-10 07:30:06,738 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:30:06,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0214.i [2025-01-10 07:30:06,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/072ea1b0d/9d31ee19663643848e51996c2e616892/FLAG61cab4354 [2025-01-10 07:30:06,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/072ea1b0d/9d31ee19663643848e51996c2e616892 [2025-01-10 07:30:06,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:30:06,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:30:06,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:30:06,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:30:06,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:30:06,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:30:06" (1/1) ... [2025-01-10 07:30:06,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74dc6ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:06, skipping insertion in model container [2025-01-10 07:30:06,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:30:06" (1/1) ... [2025-01-10 07:30:06,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:30:07,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:30:07,072 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:30:07,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:30:07,147 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:30:07,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07 WrapperNode [2025-01-10 07:30:07,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:30:07,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:30:07,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:30:07,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:30:07,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,188 INFO L138 Inliner]: procedures = 181, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-01-10 07:30:07,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:30:07,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:30:07,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:30:07,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:30:07,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,233 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 7, 17]. 65 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 10 writes are split as follows [0, 5, 5]. [2025-01-10 07:30:07,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:30:07,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:30:07,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:30:07,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:30:07,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (1/1) ... [2025-01-10 07:30:07,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:30:07,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:30:07,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:30:07,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:30:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 07:30:07,338 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 07:30:07,338 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 07:30:07,338 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:30:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:30:07,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:30:07,451 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:30:07,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:30:07,455 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 07:30:07,487 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 07:30:07,501 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 07:30:07,760 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-01-10 07:30:07,760 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:30:07,766 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:30:07,766 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 07:30:07,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:30:07 BoogieIcfgContainer [2025-01-10 07:30:07,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:30:07,768 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:30:07,768 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:30:07,778 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:30:07,778 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:30:07,779 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:30:06" (1/3) ... [2025-01-10 07:30:07,780 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b37a57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:30:07, skipping insertion in model container [2025-01-10 07:30:07,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:30:07,780 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:30:07" (2/3) ... [2025-01-10 07:30:07,781 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b37a57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:30:07, skipping insertion in model container [2025-01-10 07:30:07,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:30:07,781 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:30:07" (3/3) ... [2025-01-10 07:30:07,783 INFO L363 chiAutomizerObserver]: Analyzing ICFG test-0214.i [2025-01-10 07:30:07,820 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:30:07,820 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:30:07,820 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:30:07,820 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:30:07,820 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:30:07,820 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:30:07,820 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:30:07,820 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:30:07,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:30:07,838 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-01-10 07:30:07,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:30:07,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:30:07,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:30:07,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:30:07,843 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:30:07,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:30:07,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-01-10 07:30:07,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:30:07,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:30:07,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:30:07,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:30:07,850 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(12, 2);call #Ultimate.allocInit(8, 3);~#list~0.base, ~#list~0.offset := 3, 0;call write~init~$Pointer$#2(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$#2(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1, main_#t~nondet22#1, main_#t~ret23#1, main_#t~nondet24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;" [2025-01-10 07:30:07,850 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet19#1;" "assume 0 != main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !true;" "assume !true;" [2025-01-10 07:30:07,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2025-01-10 07:30:07,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:07,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352928217] [2025-01-10 07:30:07,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:30:07,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:07,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:07,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:07,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:07,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:07,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:07,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:07,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:07,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:07,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:07,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:07,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1944463, now seen corresponding path program 1 times [2025-01-10 07:30:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212355699] [2025-01-10 07:30:07,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:30:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:07,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:30:07,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:30:07,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:07,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:30:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:30:07,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:30:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212355699] [2025-01-10 07:30:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212355699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:30:07,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:30:07,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:30:07,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614462551] [2025-01-10 07:30:07,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:30:07,993 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:30:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:30:08,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 07:30:08,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 07:30:08,015 INFO L87 Difference]: Start difference. First operand has 46 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-01-10 07:30:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:30:08,025 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-01-10 07:30:08,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2025-01-10 07:30:08,028 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-01-10 07:30:08,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 43 states and 58 transitions. [2025-01-10 07:30:08,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-01-10 07:30:08,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2025-01-10 07:30:08,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 58 transitions. [2025-01-10 07:30:08,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:30:08,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-01-10 07:30:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 58 transitions. [2025-01-10 07:30:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-10 07:30:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 40 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:30:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2025-01-10 07:30:08,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-01-10 07:30:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 07:30:08,065 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-01-10 07:30:08,067 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:30:08,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2025-01-10 07:30:08,068 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-01-10 07:30:08,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:30:08,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:30:08,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:30:08,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:30:08,068 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(12, 2);call #Ultimate.allocInit(8, 3);~#list~0.base, ~#list~0.offset := 3, 0;call write~init~$Pointer$#2(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$#2(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1, main_#t~nondet22#1, main_#t~ret23#1, main_#t~nondet24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;" [2025-01-10 07:30:08,068 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet19#1;" "assume 0 != main_#t~nondet19#1;havoc main_#t~nondet19#1;" "havoc main_#t~nondet20#1;" "assume !(0 != main_#t~nondet20#1);havoc main_#t~nondet20#1;" "havoc main_#t~nondet22#1;" "assume !(0 != main_#t~nondet22#1);havoc main_#t~nondet22#1;" [2025-01-10 07:30:08,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2025-01-10 07:30:08,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:08,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768346053] [2025-01-10 07:30:08,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:30:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:08,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:08,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:08,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:30:08,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:08,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:08,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:08,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:08,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:08,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:08,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:08,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1866812142, now seen corresponding path program 1 times [2025-01-10 07:30:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:08,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899760639] [2025-01-10 07:30:08,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:30:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:08,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:30:08,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:30:08,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:08,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:08,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:08,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:30:08,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:30:08,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:08,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:08,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:08,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1049104240, now seen corresponding path program 1 times [2025-01-10 07:30:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:08,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818029781] [2025-01-10 07:30:08,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:30:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:08,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:30:08,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:30:08,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:08,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:08,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:08,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:30:08,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:30:08,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:08,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:08,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:08,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:08,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:08,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:08,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:08,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:08,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:08,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:08,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:08,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:08,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:30:08 BoogieIcfgContainer [2025-01-10 07:30:08,423 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:30:08,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:30:08,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:30:08,424 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:30:08,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:30:07" (3/4) ... [2025-01-10 07:30:08,426 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:30:08,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:30:08,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:30:08,450 INFO L158 Benchmark]: Toolchain (without parser) took 1689.18ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 115.7MB in the end (delta: 12.0MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2025-01-10 07:30:08,452 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 192.9MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:30:08,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.40ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 106.1MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 07:30:08,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.34ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 103.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:30:08,452 INFO L158 Benchmark]: Boogie Preprocessor took 69.20ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 100.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:30:08,452 INFO L158 Benchmark]: RCFGBuilder took 507.64ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 76.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 07:30:08,453 INFO L158 Benchmark]: BuchiAutomizer took 655.50ms. Allocated memory is still 167.8MB. Free memory was 75.8MB in the beginning and 118.5MB in the end (delta: -42.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:30:08,453 INFO L158 Benchmark]: Witness Printer took 26.08ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 115.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:30:08,454 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.26ms. Allocated memory is still 192.9MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.40ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 106.1MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.34ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 103.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.20ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 100.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 507.64ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 76.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 655.50ms. Allocated memory is still 167.8MB. Free memory was 75.8MB in the beginning and 118.5MB in the end (delta: -42.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 26.08ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 115.7MB in the end (delta: 2.8MB). 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 2 locations. The remainder module has 43 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 61 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 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: 725]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L724] static list_t list; [L724] static list_t list; [L724] static list_t list; VAL [list={3:0}] Loop: [L725] COND TRUE __VERIFIER_nondet_int() [L726] COND FALSE !(__VERIFIER_nondet_int()) [L728] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 725]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L724] static list_t list; [L724] static list_t list; [L724] static list_t list; VAL [list={3:0}] Loop: [L725] COND TRUE __VERIFIER_nondet_int() [L726] COND FALSE !(__VERIFIER_nondet_int()) [L728] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:30:08,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)