./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/psyco/psyco_security.c --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/psyco/psyco_security.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 c03d27deb00d6c25e1f99c43455f6da27475e88a721be2a7236bfffedf5da1e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:27:34,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:27:34,907 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:27:34,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:27:34,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:27:34,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:27:34,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:27:34,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:27:34,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:27:34,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:27:34,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:27:34,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:27:34,943 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:27:34,944 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:27:34,944 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:27:34,944 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:27:34,944 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:27:34,944 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:27:34,944 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:27:34,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:27:34,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:27:34,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:27:34,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:27:34,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:27:34,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:27:34,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:27:34,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:27:34,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:27:34,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:27:34,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:27:34,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:27:34,946 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:27:34,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:27:34,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:27:34,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:27:34,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:27:34,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:27:34,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:27:34,946 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:27:34,946 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 -> c03d27deb00d6c25e1f99c43455f6da27475e88a721be2a7236bfffedf5da1e8 [2025-01-10 07:27:35,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:27:35,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:27:35,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:27:35,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:27:35,238 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:27:35,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_security.c [2025-01-10 07:27:36,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af05fd906/395cdc05872a4e8abeb017d4155c641d/FLAGa0ede9eb4 [2025-01-10 07:27:36,827 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:27:36,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_security.c [2025-01-10 07:27:36,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af05fd906/395cdc05872a4e8abeb017d4155c641d/FLAGa0ede9eb4 [2025-01-10 07:27:36,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af05fd906/395cdc05872a4e8abeb017d4155c641d [2025-01-10 07:27:36,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:27:36,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:27:36,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:27:36,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:27:36,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:27:36,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:27:36" (1/1) ... [2025-01-10 07:27:36,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27194523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:36, skipping insertion in model container [2025-01-10 07:27:36,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:27:36" (1/1) ... [2025-01-10 07:27:36,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:27:37,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:27:37,087 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:27:37,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:27:37,134 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:27:37,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37 WrapperNode [2025-01-10 07:27:37,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:27:37,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:27:37,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:27:37,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:27:37,144 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:27:37" (1/1) ... [2025-01-10 07:27:37,156 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:27:37" (1/1) ... [2025-01-10 07:27:37,190 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 267 [2025-01-10 07:27:37,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:27:37,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:27:37,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:27:37,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:27:37,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,227 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-01-10 07:27:37,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:27:37,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:27:37,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:27:37,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:27:37,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (1/1) ... [2025-01-10 07:27:37,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:27:37,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:27:37,292 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:27:37,297 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:27:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:27:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:27:37,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:27:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:27:37,386 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:27:37,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:27:37,632 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-10 07:27:37,632 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:27:37,647 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:27:37,649 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2025-01-10 07:27:37,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:27:37 BoogieIcfgContainer [2025-01-10 07:27:37,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:27:37,651 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:27:37,651 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:27:37,656 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:27:37,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:27:37,656 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:27:36" (1/3) ... [2025-01-10 07:27:37,659 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@227b847f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:27:37, skipping insertion in model container [2025-01-10 07:27:37,659 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:27:37,659 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:37" (2/3) ... [2025-01-10 07:27:37,660 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@227b847f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:27:37, skipping insertion in model container [2025-01-10 07:27:37,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:27:37,660 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:27:37" (3/3) ... [2025-01-10 07:27:37,661 INFO L363 chiAutomizerObserver]: Analyzing ICFG psyco_security.c [2025-01-10 07:27:37,710 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:27:37,710 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:27:37,710 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:27:37,710 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:27:37,711 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:27:37,711 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:27:37,712 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:27:37,712 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:27:37,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 76 states have internal predecessors, (145), 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:27:37,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2025-01-10 07:27:37,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:27:37,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:27:37,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:27:37,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:27:37,740 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:27:37,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 76 states have internal predecessors, (145), 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:27:37,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2025-01-10 07:27:37,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:27:37,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:27:37,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:27:37,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:27:37,750 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);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0;" [2025-01-10 07:27:37,750 INFO L754 eck$LassoCheckResult]: Loop: "goto;" "assume !(0 == main_~q~0#1);" "assume !(1 == main_~q~0#1);" "assume !(2 == main_~q~0#1);" "assume !(3 == main_~q~0#1);" "assume !(4 == main_~q~0#1);" [2025-01-10 07:27:37,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:27:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:37,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972495714] [2025-01-10 07:27:37,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:37,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:27:37,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:27:37,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:37,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:37,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:37,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:27:37,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:27:37,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:37,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:37,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:37,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1086668748, now seen corresponding path program 1 times [2025-01-10 07:27:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:37,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665180428] [2025-01-10 07:27:37,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:37,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:37,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:27:37,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:27:37,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:37,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:37,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:37,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:27:37,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:27:37,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:37,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:37,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:37,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash 166717966, now seen corresponding path program 1 times [2025-01-10 07:27:37,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:37,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681979982] [2025-01-10 07:27:37,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:37,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:27:37,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:27:37,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:37,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:27:37,952 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:27:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:27:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681979982] [2025-01-10 07:27:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681979982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:27:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:27:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:27:37,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672655596] [2025-01-10 07:27:37,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:27:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:27:38,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:27:38,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:27:38,042 INFO L87 Difference]: Start difference. First operand has 77 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 76 states have internal predecessors, (145), 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-01-10 07:27:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:27:38,103 INFO L93 Difference]: Finished difference Result 78 states and 120 transitions. [2025-01-10 07:27:38,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 120 transitions. [2025-01-10 07:27:38,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2025-01-10 07:27:38,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 57 states and 79 transitions. [2025-01-10 07:27:38,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-01-10 07:27:38,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-01-10 07:27:38,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 79 transitions. [2025-01-10 07:27:38,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:27:38,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-01-10 07:27:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 79 transitions. [2025-01-10 07:27:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-10 07:27:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 56 states have internal predecessors, (79), 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:27:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2025-01-10 07:27:38,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-01-10 07:27:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:27:38,142 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-01-10 07:27:38,142 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:27:38,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 79 transitions. [2025-01-10 07:27:38,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2025-01-10 07:27:38,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:27:38,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:27:38,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:27:38,147 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:27:38,147 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);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0;" "goto;" [2025-01-10 07:27:38,148 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_~q~0#1;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" [2025-01-10 07:27:38,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:38,148 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:27:38,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:38,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920259835] [2025-01-10 07:27:38,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:38,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:38,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:38,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:38,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:38,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:38,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:38,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:38,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:38,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:38,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:38,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1265, now seen corresponding path program 1 times [2025-01-10 07:27:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681541608] [2025-01-10 07:27:38,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:38,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:27:38,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:27:38,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:38,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:38,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:38,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:27:38,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:27:38,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:38,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:38,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash 28694803, now seen corresponding path program 1 times [2025-01-10 07:27:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117742958] [2025-01-10 07:27:38,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:38,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:38,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:27:38,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:27:38,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:38,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:38,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:38,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:27:38,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:27:38,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:38,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:38,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:38,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:38,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:38,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:38,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:38,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:38,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:38,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:38,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:38,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:27:38 BoogieIcfgContainer [2025-01-10 07:27:38,523 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:27:38,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:27:38,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:27:38,524 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:27:38,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:27:37" (3/4) ... [2025-01-10 07:27:38,527 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:27:38,563 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:27:38,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:27:38,566 INFO L158 Benchmark]: Toolchain (without parser) took 1696.64ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 47.5MB in the end (delta: 84.2MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-10 07:27:38,566 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 226.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:27:38,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.02ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 118.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:27:38,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.46ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 117.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:27:38,567 INFO L158 Benchmark]: Boogie Preprocessor took 59.59ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 115.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:27:38,567 INFO L158 Benchmark]: RCFGBuilder took 398.96ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 97.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:27:38,568 INFO L158 Benchmark]: BuchiAutomizer took 872.29ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 50.2MB in the end (delta: 47.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 07:27:38,568 INFO L158 Benchmark]: Witness Printer took 39.81ms. Allocated memory is still 167.8MB. Free memory was 50.2MB in the beginning and 47.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:27:38,569 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 226.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.02ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 118.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.46ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 117.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.59ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 115.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 398.96ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 97.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 872.29ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 50.2MB in the end (delta: 47.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 39.81ms. Allocated memory is still 167.8MB. Free memory was 50.2MB in the beginning and 47.5MB in the end (delta: 2.7MB). 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 57 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. 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, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 117 mSDtfsCounter, 24 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: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L7] int m_initSign = 1; [L8] int m_initVerify = 2; [L9] int m_Signature = 3; [L10] int m_sign = 4; [L11] int m_verify = 5; [L12] int m_update = 6; VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5] [L17] int q = 0; [L18] int method_id; [L21] int this_state = 0; VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5, q=0, this_state=0] Loop: [L29] COND TRUE q == 0 [L30] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int m_initSign = 1; [L8] int m_initVerify = 2; [L9] int m_Signature = 3; [L10] int m_sign = 4; [L11] int m_verify = 5; [L12] int m_update = 6; VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5] [L17] int q = 0; [L18] int method_id; [L21] int this_state = 0; VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5, q=0, this_state=0] Loop: [L29] COND TRUE q == 0 [L30] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:27:38,591 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)