./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe008_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/pthread-wmm/safe008_tso.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 3447fa4cbed8c2dd9f8bb92c4d44acca15639ccfd4d81b58d710cf11090f115c --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:52:56,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:52:56,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:52:56,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:52:56,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:52:56,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:52:56,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:52:56,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:52:56,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:52:56,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:52:56,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:52:56,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:52:56,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:52:56,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:52:56,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:52:56,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:52:56,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:52:56,915 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:52:56,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:52:56,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:52:56,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:52:56,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:52:56,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:52:56,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:52:56,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:52:56,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:52:56,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:52:56,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:52:56,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:52:56,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:52:56,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:52:56,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:52:56,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:52:56,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:52:56,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:52:56,918 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 -> 3447fa4cbed8c2dd9f8bb92c4d44acca15639ccfd4d81b58d710cf11090f115c [2025-03-14 00:52:57,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:52:57,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:52:57,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:52:57,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:52:57,175 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:52:57,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe008_tso.i [2025-03-14 00:52:58,283 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa6f9972/67fcb474bc274a978a1c498d8927cb34/FLAGac517dfe9 [2025-03-14 00:52:58,562 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:52:58,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_tso.i [2025-03-14 00:52:58,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa6f9972/67fcb474bc274a978a1c498d8927cb34/FLAGac517dfe9 [2025-03-14 00:52:58,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa6f9972/67fcb474bc274a978a1c498d8927cb34 [2025-03-14 00:52:58,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:52:58,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:52:58,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:52:58,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:52:58,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:52:58,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:52:58" (1/1) ... [2025-03-14 00:52:58,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc72b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:58, skipping insertion in model container [2025-03-14 00:52:58,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:52:58" (1/1) ... [2025-03-14 00:52:58,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:52:59,042 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/pthread-wmm/safe008_tso.i[945,958] [2025-03-14 00:52:59,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:52:59,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:52:59,209 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/pthread-wmm/safe008_tso.i[945,958] [2025-03-14 00:52:59,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:52:59,262 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:52:59,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59 WrapperNode [2025-03-14 00:52:59,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:52:59,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:52:59,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:52:59,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:52:59,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,290 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-03-14 00:52:59,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:52:59,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:52:59,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:52:59,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:52:59,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,305 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-03-14 00:52:59,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:52:59,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:52:59,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:52:59,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:52:59,316 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (1/1) ... [2025-03-14 00:52:59,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:52:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:52:59,340 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-14 00:52:59,343 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-14 00:52:59,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:52:59,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:52:59,359 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:52:59,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:52:59,359 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:52:59,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:52:59,359 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:52:59,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:52:59,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:52:59,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:52:59,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:52:59,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:52:59,360 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:52:59,445 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:52:59,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:52:59,544 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:52:59,545 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:52:59,545 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:52:59,642 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:52:59,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:52:59 BoogieIcfgContainer [2025-03-14 00:52:59,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:52:59,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:52:59,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:52:59,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:52:59,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:52:58" (1/3) ... [2025-03-14 00:52:59,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8fe5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:52:59, skipping insertion in model container [2025-03-14 00:52:59,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:59" (2/3) ... [2025-03-14 00:52:59,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8fe5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:52:59, skipping insertion in model container [2025-03-14 00:52:59,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:52:59" (3/3) ... [2025-03-14 00:52:59,652 INFO L128 eAbstractionObserver]: Analyzing ICFG safe008_tso.i [2025-03-14 00:52:59,665 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:52:59,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe008_tso.i that has 4 procedures, 38 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 00:52:59,666 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:52:59,695 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:52:59,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2025-03-14 00:52:59,752 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-03-14 00:52:59,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:52:59,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-14 00:52:59,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2025-03-14 00:52:59,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-03-14 00:52:59,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:52:59,776 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;@55fac12b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:52:59,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:52:59,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:52:59,790 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-14 00:52:59,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:52:59,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:59,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:59,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:52:59,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1759975644, now seen corresponding path program 1 times [2025-03-14 00:52:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957115332] [2025-03-14 00:52:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:52:59,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:59,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:52:59,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:52:59,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:52:59,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:00,275 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-14 00:53:00,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957115332] [2025-03-14 00:53:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957115332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:00,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:53:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683202368] [2025-03-14 00:53:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:00,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:53:00,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:00,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:53:00,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:53:00,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:00,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-14 00:53:00,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:00,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:00,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:01,357 INFO L124 PetriNetUnfolderBase]: 8181/12037 cut-off events. [2025-03-14 00:53:01,358 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 00:53:01,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23951 conditions, 12037 events. 8181/12037 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 71185 event pairs, 2697 based on Foata normal form. 356/12393 useless extension candidates. Maximal degree in co-relation 23940. Up to 6007 conditions per place. [2025-03-14 00:53:01,428 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 47 selfloop transitions, 5 changer transitions 61/117 dead transitions. [2025-03-14 00:53:01,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 117 transitions, 475 flow [2025-03-14 00:53:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:53:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:53:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2025-03-14 00:53:01,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6165413533834586 [2025-03-14 00:53:01,445 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 7 states and 164 transitions. [2025-03-14 00:53:01,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 117 transitions, 475 flow [2025-03-14 00:53:01,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 117 transitions, 470 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:53:01,455 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 119 flow [2025-03-14 00:53:01,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2025-03-14 00:53:01,460 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2025-03-14 00:53:01,461 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 119 flow [2025-03-14 00:53:01,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-14 00:53:01,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:01,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:01,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:53:01,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2136258555, now seen corresponding path program 1 times [2025-03-14 00:53:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:01,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349086286] [2025-03-14 00:53:01,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:01,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:53:01,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:53:01,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:01,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:01,653 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-14 00:53:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349086286] [2025-03-14 00:53:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349086286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:01,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:01,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980014231] [2025-03-14 00:53:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:01,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:01,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:01,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:01,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:01,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:53:01,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:01,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:01,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:02,531 INFO L124 PetriNetUnfolderBase]: 7600/11232 cut-off events. [2025-03-14 00:53:02,532 INFO L125 PetriNetUnfolderBase]: For 6589/6589 co-relation queries the response was YES. [2025-03-14 00:53:02,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28124 conditions, 11232 events. 7600/11232 cut-off events. For 6589/6589 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 64347 event pairs, 780 based on Foata normal form. 310/11535 useless extension candidates. Maximal degree in co-relation 28109. Up to 4973 conditions per place. [2025-03-14 00:53:02,670 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 58 selfloop transitions, 6 changer transitions 80/148 dead transitions. [2025-03-14 00:53:02,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 148 transitions, 751 flow [2025-03-14 00:53:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:53:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:53:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2025-03-14 00:53:02,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5631578947368421 [2025-03-14 00:53:02,673 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 119 flow. Second operand 10 states and 214 transitions. [2025-03-14 00:53:02,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 148 transitions, 751 flow [2025-03-14 00:53:02,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 148 transitions, 724 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-14 00:53:02,751 INFO L231 Difference]: Finished difference. Result has 60 places, 37 transitions, 162 flow [2025-03-14 00:53:02,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=162, PETRI_PLACES=60, PETRI_TRANSITIONS=37} [2025-03-14 00:53:02,753 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2025-03-14 00:53:02,753 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 162 flow [2025-03-14 00:53:02,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:53:02,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:02,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:02,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:53:02,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:02,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 472129821, now seen corresponding path program 1 times [2025-03-14 00:53:02,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:02,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994952652] [2025-03-14 00:53:02,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:02,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:02,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:53:02,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:53:02,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:02,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:02,915 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-14 00:53:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994952652] [2025-03-14 00:53:02,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994952652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:02,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:02,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:02,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226381666] [2025-03-14 00:53:02,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:02,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:02,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:02,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:02,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:02,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 37 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:53:02,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:02,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:02,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:03,869 INFO L124 PetriNetUnfolderBase]: 8180/11957 cut-off events. [2025-03-14 00:53:03,869 INFO L125 PetriNetUnfolderBase]: For 20952/20952 co-relation queries the response was YES. [2025-03-14 00:53:03,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33784 conditions, 11957 events. 8180/11957 cut-off events. For 20952/20952 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 69127 event pairs, 632 based on Foata normal form. 355/12312 useless extension candidates. Maximal degree in co-relation 33762. Up to 3897 conditions per place. [2025-03-14 00:53:03,934 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 78 selfloop transitions, 14 changer transitions 104/200 dead transitions. [2025-03-14 00:53:03,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 200 transitions, 1173 flow [2025-03-14 00:53:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:53:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:53:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 280 transitions. [2025-03-14 00:53:03,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5668016194331984 [2025-03-14 00:53:03,940 INFO L175 Difference]: Start difference. First operand has 60 places, 37 transitions, 162 flow. Second operand 13 states and 280 transitions. [2025-03-14 00:53:03,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 200 transitions, 1173 flow [2025-03-14 00:53:04,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 200 transitions, 1072 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-03-14 00:53:04,003 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 302 flow [2025-03-14 00:53:04,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=302, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2025-03-14 00:53:04,004 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2025-03-14 00:53:04,005 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 302 flow [2025-03-14 00:53:04,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:53:04,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:04,005 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-14 00:53:04,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:53:04,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:04,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:04,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1670245662, now seen corresponding path program 1 times [2025-03-14 00:53:04,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:04,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174172878] [2025-03-14 00:53:04,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:04,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:04,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:53:04,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:53:04,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:04,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:04,126 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-14 00:53:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174172878] [2025-03-14 00:53:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174172878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131642179] [2025-03-14 00:53:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:04,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:04,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:04,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:04,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:04,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 45 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-14 00:53:04,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:04,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:04,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:05,015 INFO L124 PetriNetUnfolderBase]: 7480/11027 cut-off events. [2025-03-14 00:53:05,015 INFO L125 PetriNetUnfolderBase]: For 40749/40749 co-relation queries the response was YES. [2025-03-14 00:53:05,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36756 conditions, 11027 events. 7480/11027 cut-off events. For 40749/40749 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 62201 event pairs, 927 based on Foata normal form. 270/11295 useless extension candidates. Maximal degree in co-relation 36726. Up to 5246 conditions per place. [2025-03-14 00:53:05,059 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 66 selfloop transitions, 10 changer transitions 72/152 dead transitions. [2025-03-14 00:53:05,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 152 transitions, 1033 flow [2025-03-14 00:53:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:53:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:53:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2025-03-14 00:53:05,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5342105263157895 [2025-03-14 00:53:05,061 INFO L175 Difference]: Start difference. First operand has 72 places, 45 transitions, 302 flow. Second operand 10 states and 203 transitions. [2025-03-14 00:53:05,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 152 transitions, 1033 flow [2025-03-14 00:53:05,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 152 transitions, 941 flow, removed 46 selfloop flow, removed 8 redundant places. [2025-03-14 00:53:05,173 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 360 flow [2025-03-14 00:53:05,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=360, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2025-03-14 00:53:05,173 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2025-03-14 00:53:05,173 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 360 flow [2025-03-14 00:53:05,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-14 00:53:05,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:05,174 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-14 00:53:05,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:53:05,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:05,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1133186082, now seen corresponding path program 1 times [2025-03-14 00:53:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:05,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621171991] [2025-03-14 00:53:05,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:05,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:53:05,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:53:05,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:05,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:05,279 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-14 00:53:05,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:05,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621171991] [2025-03-14 00:53:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621171991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:05,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414674935] [2025-03-14 00:53:05,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:05,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:05,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:05,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:05,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-14 00:53:05,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:05,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:05,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:06,294 INFO L124 PetriNetUnfolderBase]: 9695/14198 cut-off events. [2025-03-14 00:53:06,296 INFO L125 PetriNetUnfolderBase]: For 46414/46418 co-relation queries the response was YES. [2025-03-14 00:53:06,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45649 conditions, 14198 events. 9695/14198 cut-off events. For 46414/46418 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 82374 event pairs, 1643 based on Foata normal form. 395/14593 useless extension candidates. Maximal degree in co-relation 45616. Up to 4688 conditions per place. [2025-03-14 00:53:06,351 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 91 selfloop transitions, 24 changer transitions 109/228 dead transitions. [2025-03-14 00:53:06,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 228 transitions, 1844 flow [2025-03-14 00:53:06,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:53:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:53:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 275 transitions. [2025-03-14 00:53:06,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5566801619433198 [2025-03-14 00:53:06,356 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 360 flow. Second operand 13 states and 275 transitions. [2025-03-14 00:53:06,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 228 transitions, 1844 flow [2025-03-14 00:53:06,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 228 transitions, 1744 flow, removed 46 selfloop flow, removed 7 redundant places. [2025-03-14 00:53:06,537 INFO L231 Difference]: Finished difference. Result has 84 places, 62 transitions, 637 flow [2025-03-14 00:53:06,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=637, PETRI_PLACES=84, PETRI_TRANSITIONS=62} [2025-03-14 00:53:06,538 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2025-03-14 00:53:06,538 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 637 flow [2025-03-14 00:53:06,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-14 00:53:06,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:06,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:06,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:53:06,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:06,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1579311430, now seen corresponding path program 1 times [2025-03-14 00:53:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:06,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241505711] [2025-03-14 00:53:06,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:06,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:53:06,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:53:06,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:06,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:06,646 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-14 00:53:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:06,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241505711] [2025-03-14 00:53:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241505711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:06,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572616986] [2025-03-14 00:53:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:06,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:06,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:06,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:06,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:06,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 62 transitions, 637 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:53:06,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:06,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:06,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:07,594 INFO L124 PetriNetUnfolderBase]: 8425/12489 cut-off events. [2025-03-14 00:53:07,594 INFO L125 PetriNetUnfolderBase]: For 46459/46461 co-relation queries the response was YES. [2025-03-14 00:53:07,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42082 conditions, 12489 events. 8425/12489 cut-off events. For 46459/46461 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 72226 event pairs, 1782 based on Foata normal form. 200/12689 useless extension candidates. Maximal degree in co-relation 42043. Up to 7636 conditions per place. [2025-03-14 00:53:07,681 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 67 selfloop transitions, 24 changer transitions 66/161 dead transitions. [2025-03-14 00:53:07,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 161 transitions, 1536 flow [2025-03-14 00:53:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:53:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:53:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2025-03-14 00:53:07,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5105263157894737 [2025-03-14 00:53:07,684 INFO L175 Difference]: Start difference. First operand has 84 places, 62 transitions, 637 flow. Second operand 10 states and 194 transitions. [2025-03-14 00:53:07,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 161 transitions, 1536 flow [2025-03-14 00:53:07,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 161 transitions, 1460 flow, removed 38 selfloop flow, removed 10 redundant places. [2025-03-14 00:53:07,844 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 732 flow [2025-03-14 00:53:07,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=732, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-03-14 00:53:07,845 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2025-03-14 00:53:07,846 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 732 flow [2025-03-14 00:53:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:53:07,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:07,846 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] [2025-03-14 00:53:07,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:53:07,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:07,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 979095647, now seen corresponding path program 1 times [2025-03-14 00:53:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483398641] [2025-03-14 00:53:07,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:07,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:53:07,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:53:07,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:07,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:53:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483398641] [2025-03-14 00:53:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483398641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:07,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:53:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526085854] [2025-03-14 00:53:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:53:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:07,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:53:07,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:53:07,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:07,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 732 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-14 00:53:07,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:07,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:07,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:09,272 INFO L124 PetriNetUnfolderBase]: 10620/15717 cut-off events. [2025-03-14 00:53:09,273 INFO L125 PetriNetUnfolderBase]: For 55467/55473 co-relation queries the response was YES. [2025-03-14 00:53:09,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50570 conditions, 15717 events. 10620/15717 cut-off events. For 55467/55473 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 96044 event pairs, 1755 based on Foata normal form. 227/15944 useless extension candidates. Maximal degree in co-relation 50532. Up to 6432 conditions per place. [2025-03-14 00:53:09,325 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 69 selfloop transitions, 8 changer transitions 93/174 dead transitions. [2025-03-14 00:53:09,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 174 transitions, 1656 flow [2025-03-14 00:53:09,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:53:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:53:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2025-03-14 00:53:09,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-03-14 00:53:09,326 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 732 flow. Second operand 9 states and 189 transitions. [2025-03-14 00:53:09,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 174 transitions, 1656 flow [2025-03-14 00:53:09,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 174 transitions, 1572 flow, removed 28 selfloop flow, removed 7 redundant places. [2025-03-14 00:53:09,457 INFO L231 Difference]: Finished difference. Result has 83 places, 46 transitions, 402 flow [2025-03-14 00:53:09,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=402, PETRI_PLACES=83, PETRI_TRANSITIONS=46} [2025-03-14 00:53:09,457 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-03-14 00:53:09,457 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 46 transitions, 402 flow [2025-03-14 00:53:09,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-14 00:53:09,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:09,458 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] [2025-03-14 00:53:09,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:53:09,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:09,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash -57661747, now seen corresponding path program 1 times [2025-03-14 00:53:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:09,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584068388] [2025-03-14 00:53:09,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:09,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:53:09,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:53:09,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:09,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:09,560 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-14 00:53:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584068388] [2025-03-14 00:53:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584068388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:09,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:09,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:09,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10792667] [2025-03-14 00:53:09,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:09,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:09,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:09,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:09,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 46 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-14 00:53:09,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:09,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:09,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:10,028 INFO L124 PetriNetUnfolderBase]: 5121/7678 cut-off events. [2025-03-14 00:53:10,028 INFO L125 PetriNetUnfolderBase]: For 28283/28284 co-relation queries the response was YES. [2025-03-14 00:53:10,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23948 conditions, 7678 events. 5121/7678 cut-off events. For 28283/28284 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 40925 event pairs, 1198 based on Foata normal form. 180/7857 useless extension candidates. Maximal degree in co-relation 23908. Up to 2892 conditions per place. [2025-03-14 00:53:10,062 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 44 selfloop transitions, 3 changer transitions 63/114 dead transitions. [2025-03-14 00:53:10,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 114 transitions, 914 flow [2025-03-14 00:53:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:53:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:53:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2025-03-14 00:53:10,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-03-14 00:53:10,064 INFO L175 Difference]: Start difference. First operand has 83 places, 46 transitions, 402 flow. Second operand 8 states and 154 transitions. [2025-03-14 00:53:10,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 114 transitions, 914 flow [2025-03-14 00:53:10,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 114 transitions, 726 flow, removed 45 selfloop flow, removed 18 redundant places. [2025-03-14 00:53:10,131 INFO L231 Difference]: Finished difference. Result has 74 places, 32 transitions, 154 flow [2025-03-14 00:53:10,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=74, PETRI_TRANSITIONS=32} [2025-03-14 00:53:10,131 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2025-03-14 00:53:10,131 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 32 transitions, 154 flow [2025-03-14 00:53:10,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-14 00:53:10,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:10,132 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] [2025-03-14 00:53:10,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:53:10,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:10,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1411170847, now seen corresponding path program 1 times [2025-03-14 00:53:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:10,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118889531] [2025-03-14 00:53:10,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:10,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 00:53:10,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 00:53:10,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:10,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:10,201 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-14 00:53:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:10,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118889531] [2025-03-14 00:53:10,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118889531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:10,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:10,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:53:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562589836] [2025-03-14 00:53:10,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:10,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:53:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:10,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:53:10,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:53:10,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:53:10,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 32 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-14 00:53:10,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:10,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:53:10,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:10,353 INFO L124 PetriNetUnfolderBase]: 1375/2257 cut-off events. [2025-03-14 00:53:10,354 INFO L125 PetriNetUnfolderBase]: For 3420/3421 co-relation queries the response was YES. [2025-03-14 00:53:10,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6126 conditions, 2257 events. 1375/2257 cut-off events. For 3420/3421 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11178 event pairs, 253 based on Foata normal form. 106/2363 useless extension candidates. Maximal degree in co-relation 6096. Up to 1127 conditions per place. [2025-03-14 00:53:10,362 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 44 selfloop transitions, 4 changer transitions 8/61 dead transitions. [2025-03-14 00:53:10,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 61 transitions, 398 flow [2025-03-14 00:53:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:53:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:53:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-03-14 00:53:10,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2025-03-14 00:53:10,363 INFO L175 Difference]: Start difference. First operand has 74 places, 32 transitions, 154 flow. Second operand 4 states and 94 transitions. [2025-03-14 00:53:10,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 61 transitions, 398 flow [2025-03-14 00:53:10,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 282 flow, removed 21 selfloop flow, removed 22 redundant places. [2025-03-14 00:53:10,368 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 116 flow [2025-03-14 00:53:10,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-14 00:53:10,368 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2025-03-14 00:53:10,368 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 116 flow [2025-03-14 00:53:10,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-14 00:53:10,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:10,369 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-14 00:53:10,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:53:10,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2027098422, now seen corresponding path program 1 times [2025-03-14 00:53:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649258039] [2025-03-14 00:53:10,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:10,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 00:53:10,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 00:53:10,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:10,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:10,439 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-14 00:53:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649258039] [2025-03-14 00:53:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649258039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:10,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:53:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297156201] [2025-03-14 00:53:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:53:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:10,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:53:10,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:53:10,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:53:10,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:53:10,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:10,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:53:10,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:10,554 INFO L124 PetriNetUnfolderBase]: 831/1375 cut-off events. [2025-03-14 00:53:10,555 INFO L125 PetriNetUnfolderBase]: For 488/489 co-relation queries the response was YES. [2025-03-14 00:53:10,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3683 conditions, 1375 events. 831/1375 cut-off events. For 488/489 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5965 event pairs, 127 based on Foata normal form. 76/1451 useless extension candidates. Maximal degree in co-relation 3669. Up to 445 conditions per place. [2025-03-14 00:53:10,558 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 42 selfloop transitions, 6 changer transitions 18/71 dead transitions. [2025-03-14 00:53:10,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 369 flow [2025-03-14 00:53:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:53:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:53:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-14 00:53:10,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5947368421052631 [2025-03-14 00:53:10,558 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 116 flow. Second operand 5 states and 113 transitions. [2025-03-14 00:53:10,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 369 flow [2025-03-14 00:53:10,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 360 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 00:53:10,560 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 134 flow [2025-03-14 00:53:10,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2025-03-14 00:53:10,560 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2025-03-14 00:53:10,560 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 134 flow [2025-03-14 00:53:10,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:53:10,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:10,560 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] [2025-03-14 00:53:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:53:10,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2135108481, now seen corresponding path program 1 times [2025-03-14 00:53:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593934794] [2025-03-14 00:53:10,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:10,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:53:10,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:53:10,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:10,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:10,621 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-14 00:53:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:10,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593934794] [2025-03-14 00:53:10,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593934794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:10,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:10,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:10,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994690579] [2025-03-14 00:53:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:10,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:10,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:10,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:10,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:10,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:53:10,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-14 00:53:10,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:10,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:53:10,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:10,712 INFO L124 PetriNetUnfolderBase]: 433/717 cut-off events. [2025-03-14 00:53:10,712 INFO L125 PetriNetUnfolderBase]: For 612/613 co-relation queries the response was YES. [2025-03-14 00:53:10,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 717 events. 433/717 cut-off events. For 612/613 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2671 event pairs, 89 based on Foata normal form. 24/741 useless extension candidates. Maximal degree in co-relation 2097. Up to 268 conditions per place. [2025-03-14 00:53:10,714 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 0 selfloop transitions, 0 changer transitions 57/57 dead transitions. [2025-03-14 00:53:10,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 312 flow [2025-03-14 00:53:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:53:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:53:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-14 00:53:10,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2025-03-14 00:53:10,715 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 134 flow. Second operand 6 states and 110 transitions. [2025-03-14 00:53:10,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 312 flow [2025-03-14 00:53:10,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 283 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-14 00:53:10,717 INFO L231 Difference]: Finished difference. Result has 52 places, 0 transitions, 0 flow [2025-03-14 00:53:10,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=52, PETRI_TRANSITIONS=0} [2025-03-14 00:53:10,717 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2025-03-14 00:53:10,717 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 0 transitions, 0 flow [2025-03-14 00:53:10,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-14 00:53:10,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 00:53:10,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 00:53:10,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 00:53:10,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 00:53:10,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 00:53:10,720 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:10,723 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:53:10,723 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:53:10,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:53:10 BasicIcfg [2025-03-14 00:53:10,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:53:10,727 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:53:10,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:53:10,727 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:53:10,728 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:52:59" (3/4) ... [2025-03-14 00:53:10,729 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:53:10,732 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-14 00:53:10,732 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-14 00:53:10,732 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-14 00:53:10,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-03-14 00:53:10,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-14 00:53:10,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:53:10,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:53:10,787 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:53:10,788 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:53:10,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:53:10,789 INFO L158 Benchmark]: Toolchain (without parser) took 11917.36ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 111.1MB in the beginning and 483.2MB in the end (delta: -372.1MB). Peak memory consumption was 982.5MB. Max. memory is 16.1GB. [2025-03-14 00:53:10,789 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:53:10,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.19ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 90.1MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:53:10,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.77ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 89.1MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:53:10,789 INFO L158 Benchmark]: Boogie Preprocessor took 20.05ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:53:10,790 INFO L158 Benchmark]: IcfgBuilder took 331.40ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 65.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:53:10,790 INFO L158 Benchmark]: TraceAbstraction took 11081.93ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 65.1MB in the beginning and 487.3MB in the end (delta: -422.3MB). Peak memory consumption was 940.6MB. Max. memory is 16.1GB. [2025-03-14 00:53:10,790 INFO L158 Benchmark]: Witness Printer took 60.77ms. Allocated memory is still 1.5GB. Free memory was 487.3MB in the beginning and 483.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:53:10,791 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.22ms. Allocated memory is still 201.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.19ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 90.1MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.77ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 89.1MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.05ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 331.40ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 65.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11081.93ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 65.1MB in the beginning and 487.3MB in the end (delta: -422.3MB). Peak memory consumption was 940.6MB. Max. memory is 16.1GB. * Witness Printer took 60.77ms. Allocated memory is still 1.5GB. Free memory was 487.3MB in the beginning and 483.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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 7 procedures, 62 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: 11.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1027 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1016 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2098 IncrementalHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 18 mSDtfsCounter, 2098 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=6, InterpolantAutomatonStates: 95, 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, 1.3s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:53:10,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE