./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/stateful_check.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc 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/ldv-regression/stateful_check.c -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 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:27:45,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:27:45,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:27:45,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:27:45,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:27:45,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:27:45,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:27:45,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:27:45,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:27:45,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:27:45,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:27:45,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:27:45,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:27:45,190 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:27:45,190 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:27:45,191 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:27:45,191 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:27:45,191 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:27:45,191 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:27:45,191 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:27:45,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:27:45,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:27:45,192 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:27:45,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:27:45,194 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:27:45,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:27:45,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:27:45,194 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:27:45,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:27:45,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:27:45,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:27:45,194 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:27:45,195 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 -> 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e [2025-02-06 19:27:45,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:27:45,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:27:45,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:27:45,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:27:45,486 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:27:45,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/stateful_check.c [2025-02-06 19:27:46,773 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b391d9b43/2c9f3e99cc374deca2a6bd30c25729ff/FLAG24227882b [2025-02-06 19:27:47,042 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:27:47,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2025-02-06 19:27:47,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b391d9b43/2c9f3e99cc374deca2a6bd30c25729ff/FLAG24227882b [2025-02-06 19:27:47,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b391d9b43/2c9f3e99cc374deca2a6bd30c25729ff [2025-02-06 19:27:47,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:27:47,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:27:47,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:27:47,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:27:47,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:27:47,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf8b581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47, skipping insertion in model container [2025-02-06 19:27:47,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:27:47,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:27:47,275 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:27:47,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:27:47,311 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:27:47,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47 WrapperNode [2025-02-06 19:27:47,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:27:47,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:27:47,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:27:47,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:27:47,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,335 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 16, calls inlined = 22, statements flattened = 124 [2025-02-06 19:27:47,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:27:47,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:27:47,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:27:47,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:27:47,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,350 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 19:27:47,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:27:47,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:27:47,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:27:47,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:27:47,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (1/1) ... [2025-02-06 19:27:47,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:27:47,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:27:47,391 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-02-06 19:27:47,393 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-02-06 19:27:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:27:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:27:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:27:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:27:47,464 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:27:47,465 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:27:47,637 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-06 19:27:47,638 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:27:47,646 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:27:47,646 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:27:47,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:27:47 BoogieIcfgContainer [2025-02-06 19:27:47,647 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:27:47,647 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:27:47,648 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:27:47,652 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:27:47,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:27:47,653 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:27:47" (1/3) ... [2025-02-06 19:27:47,655 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e6775ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:27:47, skipping insertion in model container [2025-02-06 19:27:47,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:27:47,655 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:27:47" (2/3) ... [2025-02-06 19:27:47,656 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e6775ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:27:47, skipping insertion in model container [2025-02-06 19:27:47,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:27:47,657 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:27:47" (3/3) ... [2025-02-06 19:27:47,658 INFO L363 chiAutomizerObserver]: Analyzing ICFG stateful_check.c [2025-02-06 19:27:47,707 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:27:47,707 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:27:47,707 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:27:47,708 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:27:47,708 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:27:47,709 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:27:47,709 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:27:47,709 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:27:47,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 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-02-06 19:27:47,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-02-06 19:27:47,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:27:47,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:27:47,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:27:47,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:27:47,739 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:27:47,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 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-02-06 19:27:47,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-02-06 19:27:47,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:27:47,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:27:47,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:27:47,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:27:47,749 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(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0;" "main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1;" [2025-02-06 19:27:47,750 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet6#1;" "assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_#t~switch8#1 := 0 == main_#t~nondet7#1;" "assume main_#t~switch8#1;" "assume !(0 == main_~ldv_s_misc_fops_file_operations~0#1);" "havoc main_#t~nondet7#1;havoc main_#t~switch8#1;havoc main_#t~nondet7#1;havoc main_#t~switch8#1;" [2025-02-06 19:27:47,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:27:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash 121113, now seen corresponding path program 1 times [2025-02-06 19:27:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:27:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322269070] [2025-02-06 19:27:47,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:27:47,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:27:47,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:27:47,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:27:47,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:47,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:47,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:27:47,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:27:47,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:27:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:47,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:27:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:27:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 111616842, now seen corresponding path program 1 times [2025-02-06 19:27:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:27:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355474518] [2025-02-06 19:27:47,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:27:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:27:47,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:27:47,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:27:47,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:47,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:47,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:27:47,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:27:47,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:27:47,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:47,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:47,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:27:47,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:27:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1406744882, now seen corresponding path program 1 times [2025-02-06 19:27:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:27:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613799729] [2025-02-06 19:27:47,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:27:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:27:47,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:27:47,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:27:47,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:27:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:27:47,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:27:47,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613799729] [2025-02-06 19:27:47,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613799729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:27:47,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:27:47,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:27:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146981040] [2025-02-06 19:27:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:27:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:27:48,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:27:48,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:27:48,067 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-06 19:27:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:27:48,120 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2025-02-06 19:27:48,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 79 transitions. [2025-02-06 19:27:48,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-02-06 19:27:48,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 46 states and 62 transitions. [2025-02-06 19:27:48,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-02-06 19:27:48,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-02-06 19:27:48,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2025-02-06 19:27:48,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:27:48,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-02-06 19:27:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2025-02-06 19:27:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 19:27:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:27:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-02-06 19:27:48,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-02-06 19:27:48,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:27:48,167 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-02-06 19:27:48,168 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:27:48,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2025-02-06 19:27:48,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-02-06 19:27:48,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:27:48,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:27:48,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:27:48,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:27:48,171 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(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0;" "main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1;" [2025-02-06 19:27:48,171 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet6#1;" "assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_#t~switch8#1 := 0 == main_#t~nondet7#1;" "assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1 == main_#t~nondet7#1;" "assume main_#t~switch8#1;" "assume !(1 == main_~ldv_s_misc_fops_file_operations~0#1);" "havoc main_#t~nondet7#1;havoc main_#t~switch8#1;havoc main_#t~nondet7#1;havoc main_#t~switch8#1;" [2025-02-06 19:27:48,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:27:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 121113, now seen corresponding path program 2 times [2025-02-06 19:27:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:27:48,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457259480] [2025-02-06 19:27:48,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:27:48,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:27:48,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:27:48,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:27:48,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:27:48,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:48,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:27:48,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:27:48,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:27:48,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:48,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:48,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:27:48,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:27:48,186 INFO L85 PathProgramCache]: Analyzing trace with hash -834794376, now seen corresponding path program 1 times [2025-02-06 19:27:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:27:48,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424736885] [2025-02-06 19:27:48,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:27:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:27:48,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:27:48,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:27:48,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:48,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:48,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:27:48,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:27:48,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:27:48,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:48,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:48,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:27:48,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:27:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash 659469200, now seen corresponding path program 1 times [2025-02-06 19:27:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:27:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174885669] [2025-02-06 19:27:48,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:27:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:27:48,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:27:48,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:27:48,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:48,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:48,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:27:48,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:27:48,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:27:48,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:48,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:48,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:27:48,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:27:48,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:27:48,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:48,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:48,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:27:48,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:27:48,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:27:48,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:27:48,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:27:48,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:27:48 BoogieIcfgContainer [2025-02-06 19:27:48,486 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:27:48,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:27:48,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:27:48,487 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:27:48,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:27:47" (3/4) ... [2025-02-06 19:27:48,489 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:27:48,520 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:27:48,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:27:48,521 INFO L158 Benchmark]: Toolchain (without parser) took 1424.50ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 35.4MB in the end (delta: 69.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 19:27:48,521 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:27:48,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.51ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:27:48,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.10ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:27:48,522 INFO L158 Benchmark]: Boogie Preprocessor took 19.66ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:27:48,523 INFO L158 Benchmark]: IcfgBuilder took 286.79ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 78.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:27:48,523 INFO L158 Benchmark]: BuchiAutomizer took 838.41ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 38.6MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 19:27:48,523 INFO L158 Benchmark]: Witness Printer took 34.22ms. Allocated memory is still 142.6MB. Free memory was 37.5MB in the beginning and 35.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:27:48,525 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 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.51ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.10ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.66ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 286.79ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 78.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 838.41ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 38.6MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 34.22ms. Allocated memory is still 142.6MB. Free memory was 37.5MB in the beginning and 35.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 3 locations. The remainder module has 46 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. 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, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 51 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 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: 78]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L11] int ldv_mutex = 1; [L13] int open_called = 0; VAL [ldv_mutex=1, open_called=0] [L76] int ldv_s_misc_fops_file_operations = 0; [L77] CALL my_init() [L71] open_called = 0 [L72] return 0; VAL [ldv_mutex=1, open_called=0] [L77] RET my_init() Loop: [L78] COND TRUE __VERIFIER_nondet_int() [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 78]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L11] int ldv_mutex = 1; [L13] int open_called = 0; VAL [ldv_mutex=1, open_called=0] [L76] int ldv_s_misc_fops_file_operations = 0; [L77] CALL my_init() [L71] open_called = 0 [L72] return 0; VAL [ldv_mutex=1, open_called=0] [L77] RET my_init() Loop: [L78] COND TRUE __VERIFIER_nondet_int() [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-06 19:27:48,545 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)