./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a900e47bcb0579a731ecfed3c71b01054e5f0917c7f65049265d17494d326436 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:37:45,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:37:45,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:37:45,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:37:45,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:37:45,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:37:45,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:37:45,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:37:45,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:37:45,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:37:45,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:37:45,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:37:45,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:37:45,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:37:45,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:37:45,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:37:45,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:37:45,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:37:45,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:37:45,781 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> a900e47bcb0579a731ecfed3c71b01054e5f0917c7f65049265d17494d326436 [2025-03-13 21:37:45,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:37:45,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:37:45,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:37:45,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:37:45,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:37:45,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-03-13 21:37:47,136 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0ee87d0/dcc7a164417b4f9789e4eda47f1df5ea/FLAGa4e2f58f2 [2025-03-13 21:37:47,371 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:37:47,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-03-13 21:37:47,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0ee87d0/dcc7a164417b4f9789e4eda47f1df5ea/FLAGa4e2f58f2 [2025-03-13 21:37:47,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0ee87d0/dcc7a164417b4f9789e4eda47f1df5ea [2025-03-13 21:37:47,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:37:47,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:37:47,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:37:47,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:37:47,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:37:47,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a274b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47, skipping insertion in model container [2025-03-13 21:37:47,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:37:47,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-03-13 21:37:47,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:37:47,619 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:37:47,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-03-13 21:37:47,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:37:47,666 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:37:47,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47 WrapperNode [2025-03-13 21:37:47,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:37:47,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:37:47,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:37:47,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:37:47,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,701 INFO L138 Inliner]: procedures = 162, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2025-03-13 21:37:47,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:37:47,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:37:47,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:37:47,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:37:47,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,732 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-13 21:37:47,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:37:47,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:37:47,747 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:37:47,747 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:37:47,748 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (1/1) ... [2025-03-13 21:37:47,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:37:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:37:47,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:37:47,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:37:47,803 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-13 21:37:47,803 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-13 21:37:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:37:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:37:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:37:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:37:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:37:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-13 21:37:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:37:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:37:47,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:37:47,805 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:37:47,910 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:37:47,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:37:48,120 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:37:48,120 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:37:48,120 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:37:48,254 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:37:48,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:37:48 BoogieIcfgContainer [2025-03-13 21:37:48,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:37:48,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:37:48,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:37:48,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:37:48,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:37:47" (1/3) ... [2025-03-13 21:37:48,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60eac446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:37:48, skipping insertion in model container [2025-03-13 21:37:48,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:47" (2/3) ... [2025-03-13 21:37:48,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60eac446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:37:48, skipping insertion in model container [2025-03-13 21:37:48,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:37:48" (3/3) ... [2025-03-13 21:37:48,262 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2025-03-13 21:37:48,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:37:48,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_29-multiple-protecting2-vesal_true.i that has 2 procedures, 48 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-13 21:37:48,275 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:37:48,317 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 21:37:48,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 50 transitions, 107 flow [2025-03-13 21:37:48,379 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2025-03-13 21:37:48,381 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:37:48,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 49 events. 3/49 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-13 21:37:48,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 50 transitions, 107 flow [2025-03-13 21:37:48,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 79 flow [2025-03-13 21:37:48,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:37:48,406 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f654ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:37:48,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:37:48,416 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:37:48,416 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-13 21:37:48,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:37:48,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:48,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:48,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:37:48,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash -660697210, now seen corresponding path program 1 times [2025-03-13 21:37:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:48,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572289462] [2025-03-13 21:37:48,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:48,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:37:48,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:37:48,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:48,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:37:48,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:48,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572289462] [2025-03-13 21:37:48,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572289462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:48,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:48,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:37:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994031890] [2025-03-13 21:37:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:48,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:37:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:48,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:37:48,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:37:48,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-03-13 21:37:48,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:48,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:48,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-03-13 21:37:48,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:48,981 INFO L124 PetriNetUnfolderBase]: 132/344 cut-off events. [2025-03-13 21:37:48,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:37:48,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 344 events. 132/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1522 event pairs, 61 based on Foata normal form. 14/343 useless extension candidates. Maximal degree in co-relation 631. Up to 128 conditions per place. [2025-03-13 21:37:48,987 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 39 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2025-03-13 21:37:48,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 223 flow [2025-03-13 21:37:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:37:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:37:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-13 21:37:49,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-13 21:37:49,001 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 79 flow. Second operand 5 states and 125 transitions. [2025-03-13 21:37:49,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 223 flow [2025-03-13 21:37:49,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:37:49,009 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 138 flow [2025-03-13 21:37:49,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-13 21:37:49,015 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-03-13 21:37:49,016 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 138 flow [2025-03-13 21:37:49,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:49,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:49,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:49,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:37:49,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:37:49,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash 725200229, now seen corresponding path program 1 times [2025-03-13 21:37:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388164179] [2025-03-13 21:37:49,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:49,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:37:49,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:37:49,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:49,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:37:49,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388164179] [2025-03-13 21:37:49,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388164179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:49,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:49,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:37:49,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840570698] [2025-03-13 21:37:49,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:49,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:37:49,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:49,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:37:49,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:37:49,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-03-13 21:37:49,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:49,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:49,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-03-13 21:37:49,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:49,276 INFO L124 PetriNetUnfolderBase]: 135/347 cut-off events. [2025-03-13 21:37:49,276 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-13 21:37:49,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 347 events. 135/347 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1585 event pairs, 34 based on Foata normal form. 10/356 useless extension candidates. Maximal degree in co-relation 789. Up to 184 conditions per place. [2025-03-13 21:37:49,280 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 44 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2025-03-13 21:37:49,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 336 flow [2025-03-13 21:37:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:37:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:37:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-13 21:37:49,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484 [2025-03-13 21:37:49,284 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 138 flow. Second operand 5 states and 121 transitions. [2025-03-13 21:37:49,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 336 flow [2025-03-13 21:37:49,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:37:49,287 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 226 flow [2025-03-13 21:37:49,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-03-13 21:37:49,288 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-03-13 21:37:49,288 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 226 flow [2025-03-13 21:37:49,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:49,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:49,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:49,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:37:49,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:37:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -248902302, now seen corresponding path program 1 times [2025-03-13 21:37:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643264053] [2025-03-13 21:37:49,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:49,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:49,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:37:49,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:37:49,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:49,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:37:49,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:49,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643264053] [2025-03-13 21:37:49,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643264053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:49,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:49,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:37:49,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553064276] [2025-03-13 21:37:49,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:49,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:37:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:49,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:37:49,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:37:49,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-03-13 21:37:49,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:49,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:49,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-03-13 21:37:49,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:49,548 INFO L124 PetriNetUnfolderBase]: 131/343 cut-off events. [2025-03-13 21:37:49,548 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-13 21:37:49,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 343 events. 131/343 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1505 event pairs, 34 based on Foata normal form. 17/359 useless extension candidates. Maximal degree in co-relation 910. Up to 154 conditions per place. [2025-03-13 21:37:49,552 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 46 selfloop transitions, 10 changer transitions 1/66 dead transitions. [2025-03-13 21:37:49,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 399 flow [2025-03-13 21:37:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:37:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:37:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-03-13 21:37:49,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-03-13 21:37:49,554 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 226 flow. Second operand 6 states and 134 transitions. [2025-03-13 21:37:49,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 399 flow [2025-03-13 21:37:49,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:37:49,560 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 281 flow [2025-03-13 21:37:49,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2025-03-13 21:37:49,561 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-03-13 21:37:49,561 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 281 flow [2025-03-13 21:37:49,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:49,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:49,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:37:49,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:37:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -599418813, now seen corresponding path program 1 times [2025-03-13 21:37:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684940582] [2025-03-13 21:37:49,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:49,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:37:49,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:37:49,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:49,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:37:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684940582] [2025-03-13 21:37:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684940582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:49,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:37:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581546446] [2025-03-13 21:37:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:49,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:37:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:37:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:37:49,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-03-13 21:37:49,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:49,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:49,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-03-13 21:37:49,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:49,817 INFO L124 PetriNetUnfolderBase]: 126/317 cut-off events. [2025-03-13 21:37:49,818 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2025-03-13 21:37:49,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 317 events. 126/317 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1337 event pairs, 20 based on Foata normal form. 4/320 useless extension candidates. Maximal degree in co-relation 948. Up to 84 conditions per place. [2025-03-13 21:37:49,820 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 47 selfloop transitions, 17 changer transitions 0/72 dead transitions. [2025-03-13 21:37:49,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 485 flow [2025-03-13 21:37:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:37:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:37:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2025-03-13 21:37:49,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43 [2025-03-13 21:37:49,822 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 281 flow. Second operand 8 states and 172 transitions. [2025-03-13 21:37:49,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 485 flow [2025-03-13 21:37:49,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 449 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-13 21:37:49,830 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 283 flow [2025-03-13 21:37:49,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2025-03-13 21:37:49,831 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-03-13 21:37:49,831 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 283 flow [2025-03-13 21:37:49,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:49,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:49,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:49,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:37:49,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:37:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 634053184, now seen corresponding path program 1 times [2025-03-13 21:37:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550319165] [2025-03-13 21:37:49,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:49,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:37:49,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:37:49,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:49,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:49,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-03-13 21:37:49,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:49,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550319165] [2025-03-13 21:37:49,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550319165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:49,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:49,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:37:49,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040802508] [2025-03-13 21:37:49,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:49,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:37:49,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:49,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:37:49,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:37:49,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-13 21:37:49,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:49,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:49,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-13 21:37:49,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:50,020 INFO L124 PetriNetUnfolderBase]: 53/187 cut-off events. [2025-03-13 21:37:50,020 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-03-13 21:37:50,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 187 events. 53/187 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 684 event pairs, 16 based on Foata normal form. 19/203 useless extension candidates. Maximal degree in co-relation 517. Up to 77 conditions per place. [2025-03-13 21:37:50,022 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 29 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2025-03-13 21:37:50,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 359 flow [2025-03-13 21:37:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:37:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:37:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-13 21:37:50,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-03-13 21:37:50,025 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 283 flow. Second operand 4 states and 116 transitions. [2025-03-13 21:37:50,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 359 flow [2025-03-13 21:37:50,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 306 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-13 21:37:50,027 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 224 flow [2025-03-13 21:37:50,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-03-13 21:37:50,028 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-03-13 21:37:50,028 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 224 flow [2025-03-13 21:37:50,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:50,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:50,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:37:50,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:37:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1016736142, now seen corresponding path program 1 times [2025-03-13 21:37:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:50,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349129544] [2025-03-13 21:37:50,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:50,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:37:50,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:37:50,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:50,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:37:50,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:50,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349129544] [2025-03-13 21:37:50,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349129544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:50,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:50,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:37:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686683580] [2025-03-13 21:37:50,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:50,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:37:50,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:50,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:37:50,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:37:50,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-13 21:37:50,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:50,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:50,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-13 21:37:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:50,254 INFO L124 PetriNetUnfolderBase]: 42/160 cut-off events. [2025-03-13 21:37:50,255 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-13 21:37:50,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 160 events. 42/160 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 501 event pairs, 8 based on Foata normal form. 9/169 useless extension candidates. Maximal degree in co-relation 453. Up to 72 conditions per place. [2025-03-13 21:37:50,257 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 35 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-03-13 21:37:50,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 362 flow [2025-03-13 21:37:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:37:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:37:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-03-13 21:37:50,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555 [2025-03-13 21:37:50,258 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 224 flow. Second operand 4 states and 111 transitions. [2025-03-13 21:37:50,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 362 flow [2025-03-13 21:37:50,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 359 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:37:50,261 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 231 flow [2025-03-13 21:37:50,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2025-03-13 21:37:50,262 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-03-13 21:37:50,263 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 231 flow [2025-03-13 21:37:50,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:50,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:50,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:50,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:37:50,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:37:50,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1855209775, now seen corresponding path program 1 times [2025-03-13 21:37:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:50,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506696240] [2025-03-13 21:37:50,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:50,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:37:50,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:37:50,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:50,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:37:50,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:50,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506696240] [2025-03-13 21:37:50,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506696240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:50,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:50,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:37:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836451049] [2025-03-13 21:37:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:50,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:37:50,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:50,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:37:50,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:37:50,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-03-13 21:37:50,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:50,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:50,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-03-13 21:37:50,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:50,488 INFO L124 PetriNetUnfolderBase]: 50/164 cut-off events. [2025-03-13 21:37:50,488 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-13 21:37:50,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 164 events. 50/164 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 526 event pairs, 21 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 526. Up to 75 conditions per place. [2025-03-13 21:37:50,489 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2025-03-13 21:37:50,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 338 flow [2025-03-13 21:37:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:37:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:37:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-03-13 21:37:50,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-13 21:37:50,492 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 231 flow. Second operand 6 states and 120 transitions. [2025-03-13 21:37:50,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 338 flow [2025-03-13 21:37:50,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:37:50,494 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-03-13 21:37:50,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-03-13 21:37:50,494 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2025-03-13 21:37:50,494 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-03-13 21:37:50,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:37:50,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-13 21:37:50,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-13 21:37:50,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-13 21:37:50,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-13 21:37:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:37:50,497 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:50,499 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:37:50,499 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:37:50,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:37:50 BasicIcfg [2025-03-13 21:37:50,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:37:50,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:37:50,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:37:50,503 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:37:50,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:37:48" (3/4) ... [2025-03-13 21:37:50,505 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:37:50,507 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-03-13 21:37:50,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-03-13 21:37:50,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-13 21:37:50,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:37:50,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:37:50,563 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:37:50,563 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:37:50,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:37:50,564 INFO L158 Benchmark]: Toolchain (without parser) took 3168.48ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 123.4MB in the end (delta: -3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:37:50,564 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 192.9MB. Free memory is still 111.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:37:50,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.73ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 99.8MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 21:37:50,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.13ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 98.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:37:50,565 INFO L158 Benchmark]: Boogie Preprocessor took 42.49ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 96.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:37:50,565 INFO L158 Benchmark]: IcfgBuilder took 507.34ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 57.1MB in the end (delta: 39.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 21:37:50,565 INFO L158 Benchmark]: TraceAbstraction took 2246.86ms. Allocated memory is still 167.8MB. Free memory was 56.5MB in the beginning and 128.0MB in the end (delta: -71.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2025-03-13 21:37:50,565 INFO L158 Benchmark]: Witness Printer took 60.24ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 123.4MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:37:50,566 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 192.9MB. Free memory is still 111.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.73ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 99.8MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.13ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 98.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.49ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 96.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 507.34ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 57.1MB in the end (delta: 39.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2246.86ms. Allocated memory is still 167.8MB. Free memory was 56.5MB in the beginning and 128.0MB in the end (delta: -71.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 60.24ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 123.4MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 63 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 22 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 21:37:50,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE