./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/weaver/parallel-misc-3-extended.wvr.c -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 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:32:07,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:32:07,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:32:07,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:32:07,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:32:07,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:32:07,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:32:07,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:32:07,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:32:07,093 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:32:07,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:32:07,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:32:07,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:32:07,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:32:07,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:32:07,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:32:07,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:32:07,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:32:07,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:32:07,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:32:07,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:32:07,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:32:07,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:32:07,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:32:07,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:32:07,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:32:07,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:32:07,095 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 -> 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f [2025-03-08 17:32:07,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:32:07,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:32:07,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:32:07,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:32:07,334 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:32:07,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-08 17:32:08,480 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66a5bd41/39b200e2ce0d45b6a28382428be317f1/FLAG2f362d536 [2025-03-08 17:32:08,710 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:32:08,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-08 17:32:08,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66a5bd41/39b200e2ce0d45b6a28382428be317f1/FLAG2f362d536 [2025-03-08 17:32:09,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66a5bd41/39b200e2ce0d45b6a28382428be317f1 [2025-03-08 17:32:09,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:32:09,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:32:09,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:32:09,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:32:09,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:32:09,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc76202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09, skipping insertion in model container [2025-03-08 17:32:09,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:32:09,190 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/weaver/parallel-misc-3-extended.wvr.c[2421,2434] [2025-03-08 17:32:09,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:32:09,201 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:32:09,220 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/weaver/parallel-misc-3-extended.wvr.c[2421,2434] [2025-03-08 17:32:09,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:32:09,230 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:32:09,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09 WrapperNode [2025-03-08 17:32:09,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:32:09,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:32:09,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:32:09,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:32:09,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,251 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-03-08 17:32:09,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:32:09,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:32:09,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:32:09,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:32:09,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,273 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-08 17:32:09,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:32:09,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:32:09,285 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:32:09,285 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:32:09,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (1/1) ... [2025-03-08 17:32:09,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:32:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:09,317 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-08 17:32:09,320 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-08 17:32:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:32:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:32:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:32:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:32:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:32:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:32:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:32:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:32:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:32:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:32:09,342 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:32:09,403 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:32:09,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:32:09,563 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:32:09,563 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:32:09,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:32:09,661 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:32:09,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:09 BoogieIcfgContainer [2025-03-08 17:32:09,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:32:09,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:32:09,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:32:09,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:32:09,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:09" (1/3) ... [2025-03-08 17:32:09,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482d95ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:09, skipping insertion in model container [2025-03-08 17:32:09,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:09" (2/3) ... [2025-03-08 17:32:09,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482d95ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:09, skipping insertion in model container [2025-03-08 17:32:09,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:09" (3/3) ... [2025-03-08 17:32:09,671 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-03-08 17:32:09,682 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:32:09,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 37 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 17:32:09,683 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:32:09,734 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:32:09,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 105 flow [2025-03-08 17:32:09,782 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2025-03-08 17:32:09,783 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:32:09,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 6/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-08 17:32:09,786 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 42 transitions, 105 flow [2025-03-08 17:32:09,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 38 transitions, 94 flow [2025-03-08 17:32:09,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:32:09,805 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;@65ca3c80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:32:09,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:32:09,814 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:32:09,814 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-03-08 17:32:09,814 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:32:09,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:09,815 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-08 17:32:09,815 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-08 17:32:09,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash -403319982, now seen corresponding path program 1 times [2025-03-08 17:32:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:09,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372939491] [2025-03-08 17:32:09,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:09,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 17:32:09,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 17:32:09,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:09,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:10,011 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-08 17:32:10,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372939491] [2025-03-08 17:32:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372939491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:10,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:10,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:32:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435537155] [2025-03-08 17:32:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:32:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:10,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:32:10,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:32:10,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:10,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 17:32:10,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:10,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:10,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:10,294 INFO L124 PetriNetUnfolderBase]: 996/1607 cut-off events. [2025-03-08 17:32:10,294 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-08 17:32:10,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1607 events. 996/1607 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8097 event pairs, 94 based on Foata normal form. 1/1444 useless extension candidates. Maximal degree in co-relation 2669. Up to 1177 conditions per place. [2025-03-08 17:32:10,311 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 32 selfloop transitions, 7 changer transitions 1/55 dead transitions. [2025-03-08 17:32:10,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 223 flow [2025-03-08 17:32:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:32:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:32:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-08 17:32:10,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.753968253968254 [2025-03-08 17:32:10,323 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 94 flow. Second operand 3 states and 95 transitions. [2025-03-08 17:32:10,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 223 flow [2025-03-08 17:32:10,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:32:10,333 INFO L231 Difference]: Finished difference. Result has 39 places, 44 transitions, 129 flow [2025-03-08 17:32:10,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=44} [2025-03-08 17:32:10,338 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2025-03-08 17:32:10,339 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 44 transitions, 129 flow [2025-03-08 17:32:10,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 17:32:10,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:10,339 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-08 17:32:10,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:32:10,340 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-08 17:32:10,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 195976686, now seen corresponding path program 1 times [2025-03-08 17:32:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:10,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238747958] [2025-03-08 17:32:10,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:10,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:32:10,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:32:10,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:10,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238747958] [2025-03-08 17:32:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238747958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:10,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:10,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:32:10,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896377215] [2025-03-08 17:32:10,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:32:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:10,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:32:10,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:32:10,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:10,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 44 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 17:32:10,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:10,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:10,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:10,637 INFO L124 PetriNetUnfolderBase]: 1142/1797 cut-off events. [2025-03-08 17:32:10,638 INFO L125 PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES. [2025-03-08 17:32:10,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 1797 events. 1142/1797 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9094 event pairs, 171 based on Foata normal form. 48/1665 useless extension candidates. Maximal degree in co-relation 2810. Up to 900 conditions per place. [2025-03-08 17:32:10,651 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 43 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-08 17:32:10,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 265 flow [2025-03-08 17:32:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:32:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:32:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-08 17:32:10,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2025-03-08 17:32:10,653 INFO L175 Difference]: Start difference. First operand has 39 places, 44 transitions, 129 flow. Second operand 3 states and 94 transitions. [2025-03-08 17:32:10,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 265 flow [2025-03-08 17:32:10,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 256 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:10,656 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 132 flow [2025-03-08 17:32:10,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2025-03-08 17:32:10,657 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2025-03-08 17:32:10,657 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 132 flow [2025-03-08 17:32:10,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 17:32:10,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:10,657 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] [2025-03-08 17:32:10,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:32:10,657 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-08 17:32:10,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash -445698992, now seen corresponding path program 1 times [2025-03-08 17:32:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898627713] [2025-03-08 17:32:10,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:10,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:32:10,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:32:10,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:10,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:10,761 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-08 17:32:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898627713] [2025-03-08 17:32:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898627713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:10,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:10,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:32:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724853372] [2025-03-08 17:32:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:10,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:32:10,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:10,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:32:10,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:32:10,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:10,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 17:32:10,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:10,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:10,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:10,932 INFO L124 PetriNetUnfolderBase]: 1223/1996 cut-off events. [2025-03-08 17:32:10,933 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2025-03-08 17:32:10,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 1996 events. 1223/1996 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11159 event pairs, 198 based on Foata normal form. 71/1800 useless extension candidates. Maximal degree in co-relation 2690. Up to 1041 conditions per place. [2025-03-08 17:32:10,942 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 44 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-03-08 17:32:10,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 277 flow [2025-03-08 17:32:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:32:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:32:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-08 17:32:10,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2025-03-08 17:32:10,943 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 132 flow. Second operand 3 states and 93 transitions. [2025-03-08 17:32:10,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 277 flow [2025-03-08 17:32:10,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:10,945 INFO L231 Difference]: Finished difference. Result has 43 places, 46 transitions, 142 flow [2025-03-08 17:32:10,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=46} [2025-03-08 17:32:10,945 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2025-03-08 17:32:10,945 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 142 flow [2025-03-08 17:32:10,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 17:32:10,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:10,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:10,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:32:10,946 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-08 17:32:10,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash -935003290, now seen corresponding path program 1 times [2025-03-08 17:32:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36439124] [2025-03-08 17:32:10,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:10,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:10,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:32:10,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:32:10,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:10,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36439124] [2025-03-08 17:32:11,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36439124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:11,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:32:11,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371861412] [2025-03-08 17:32:11,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:11,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:32:11,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:11,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:32:11,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:32:11,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:11,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:11,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:11,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:11,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:11,210 INFO L124 PetriNetUnfolderBase]: 1417/2302 cut-off events. [2025-03-08 17:32:11,210 INFO L125 PetriNetUnfolderBase]: For 1130/1130 co-relation queries the response was YES. [2025-03-08 17:32:11,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 2302 events. 1417/2302 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13103 event pairs, 321 based on Foata normal form. 64/2094 useless extension candidates. Maximal degree in co-relation 2133. Up to 1031 conditions per place. [2025-03-08 17:32:11,222 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 45 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-03-08 17:32:11,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 295 flow [2025-03-08 17:32:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:32:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:32:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2025-03-08 17:32:11,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2025-03-08 17:32:11,224 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 142 flow. Second operand 3 states and 92 transitions. [2025-03-08 17:32:11,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 295 flow [2025-03-08 17:32:11,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:11,226 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 152 flow [2025-03-08 17:32:11,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2025-03-08 17:32:11,227 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2025-03-08 17:32:11,228 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 152 flow [2025-03-08 17:32:11,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:11,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:11,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:11,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:32:11,228 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-08 17:32:11,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1789345942, now seen corresponding path program 1 times [2025-03-08 17:32:11,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014429758] [2025-03-08 17:32:11,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:11,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:32:11,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:32:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:11,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014429758] [2025-03-08 17:32:11,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014429758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:11,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:11,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:32:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587981043] [2025-03-08 17:32:11,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:11,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:11,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:11,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:11,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:11,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-03-08 17:32:11,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-08 17:32:11,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:11,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-03-08 17:32:11,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:11,743 INFO L124 PetriNetUnfolderBase]: 2876/4261 cut-off events. [2025-03-08 17:32:11,744 INFO L125 PetriNetUnfolderBase]: For 1981/2079 co-relation queries the response was YES. [2025-03-08 17:32:11,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11071 conditions, 4261 events. 2876/4261 cut-off events. For 1981/2079 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22683 event pairs, 492 based on Foata normal form. 64/4044 useless extension candidates. Maximal degree in co-relation 4964. Up to 1690 conditions per place. [2025-03-08 17:32:11,762 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 65 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2025-03-08 17:32:11,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 416 flow [2025-03-08 17:32:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-03-08 17:32:11,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2025-03-08 17:32:11,763 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 152 flow. Second operand 4 states and 124 transitions. [2025-03-08 17:32:11,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 416 flow [2025-03-08 17:32:11,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:11,766 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 182 flow [2025-03-08 17:32:11,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-03-08 17:32:11,767 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2025-03-08 17:32:11,767 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 182 flow [2025-03-08 17:32:11,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-08 17:32:11,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:11,767 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:11,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:32:11,768 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-08 17:32:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 506626675, now seen corresponding path program 1 times [2025-03-08 17:32:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:11,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4158276] [2025-03-08 17:32:11,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:11,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 17:32:11,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:32:11,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:11,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:32:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:11,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4158276] [2025-03-08 17:32:11,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4158276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:11,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:11,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:32:11,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066939868] [2025-03-08 17:32:11,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:11,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:11,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:11,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:11,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-03-08 17:32:11,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-08 17:32:11,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:11,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-03-08 17:32:11,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:12,343 INFO L124 PetriNetUnfolderBase]: 4428/6351 cut-off events. [2025-03-08 17:32:12,343 INFO L125 PetriNetUnfolderBase]: For 5673/6263 co-relation queries the response was YES. [2025-03-08 17:32:12,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18130 conditions, 6351 events. 4428/6351 cut-off events. For 5673/6263 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 35974 event pairs, 1044 based on Foata normal form. 270/6185 useless extension candidates. Maximal degree in co-relation 9994. Up to 2411 conditions per place. [2025-03-08 17:32:12,372 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 68 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2025-03-08 17:32:12,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 492 flow [2025-03-08 17:32:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-03-08 17:32:12,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2025-03-08 17:32:12,374 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 182 flow. Second operand 4 states and 122 transitions. [2025-03-08 17:32:12,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 492 flow [2025-03-08 17:32:12,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 486 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:12,401 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 212 flow [2025-03-08 17:32:12,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-03-08 17:32:12,402 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2025-03-08 17:32:12,402 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 212 flow [2025-03-08 17:32:12,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-08 17:32:12,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:12,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:12,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:32:12,403 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-08 17:32:12,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1114216153, now seen corresponding path program 1 times [2025-03-08 17:32:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150639729] [2025-03-08 17:32:12,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:12,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 17:32:12,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:32:12,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:12,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 17:32:12,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:12,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150639729] [2025-03-08 17:32:12,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150639729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:12,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:32:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441367603] [2025-03-08 17:32:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:12,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:12,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:12,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:12,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-03-08 17:32:12,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-08 17:32:12,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:12,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-03-08 17:32:12,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:13,226 INFO L124 PetriNetUnfolderBase]: 6271/9089 cut-off events. [2025-03-08 17:32:13,226 INFO L125 PetriNetUnfolderBase]: For 12072/13044 co-relation queries the response was YES. [2025-03-08 17:32:13,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28009 conditions, 9089 events. 6271/9089 cut-off events. For 12072/13044 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 54909 event pairs, 1732 based on Foata normal form. 571/9197 useless extension candidates. Maximal degree in co-relation 16009. Up to 3291 conditions per place. [2025-03-08 17:32:13,277 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 71 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2025-03-08 17:32:13,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 566 flow [2025-03-08 17:32:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-08 17:32:13,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-03-08 17:32:13,278 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 212 flow. Second operand 4 states and 120 transitions. [2025-03-08 17:32:13,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 566 flow [2025-03-08 17:32:13,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 560 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:13,283 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 242 flow [2025-03-08 17:32:13,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-08 17:32:13,283 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2025-03-08 17:32:13,283 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 242 flow [2025-03-08 17:32:13,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-08 17:32:13,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:13,283 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:13,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:32:13,284 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-08 17:32:13,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 820037591, now seen corresponding path program 1 times [2025-03-08 17:32:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458603295] [2025-03-08 17:32:13,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:13,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 17:32:13,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:13,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:13,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458603295] [2025-03-08 17:32:13,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458603295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138503345] [2025-03-08 17:32:13,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:13,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:13,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:32:13,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:32:13,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 17:32:13,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:13,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:13,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:13,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 17:32:13,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:13,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138503345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:13,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:13,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-08 17:32:13,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010824399] [2025-03-08 17:32:13,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:32:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:13,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:32:13,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:32:13,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:13,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-08 17:32:13,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:13,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:15,295 INFO L124 PetriNetUnfolderBase]: 13709/22568 cut-off events. [2025-03-08 17:32:15,296 INFO L125 PetriNetUnfolderBase]: For 30785/32635 co-relation queries the response was YES. [2025-03-08 17:32:15,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69908 conditions, 22568 events. 13709/22568 cut-off events. For 30785/32635 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 162302 event pairs, 2553 based on Foata normal form. 878/23136 useless extension candidates. Maximal degree in co-relation 17508. Up to 8575 conditions per place. [2025-03-08 17:32:15,435 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 99 selfloop transitions, 22 changer transitions 1/140 dead transitions. [2025-03-08 17:32:15,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 140 transitions, 912 flow [2025-03-08 17:32:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-03-08 17:32:15,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2025-03-08 17:32:15,437 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 242 flow. Second operand 5 states and 176 transitions. [2025-03-08 17:32:15,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 140 transitions, 912 flow [2025-03-08 17:32:15,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 140 transitions, 904 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:15,444 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 383 flow [2025-03-08 17:32:15,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=383, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2025-03-08 17:32:15,444 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2025-03-08 17:32:15,444 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 383 flow [2025-03-08 17:32:15,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-08 17:32:15,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:15,445 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:15,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:32:15,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:15,645 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-08 17:32:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1301591481, now seen corresponding path program 2 times [2025-03-08 17:32:15,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:15,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713181928] [2025-03-08 17:32:15,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:15,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:15,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 17:32:15,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:15,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:15,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:15,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713181928] [2025-03-08 17:32:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713181928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668273461] [2025-03-08 17:32:15,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:15,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:15,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:15,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:32:15,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:32:15,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 17:32:15,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:15,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:15,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:15,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 17:32:15,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:15,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668273461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:15,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:15,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-08 17:32:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925262926] [2025-03-08 17:32:15,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:15,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:32:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:15,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:32:15,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:32:15,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:15,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-08 17:32:15,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:15,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:15,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:18,872 INFO L124 PetriNetUnfolderBase]: 25739/42349 cut-off events. [2025-03-08 17:32:18,873 INFO L125 PetriNetUnfolderBase]: For 77180/80874 co-relation queries the response was YES. [2025-03-08 17:32:19,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146067 conditions, 42349 events. 25739/42349 cut-off events. For 77180/80874 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 338887 event pairs, 3099 based on Foata normal form. 1766/43552 useless extension candidates. Maximal degree in co-relation 36563. Up to 14115 conditions per place. [2025-03-08 17:32:19,193 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 123 selfloop transitions, 46 changer transitions 1/188 dead transitions. [2025-03-08 17:32:19,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 188 transitions, 1343 flow [2025-03-08 17:32:19,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:32:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:32:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-03-08 17:32:19,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8531746031746031 [2025-03-08 17:32:19,194 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 383 flow. Second operand 6 states and 215 transitions. [2025-03-08 17:32:19,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 188 transitions, 1343 flow [2025-03-08 17:32:19,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 188 transitions, 1259 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:19,222 INFO L231 Difference]: Finished difference. Result has 70 places, 95 transitions, 571 flow [2025-03-08 17:32:19,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=70, PETRI_TRANSITIONS=95} [2025-03-08 17:32:19,222 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2025-03-08 17:32:19,222 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 95 transitions, 571 flow [2025-03-08 17:32:19,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-08 17:32:19,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:19,223 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:19,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 17:32:19,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 17:32:19,424 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-08 17:32:19,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash 550473549, now seen corresponding path program 3 times [2025-03-08 17:32:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:19,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388719513] [2025-03-08 17:32:19,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:32:19,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:19,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-08 17:32:19,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:19,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 17:32:19,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388719513] [2025-03-08 17:32:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388719513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523085266] [2025-03-08 17:32:19,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:32:19,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:19,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:32:19,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:32:19,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-08 17:32:19,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:19,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 17:32:19,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:19,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 17:32:19,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:19,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:19,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523085266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:19,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:19,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-08 17:32:19,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721648201] [2025-03-08 17:32:19,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:19,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:32:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:19,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:32:19,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:32:19,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:19,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 95 transitions, 571 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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-08 17:32:19,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:19,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:19,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:24,735 INFO L124 PetriNetUnfolderBase]: 41804/69041 cut-off events. [2025-03-08 17:32:24,735 INFO L125 PetriNetUnfolderBase]: For 133397/139236 co-relation queries the response was YES. [2025-03-08 17:32:24,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241106 conditions, 69041 events. 41804/69041 cut-off events. For 133397/139236 co-relation queries the response was YES. Maximal size of possible extension queue 2260. Compared 596903 event pairs, 4295 based on Foata normal form. 2872/70856 useless extension candidates. Maximal degree in co-relation 63795. Up to 20701 conditions per place. [2025-03-08 17:32:25,141 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 146 selfloop transitions, 76 changer transitions 1/241 dead transitions. [2025-03-08 17:32:25,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 241 transitions, 1797 flow [2025-03-08 17:32:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:32:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:32:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 254 transitions. [2025-03-08 17:32:25,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8639455782312925 [2025-03-08 17:32:25,142 INFO L175 Difference]: Start difference. First operand has 70 places, 95 transitions, 571 flow. Second operand 7 states and 254 transitions. [2025-03-08 17:32:25,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 241 transitions, 1797 flow [2025-03-08 17:32:25,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 241 transitions, 1690 flow, removed 47 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:25,186 INFO L231 Difference]: Finished difference. Result has 76 places, 125 transitions, 849 flow [2025-03-08 17:32:25,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=849, PETRI_PLACES=76, PETRI_TRANSITIONS=125} [2025-03-08 17:32:25,186 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2025-03-08 17:32:25,186 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 125 transitions, 849 flow [2025-03-08 17:32:25,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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-08 17:32:25,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:25,187 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:25,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:25,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:25,387 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-08 17:32:25,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash 535619719, now seen corresponding path program 4 times [2025-03-08 17:32:25,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:25,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997998421] [2025-03-08 17:32:25,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:32:25,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:25,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-08 17:32:25,401 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:25,401 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:32:25,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997998421] [2025-03-08 17:32:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997998421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758589963] [2025-03-08 17:32:25,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:32:25,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:25,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:25,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:32:25,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:32:25,525 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-08 17:32:25,542 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:25,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:32:25,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:25,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 17:32:25,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:25,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758589963] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:25,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-08 17:32:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504740292] [2025-03-08 17:32:25,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:25,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:32:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:25,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:32:25,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:32:25,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:25,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 125 transitions, 849 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-08 17:32:25,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:25,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:25,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:31,877 INFO L124 PetriNetUnfolderBase]: 53504/87431 cut-off events. [2025-03-08 17:32:31,878 INFO L125 PetriNetUnfolderBase]: For 208162/215339 co-relation queries the response was YES. [2025-03-08 17:32:32,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321893 conditions, 87431 events. 53504/87431 cut-off events. For 208162/215339 co-relation queries the response was YES. Maximal size of possible extension queue 2784. Compared 773970 event pairs, 11051 based on Foata normal form. 3470/89058 useless extension candidates. Maximal degree in co-relation 95935. Up to 58694 conditions per place. [2025-03-08 17:32:32,603 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 185 selfloop transitions, 54 changer transitions 1/258 dead transitions. [2025-03-08 17:32:32,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 258 transitions, 2134 flow [2025-03-08 17:32:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:32:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:32:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-03-08 17:32:32,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8373015873015873 [2025-03-08 17:32:32,604 INFO L175 Difference]: Start difference. First operand has 76 places, 125 transitions, 849 flow. Second operand 6 states and 211 transitions. [2025-03-08 17:32:32,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 258 transitions, 2134 flow [2025-03-08 17:32:32,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 258 transitions, 2020 flow, removed 40 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:32,743 INFO L231 Difference]: Finished difference. Result has 83 places, 175 transitions, 1354 flow [2025-03-08 17:32:32,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1354, PETRI_PLACES=83, PETRI_TRANSITIONS=175} [2025-03-08 17:32:32,743 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-03-08 17:32:32,743 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 175 transitions, 1354 flow [2025-03-08 17:32:32,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-08 17:32:32,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:32,744 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:32,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:32,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:32,947 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:32,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1444926887, now seen corresponding path program 5 times [2025-03-08 17:32:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:32,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876232349] [2025-03-08 17:32:32,948 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:32,955 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-03-08 17:32:32,978 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:32,979 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 17:32:32,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:33,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:33,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876232349] [2025-03-08 17:32:33,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876232349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:33,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030056949] [2025-03-08 17:32:33,119 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:33,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:33,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:33,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:32:33,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:32:33,303 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-03-08 17:32:33,320 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:32:33,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 17:32:33,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:33,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 17:32:33,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:33,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030056949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:33,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-08 17:32:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490884812] [2025-03-08 17:32:33,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:33,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:32:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:33,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:32:33,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:32:33,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-08 17:32:33,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 175 transitions, 1354 flow. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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-08 17:32:33,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:33,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-08 17:32:33,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:43,157 INFO L124 PetriNetUnfolderBase]: 72115/118458 cut-off events. [2025-03-08 17:32:43,158 INFO L125 PetriNetUnfolderBase]: For 290808/301174 co-relation queries the response was YES. [2025-03-08 17:32:43,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436074 conditions, 118458 events. 72115/118458 cut-off events. For 290808/301174 co-relation queries the response was YES. Maximal size of possible extension queue 4178. Compared 1096737 event pairs, 6960 based on Foata normal form. 5043/121465 useless extension candidates. Maximal degree in co-relation 146595. Up to 23338 conditions per place. [2025-03-08 17:32:44,004 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 170 selfloop transitions, 162 changer transitions 1/351 dead transitions. [2025-03-08 17:32:44,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 351 transitions, 2962 flow [2025-03-08 17:32:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:32:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:32:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2025-03-08 17:32:44,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8720238095238095 [2025-03-08 17:32:44,005 INFO L175 Difference]: Start difference. First operand has 83 places, 175 transitions, 1354 flow. Second operand 8 states and 293 transitions. [2025-03-08 17:32:44,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 351 transitions, 2962 flow [2025-03-08 17:32:44,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 351 transitions, 2950 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:44,225 INFO L231 Difference]: Finished difference. Result has 91 places, 211 transitions, 1955 flow [2025-03-08 17:32:44,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1955, PETRI_PLACES=91, PETRI_TRANSITIONS=211} [2025-03-08 17:32:44,226 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2025-03-08 17:32:44,226 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 211 transitions, 1955 flow [2025-03-08 17:32:44,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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-08 17:32:44,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:44,226 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:44,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:44,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 17:32:44,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2073780225, now seen corresponding path program 6 times [2025-03-08 17:32:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923306561] [2025-03-08 17:32:44,427 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:32:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:44,434 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 1 equivalence classes. [2025-03-08 17:32:44,448 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 17:32:44,448 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:32:44,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:44,647 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-08 17:32:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923306561] [2025-03-08 17:32:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923306561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:44,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:44,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:32:44,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555000564] [2025-03-08 17:32:44,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:44,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:32:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:44,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:32:44,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:32:44,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-03-08 17:32:44,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 211 transitions, 1955 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-08 17:32:44,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:44,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-03-08 17:32:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand