/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:14:57,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:14:57,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:14:57,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:14:57,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:14:57,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:14:57,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:14:57,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:14:57,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:14:57,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:14:57,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:14:57,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:14:57,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:14:57,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:14:57,544 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:14:57,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:14:57,546 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:14:57,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:14:57,546 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:14:57,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:14:57,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:14:57,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:14:57,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:14:57,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:14:57,547 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:14:57,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:14:57,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:14:57,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:14:57,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:14:57,816 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:14:57,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2025-04-14 01:14:59,180 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9260d680/8ef06e779f3b441784582ff8481bea56/FLAG2276d249a [2025-04-14 01:14:59,387 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:14:59,388 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2025-04-14 01:14:59,396 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9260d680/8ef06e779f3b441784582ff8481bea56/FLAG2276d249a [2025-04-14 01:15:00,230 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9260d680/8ef06e779f3b441784582ff8481bea56 [2025-04-14 01:15:00,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:15:00,233 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:15:00,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:15:00,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:15:00,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:15:00,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc501c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00, skipping insertion in model container [2025-04-14 01:15:00,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:15:00,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2025-04-14 01:15:00,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:15:00,479 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:15:00,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2025-04-14 01:15:00,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:15:00,549 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:15:00,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00 WrapperNode [2025-04-14 01:15:00,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:15:00,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:15:00,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:15:00,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:15:00,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,596 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 315 [2025-04-14 01:15:00,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:15:00,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:15:00,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:15:00,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:15:00,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,631 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-14 01:15:00,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:15:00,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:15:00,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:15:00,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:15:00,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (1/1) ... [2025-04-14 01:15:00,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:15:00,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:00,673 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-04-14 01:15:00,674 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-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:15:00,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:15:00,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:15:00,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 01:15:00,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:15:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:15:00,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:15:00,691 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:15:00,788 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:15:00,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:15:01,141 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:15:01,142 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:15:01,142 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:15:01,520 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:15:01,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:15:01 BoogieIcfgContainer [2025-04-14 01:15:01,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:15:01,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:15:01,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:15:01,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:15:01,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:15:00" (1/3) ... [2025-04-14 01:15:01,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3743f29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:15:01, skipping insertion in model container [2025-04-14 01:15:01,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:00" (2/3) ... [2025-04-14 01:15:01,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3743f29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:15:01, skipping insertion in model container [2025-04-14 01:15:01,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:15:01" (3/3) ... [2025-04-14 01:15:01,528 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-04-14 01:15:01,539 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:15:01,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 43 locations, 45 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-14 01:15:01,541 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:15:01,587 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 01:15:01,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 126 flow [2025-04-14 01:15:01,641 INFO L116 PetriNetUnfolderBase]: 7/45 cut-off events. [2025-04-14 01:15:01,643 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:15:01,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 45 events. 7/45 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-14 01:15:01,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 126 flow [2025-04-14 01:15:01,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 44 transitions, 112 flow [2025-04-14 01:15:01,653 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:15:01,664 INFO L340 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;@5b3f870d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:15:01,664 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 01:15:01,679 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:15:01,679 INFO L116 PetriNetUnfolderBase]: 7/43 cut-off events. [2025-04-14 01:15:01,679 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:15:01,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:01,680 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] [2025-04-14 01:15:01,680 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:01,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1473562096, now seen corresponding path program 1 times [2025-04-14 01:15:01,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:01,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766588680] [2025-04-14 01:15:01,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:01,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:15:01,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:15:01,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:01,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:02,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766588680] [2025-04-14 01:15:02,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766588680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:02,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:02,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:15:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203339777] [2025-04-14 01:15:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:02,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:15:02,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:02,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:15:02,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:15:02,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:02,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-04-14 01:15:02,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:02,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:02,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:02,681 INFO L116 PetriNetUnfolderBase]: 3683/5093 cut-off events. [2025-04-14 01:15:02,681 INFO L117 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-04-14 01:15:02,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10279 conditions, 5093 events. 3683/5093 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 24463 event pairs, 1024 based on Foata normal form. 1/4973 useless extension candidates. Maximal degree in co-relation 9160. Up to 3095 conditions per place. [2025-04-14 01:15:02,721 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 53 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2025-04-14 01:15:02,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 283 flow [2025-04-14 01:15:02,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:15:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:15:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-04-14 01:15:02,731 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6394557823129252 [2025-04-14 01:15:02,732 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 112 flow. Second operand 3 states and 94 transitions. [2025-04-14 01:15:02,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 283 flow [2025-04-14 01:15:02,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 257 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 01:15:02,748 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 115 flow [2025-04-14 01:15:02,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-04-14 01:15:02,752 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-04-14 01:15:02,753 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 115 flow [2025-04-14 01:15:02,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-04-14 01:15:02,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:02,753 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, 1] [2025-04-14 01:15:02,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:15:02,754 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:02,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1564578420, now seen corresponding path program 1 times [2025-04-14 01:15:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:02,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617589839] [2025-04-14 01:15:02,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:02,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 01:15:02,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:15:02,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:02,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:02,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617589839] [2025-04-14 01:15:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617589839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:02,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:02,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:15:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731379085] [2025-04-14 01:15:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:02,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:15:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:02,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:15:02,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:15:02,943 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:02,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:02,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:02,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:02,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:03,434 INFO L116 PetriNetUnfolderBase]: 4691/6606 cut-off events. [2025-04-14 01:15:03,434 INFO L117 PetriNetUnfolderBase]: For 889/889 co-relation queries the response was YES. [2025-04-14 01:15:03,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13879 conditions, 6606 events. 4691/6606 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34808 event pairs, 1685 based on Foata normal form. 186/6712 useless extension candidates. Maximal degree in co-relation 5587. Up to 3904 conditions per place. [2025-04-14 01:15:03,469 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 61 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-04-14 01:15:03,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 305 flow [2025-04-14 01:15:03,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:15:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:15:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-04-14 01:15:03,471 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6598639455782312 [2025-04-14 01:15:03,472 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 115 flow. Second operand 3 states and 97 transitions. [2025-04-14 01:15:03,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 305 flow [2025-04-14 01:15:03,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 71 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:03,473 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 126 flow [2025-04-14 01:15:03,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=126, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-14 01:15:03,474 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-04-14 01:15:03,474 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 126 flow [2025-04-14 01:15:03,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:03,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:03,474 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, 1] [2025-04-14 01:15:03,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:15:03,474 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:03,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash -763984950, now seen corresponding path program 1 times [2025-04-14 01:15:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:03,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108181825] [2025-04-14 01:15:03,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:03,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 01:15:03,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:15:03,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:03,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:03,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108181825] [2025-04-14 01:15:03,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108181825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:03,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:15:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175538646] [2025-04-14 01:15:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:03,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:15:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:03,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:15:03,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:15:03,632 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:03,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:03,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:03,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:03,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:04,379 INFO L116 PetriNetUnfolderBase]: 5825/8333 cut-off events. [2025-04-14 01:15:04,379 INFO L117 PetriNetUnfolderBase]: For 2271/2271 co-relation queries the response was YES. [2025-04-14 01:15:04,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18103 conditions, 8333 events. 5825/8333 cut-off events. For 2271/2271 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 45397 event pairs, 2031 based on Foata normal form. 138/8397 useless extension candidates. Maximal degree in co-relation 11511. Up to 4926 conditions per place. [2025-04-14 01:15:04,428 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 61 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-04-14 01:15:04,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 321 flow [2025-04-14 01:15:04,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:15:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:15:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-04-14 01:15:04,432 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6462585034013606 [2025-04-14 01:15:04,433 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 126 flow. Second operand 3 states and 95 transitions. [2025-04-14 01:15:04,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 321 flow [2025-04-14 01:15:04,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:04,437 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 138 flow [2025-04-14 01:15:04,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2025-04-14 01:15:04,438 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-04-14 01:15:04,438 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 138 flow [2025-04-14 01:15:04,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:04,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:04,438 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, 1, 1, 1, 1] [2025-04-14 01:15:04,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:15:04,440 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:04,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1709611264, now seen corresponding path program 1 times [2025-04-14 01:15:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:04,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273158119] [2025-04-14 01:15:04,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:04,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:15:04,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:15:04,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:04,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:04,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273158119] [2025-04-14 01:15:04,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273158119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:04,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:04,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:15:04,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341081037] [2025-04-14 01:15:04,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:04,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:15:04,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:04,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:15:04,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:15:04,663 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:04,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-04-14 01:15:04,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:04,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:04,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:05,303 INFO L116 PetriNetUnfolderBase]: 7724/11127 cut-off events. [2025-04-14 01:15:05,303 INFO L117 PetriNetUnfolderBase]: For 4137/4137 co-relation queries the response was YES. [2025-04-14 01:15:05,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25176 conditions, 11127 events. 7724/11127 cut-off events. For 4137/4137 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 64471 event pairs, 6327 based on Foata normal form. 211/11223 useless extension candidates. Maximal degree in co-relation 13294. Up to 7788 conditions per place. [2025-04-14 01:15:05,345 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 70 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-04-14 01:15:05,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 373 flow [2025-04-14 01:15:05,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:15:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:15:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-04-14 01:15:05,347 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-04-14 01:15:05,347 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 138 flow. Second operand 4 states and 116 transitions. [2025-04-14 01:15:05,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 373 flow [2025-04-14 01:15:05,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:05,350 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 156 flow [2025-04-14 01:15:05,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-04-14 01:15:05,351 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2025-04-14 01:15:05,351 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 156 flow [2025-04-14 01:15:05,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-04-14 01:15:05,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:05,351 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, 1, 1, 1, 1] [2025-04-14 01:15:05,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:15:05,352 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:05,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2071263592, now seen corresponding path program 1 times [2025-04-14 01:15:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:05,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799314445] [2025-04-14 01:15:05,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:05,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:15:05,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:15:05,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:05,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:05,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:05,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799314445] [2025-04-14 01:15:05,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799314445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:05,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:05,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:15:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702953046] [2025-04-14 01:15:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:05,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:15:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:05,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:15:05,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:15:05,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:05,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-04-14 01:15:05,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:05,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:05,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:06,424 INFO L116 PetriNetUnfolderBase]: 10322/15083 cut-off events. [2025-04-14 01:15:06,424 INFO L117 PetriNetUnfolderBase]: For 5648/5648 co-relation queries the response was YES. [2025-04-14 01:15:06,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33509 conditions, 15083 events. 10322/15083 cut-off events. For 5648/5648 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 93288 event pairs, 8685 based on Foata normal form. 335/15272 useless extension candidates. Maximal degree in co-relation 25637. Up to 10448 conditions per place. [2025-04-14 01:15:06,547 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 69 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-04-14 01:15:06,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 396 flow [2025-04-14 01:15:06,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:15:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:15:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-04-14 01:15:06,551 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2025-04-14 01:15:06,551 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 156 flow. Second operand 5 states and 128 transitions. [2025-04-14 01:15:06,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 396 flow [2025-04-14 01:15:06,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 392 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:06,643 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 191 flow [2025-04-14 01:15:06,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-04-14 01:15:06,644 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-04-14 01:15:06,644 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 191 flow [2025-04-14 01:15:06,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-04-14 01:15:06,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:06,644 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, 1, 1, 1, 1, 1] [2025-04-14 01:15:06,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:15:06,644 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:06,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash 227222662, now seen corresponding path program 1 times [2025-04-14 01:15:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:06,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947755593] [2025-04-14 01:15:06,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:06,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 01:15:06,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:15:06,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:06,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:06,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947755593] [2025-04-14 01:15:06,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947755593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:06,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882510901] [2025-04-14 01:15:06,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:06,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:06,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:06,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:06,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-04-14 01:15:06,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:06,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:06,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-04-14 01:15:06,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:08,236 INFO L116 PetriNetUnfolderBase]: 18964/27395 cut-off events. [2025-04-14 01:15:08,236 INFO L117 PetriNetUnfolderBase]: For 9112/9163 co-relation queries the response was YES. [2025-04-14 01:15:08,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60917 conditions, 27395 events. 18964/27395 cut-off events. For 9112/9163 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 179840 event pairs, 12880 based on Foata normal form. 0/26111 useless extension candidates. Maximal degree in co-relation 47062. Up to 18796 conditions per place. [2025-04-14 01:15:08,353 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 86 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2025-04-14 01:15:08,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 518 flow [2025-04-14 01:15:08,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-04-14 01:15:08,355 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:15:08,355 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 191 flow. Second operand 6 states and 147 transitions. [2025-04-14 01:15:08,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 518 flow [2025-04-14 01:15:08,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 511 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:08,360 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 228 flow [2025-04-14 01:15:08,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2025-04-14 01:15:08,362 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2025-04-14 01:15:08,362 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 228 flow [2025-04-14 01:15:08,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:08,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:08,363 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, 1, 1, 1, 1, 1] [2025-04-14 01:15:08,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:15:08,364 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:08,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1247375484, now seen corresponding path program 1 times [2025-04-14 01:15:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:08,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446691658] [2025-04-14 01:15:08,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:08,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:08,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 01:15:08,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:15:08,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:08,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:08,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:08,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446691658] [2025-04-14 01:15:08,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446691658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:08,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:08,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474628785] [2025-04-14 01:15:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:08,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:08,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:08,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:08,616 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-04-14 01:15:08,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:08,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:08,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-04-14 01:15:08,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:10,210 INFO L116 PetriNetUnfolderBase]: 15658/22746 cut-off events. [2025-04-14 01:15:10,210 INFO L117 PetriNetUnfolderBase]: For 8616/8628 co-relation queries the response was YES. [2025-04-14 01:15:10,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52094 conditions, 22746 events. 15658/22746 cut-off events. For 8616/8628 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 146783 event pairs, 7178 based on Foata normal form. 5/21589 useless extension candidates. Maximal degree in co-relation 37425. Up to 9197 conditions per place. [2025-04-14 01:15:10,330 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 67 selfloop transitions, 6 changer transitions 35/115 dead transitions. [2025-04-14 01:15:10,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 115 transitions, 600 flow [2025-04-14 01:15:10,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2025-04-14 01:15:10,331 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5578231292517006 [2025-04-14 01:15:10,331 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 228 flow. Second operand 6 states and 164 transitions. [2025-04-14 01:15:10,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 115 transitions, 600 flow [2025-04-14 01:15:10,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 115 transitions, 588 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 01:15:10,340 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 208 flow [2025-04-14 01:15:10,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2025-04-14 01:15:10,341 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2025-04-14 01:15:10,341 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 208 flow [2025-04-14 01:15:10,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:10,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:10,341 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:10,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:15:10,341 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:10,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1556061924, now seen corresponding path program 1 times [2025-04-14 01:15:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:10,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109323988] [2025-04-14 01:15:10,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:15:10,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:15:10,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:10,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:10,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109323988] [2025-04-14 01:15:10,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109323988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:10,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:10,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872765186] [2025-04-14 01:15:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:10,537 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:10,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:10,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:10,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:10,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-04-14 01:15:10,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:10,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:10,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:11,221 INFO L116 PetriNetUnfolderBase]: 8058/12226 cut-off events. [2025-04-14 01:15:11,221 INFO L117 PetriNetUnfolderBase]: For 6878/6878 co-relation queries the response was YES. [2025-04-14 01:15:11,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29607 conditions, 12226 events. 8058/12226 cut-off events. For 6878/6878 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 76567 event pairs, 1464 based on Foata normal form. 584/12752 useless extension candidates. Maximal degree in co-relation 24211. Up to 7146 conditions per place. [2025-04-14 01:15:11,275 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 76 selfloop transitions, 7 changer transitions 1/92 dead transitions. [2025-04-14 01:15:11,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 92 transitions, 490 flow [2025-04-14 01:15:11,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-04-14 01:15:11,277 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4931972789115646 [2025-04-14 01:15:11,277 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 208 flow. Second operand 6 states and 145 transitions. [2025-04-14 01:15:11,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 92 transitions, 490 flow [2025-04-14 01:15:11,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 470 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-04-14 01:15:11,345 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 202 flow [2025-04-14 01:15:11,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-04-14 01:15:11,346 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2025-04-14 01:15:11,346 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 202 flow [2025-04-14 01:15:11,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-04-14 01:15:11,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:11,346 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:11,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:15:11,346 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:11,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash -621006568, now seen corresponding path program 1 times [2025-04-14 01:15:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:11,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049919014] [2025-04-14 01:15:11,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:11,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:15:11,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:15:11,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:11,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:11,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:11,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049919014] [2025-04-14 01:15:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049919014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734359557] [2025-04-14 01:15:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:11,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:11,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:11,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:11,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:11,514 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:11,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-04-14 01:15:11,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:11,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:11,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:11,979 INFO L116 PetriNetUnfolderBase]: 5361/8052 cut-off events. [2025-04-14 01:15:11,979 INFO L117 PetriNetUnfolderBase]: For 5747/5747 co-relation queries the response was YES. [2025-04-14 01:15:11,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19493 conditions, 8052 events. 5361/8052 cut-off events. For 5747/5747 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 46283 event pairs, 891 based on Foata normal form. 440/8450 useless extension candidates. Maximal degree in co-relation 19464. Up to 4096 conditions per place. [2025-04-14 01:15:12,010 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 74 selfloop transitions, 5 changer transitions 2/89 dead transitions. [2025-04-14 01:15:12,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 486 flow [2025-04-14 01:15:12,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2025-04-14 01:15:12,011 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48639455782312924 [2025-04-14 01:15:12,011 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 202 flow. Second operand 6 states and 143 transitions. [2025-04-14 01:15:12,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 486 flow [2025-04-14 01:15:12,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 456 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-14 01:15:12,015 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 182 flow [2025-04-14 01:15:12,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2025-04-14 01:15:12,016 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-04-14 01:15:12,016 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 182 flow [2025-04-14 01:15:12,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-04-14 01:15:12,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:12,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:12,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:15:12,016 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:12,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1621151476, now seen corresponding path program 1 times [2025-04-14 01:15:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:12,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833564387] [2025-04-14 01:15:12,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:12,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:12,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 01:15:12,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 01:15:12,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:12,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:12,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833564387] [2025-04-14 01:15:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833564387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323111202] [2025-04-14 01:15:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:12,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:12,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:12,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:12,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:12,251 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:12,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-04-14 01:15:12,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:12,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:12,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:12,728 INFO L116 PetriNetUnfolderBase]: 4872/7052 cut-off events. [2025-04-14 01:15:12,728 INFO L117 PetriNetUnfolderBase]: For 5269/5269 co-relation queries the response was YES. [2025-04-14 01:15:12,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18036 conditions, 7052 events. 4872/7052 cut-off events. For 5269/5269 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37206 event pairs, 875 based on Foata normal form. 278/7286 useless extension candidates. Maximal degree in co-relation 18008. Up to 4113 conditions per place. [2025-04-14 01:15:12,756 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 87 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-04-14 01:15:12,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 552 flow [2025-04-14 01:15:12,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:15:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:15:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-04-14 01:15:12,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2025-04-14 01:15:12,757 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 182 flow. Second operand 7 states and 168 transitions. [2025-04-14 01:15:12,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 552 flow [2025-04-14 01:15:12,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 533 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-04-14 01:15:12,761 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 206 flow [2025-04-14 01:15:12,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=206, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2025-04-14 01:15:12,762 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-04-14 01:15:12,762 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 206 flow [2025-04-14 01:15:12,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-04-14 01:15:12,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:12,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:12,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:15:12,762 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:12,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 67124594, now seen corresponding path program 2 times [2025-04-14 01:15:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:12,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640444905] [2025-04-14 01:15:12,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:15:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:12,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-14 01:15:12,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 41 statements. [2025-04-14 01:15:12,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:15:12,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:12,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:12,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640444905] [2025-04-14 01:15:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640444905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:12,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:15:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767415321] [2025-04-14 01:15:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:12,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:15:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:12,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:15:12,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:15:12,898 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:12,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-04-14 01:15:12,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:12,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:12,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:13,709 INFO L116 PetriNetUnfolderBase]: 8003/11453 cut-off events. [2025-04-14 01:15:13,709 INFO L117 PetriNetUnfolderBase]: For 9047/9047 co-relation queries the response was YES. [2025-04-14 01:15:13,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31023 conditions, 11453 events. 8003/11453 cut-off events. For 9047/9047 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 63687 event pairs, 922 based on Foata normal form. 340/11749 useless extension candidates. Maximal degree in co-relation 30995. Up to 5603 conditions per place. [2025-04-14 01:15:13,754 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 114 selfloop transitions, 11 changer transitions 0/133 dead transitions. [2025-04-14 01:15:13,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 133 transitions, 736 flow [2025-04-14 01:15:13,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-04-14 01:15:13,756 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-04-14 01:15:13,756 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 206 flow. Second operand 6 states and 180 transitions. [2025-04-14 01:15:13,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 133 transitions, 736 flow [2025-04-14 01:15:13,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 729 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:15:13,762 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 295 flow [2025-04-14 01:15:13,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-04-14 01:15:13,762 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2025-04-14 01:15:13,762 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 295 flow [2025-04-14 01:15:13,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-04-14 01:15:13,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:13,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:13,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:15:13,763 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:13,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2064445856, now seen corresponding path program 1 times [2025-04-14 01:15:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:13,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700330039] [2025-04-14 01:15:13,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:13,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 01:15:13,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 01:15:13,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:13,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:15:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:13,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700330039] [2025-04-14 01:15:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700330039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:15:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529774688] [2025-04-14 01:15:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:13,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:15:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:13,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:15:13,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:15:13,899 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:13,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-04-14 01:15:13,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:13,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:13,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:15,429 INFO L116 PetriNetUnfolderBase]: 15098/21349 cut-off events. [2025-04-14 01:15:15,429 INFO L117 PetriNetUnfolderBase]: For 41731/41731 co-relation queries the response was YES. [2025-04-14 01:15:15,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67139 conditions, 21349 events. 15098/21349 cut-off events. For 41731/41731 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 129298 event pairs, 1295 based on Foata normal form. 724/22037 useless extension candidates. Maximal degree in co-relation 67108. Up to 8966 conditions per place. [2025-04-14 01:15:15,533 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 171 selfloop transitions, 10 changer transitions 0/189 dead transitions. [2025-04-14 01:15:15,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 189 transitions, 1392 flow [2025-04-14 01:15:15,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2025-04-14 01:15:15,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-04-14 01:15:15,534 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 295 flow. Second operand 6 states and 189 transitions. [2025-04-14 01:15:15,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 189 transitions, 1392 flow [2025-04-14 01:15:15,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 189 transitions, 1295 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-04-14 01:15:15,569 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 360 flow [2025-04-14 01:15:15,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-04-14 01:15:15,570 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2025-04-14 01:15:15,570 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 360 flow [2025-04-14 01:15:15,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-04-14 01:15:15,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:15,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:15,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:15:15,570 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:15,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2142428848, now seen corresponding path program 2 times [2025-04-14 01:15:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:15,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617896630] [2025-04-14 01:15:15,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:15:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:15,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-14 01:15:15,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-04-14 01:15:15,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:15:15,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:15:15,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:15,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617896630] [2025-04-14 01:15:15,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617896630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908417347] [2025-04-14 01:15:15,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:15,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:15,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:15,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:15,798 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-04-14 01:15:15,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-04-14 01:15:15,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:15,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-04-14 01:15:15,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:18,366 INFO L116 PetriNetUnfolderBase]: 25143/34668 cut-off events. [2025-04-14 01:15:18,366 INFO L117 PetriNetUnfolderBase]: For 88358/88358 co-relation queries the response was YES. [2025-04-14 01:15:18,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122294 conditions, 34668 events. 25143/34668 cut-off events. For 88358/88358 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 209348 event pairs, 7902 based on Foata normal form. 1142/35802 useless extension candidates. Maximal degree in co-relation 122260. Up to 23990 conditions per place. [2025-04-14 01:15:18,659 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 182 selfloop transitions, 24 changer transitions 0/213 dead transitions. [2025-04-14 01:15:18,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 213 transitions, 1553 flow [2025-04-14 01:15:18,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:15:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:15:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 232 transitions. [2025-04-14 01:15:18,661 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5260770975056689 [2025-04-14 01:15:18,661 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 360 flow. Second operand 9 states and 232 transitions. [2025-04-14 01:15:18,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 213 transitions, 1553 flow [2025-04-14 01:15:19,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 213 transitions, 1520 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-04-14 01:15:19,201 INFO L231 Difference]: Finished difference. Result has 89 places, 92 transitions, 604 flow [2025-04-14 01:15:19,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=604, PETRI_PLACES=89, PETRI_TRANSITIONS=92} [2025-04-14 01:15:19,202 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2025-04-14 01:15:19,202 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 604 flow [2025-04-14 01:15:19,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-04-14 01:15:19,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:19,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:19,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:15:19,202 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:19,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1157708198, now seen corresponding path program 3 times [2025-04-14 01:15:19,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:19,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322330147] [2025-04-14 01:15:19,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:15:19,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:19,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 2 equivalence classes. [2025-04-14 01:15:19,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-04-14 01:15:19,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:15:19,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:15:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:19,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322330147] [2025-04-14 01:15:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322330147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:19,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:19,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509102426] [2025-04-14 01:15:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:19,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:15:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:19,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:15:19,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:15:19,446 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-04-14 01:15:19,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 604 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-04-14 01:15:19,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:19,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-04-14 01:15:19,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:25,136 INFO L116 PetriNetUnfolderBase]: 49742/67287 cut-off events. [2025-04-14 01:15:25,136 INFO L117 PetriNetUnfolderBase]: For 282102/282183 co-relation queries the response was YES. [2025-04-14 01:15:25,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271125 conditions, 67287 events. 49742/67287 cut-off events. For 282102/282183 co-relation queries the response was YES. Maximal size of possible extension queue 2545. Compared 435102 event pairs, 3816 based on Foata normal form. 1457/68641 useless extension candidates. Maximal degree in co-relation 271084. Up to 18497 conditions per place. [2025-04-14 01:15:25,768 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 253 selfloop transitions, 45 changer transitions 0/306 dead transitions. [2025-04-14 01:15:25,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 306 transitions, 2816 flow [2025-04-14 01:15:25,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2025-04-14 01:15:25,771 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2025-04-14 01:15:25,771 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 604 flow. Second operand 6 states and 183 transitions. [2025-04-14 01:15:25,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 306 transitions, 2816 flow [2025-04-14 01:15:26,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 306 transitions, 2780 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:26,694 INFO L231 Difference]: Finished difference. Result has 97 places, 129 transitions, 1021 flow [2025-04-14 01:15:26,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1021, PETRI_PLACES=97, PETRI_TRANSITIONS=129} [2025-04-14 01:15:26,695 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 47 predicate places. [2025-04-14 01:15:26,695 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 129 transitions, 1021 flow [2025-04-14 01:15:26,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-04-14 01:15:26,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:26,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:26,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 01:15:26,695 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:26,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1361217592, now seen corresponding path program 4 times [2025-04-14 01:15:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:26,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334247] [2025-04-14 01:15:26,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:15:26,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:26,709 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-14 01:15:26,725 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 01:15:26,725 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:15:26,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:15:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:26,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334247] [2025-04-14 01:15:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:15:26,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063279445] [2025-04-14 01:15:26,904 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:15:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:15:26,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:26,907 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-04-14 01:15:27,041 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-04-14 01:15:27,103 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-14 01:15:27,138 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 01:15:27,138 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:15:27,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:27,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:15:27,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:15:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:15:27,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:15:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:27,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063279445] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:15:27,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:15:27,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 14 [2025-04-14 01:15:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233730402] [2025-04-14 01:15:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:27,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:15:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:27,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:15:27,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:15:27,518 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2025-04-14 01:15:27,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 129 transitions, 1021 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:27,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:27,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2025-04-14 01:15:27,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:36,978 INFO L116 PetriNetUnfolderBase]: 82533/111327 cut-off events. [2025-04-14 01:15:36,979 INFO L117 PetriNetUnfolderBase]: For 496635/499949 co-relation queries the response was YES. [2025-04-14 01:15:37,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457751 conditions, 111327 events. 82533/111327 cut-off events. For 496635/499949 co-relation queries the response was YES. Maximal size of possible extension queue 3589. Compared 720546 event pairs, 13494 based on Foata normal form. 2964/113035 useless extension candidates. Maximal degree in co-relation 457706. Up to 59499 conditions per place. [2025-04-14 01:15:38,183 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 221 selfloop transitions, 85 changer transitions 0/314 dead transitions. [2025-04-14 01:15:38,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 314 transitions, 3033 flow [2025-04-14 01:15:38,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:15:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:15:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 243 transitions. [2025-04-14 01:15:38,184 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45083487940630795 [2025-04-14 01:15:38,184 INFO L175 Difference]: Start difference. First operand has 97 places, 129 transitions, 1021 flow. Second operand 11 states and 243 transitions. [2025-04-14 01:15:38,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 314 transitions, 3033 flow [2025-04-14 01:15:41,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 314 transitions, 3033 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:15:41,853 INFO L231 Difference]: Finished difference. Result has 114 places, 173 transitions, 1805 flow [2025-04-14 01:15:41,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1805, PETRI_PLACES=114, PETRI_TRANSITIONS=173} [2025-04-14 01:15:41,853 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 64 predicate places. [2025-04-14 01:15:41,854 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 173 transitions, 1805 flow [2025-04-14 01:15:41,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:41,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:41,854 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:41,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:15:42,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:15:42,055 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:42,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash 751458252, now seen corresponding path program 5 times [2025-04-14 01:15:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:42,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424538041] [2025-04-14 01:15:42,055 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:15:42,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:42,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-04-14 01:15:42,073 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:15:42,074 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:15:42,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:42,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424538041] [2025-04-14 01:15:42,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424538041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:15:42,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873573124] [2025-04-14 01:15:42,152 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:15:42,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:15:42,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:42,154 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-04-14 01:15:42,156 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-04-14 01:15:42,217 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-04-14 01:15:42,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:15:42,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:15:42,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:42,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:15:42,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:15:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:42,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:15:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:42,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873573124] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:15:42,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:15:42,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:15:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741620738] [2025-04-14 01:15:42,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:15:42,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:15:42,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:42,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:15:42,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:15:42,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:42,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 173 transitions, 1805 flow. Second operand has 12 states, 12 states have (on average 16.0) internal successors, (192), 12 states have internal predecessors, (192), 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-04-14 01:15:42,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:42,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:42,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:51,164 INFO L116 PetriNetUnfolderBase]: 60910/86043 cut-off events. [2025-04-14 01:15:51,165 INFO L117 PetriNetUnfolderBase]: For 555057/557799 co-relation queries the response was YES. [2025-04-14 01:15:51,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405909 conditions, 86043 events. 60910/86043 cut-off events. For 555057/557799 co-relation queries the response was YES. Maximal size of possible extension queue 3234. Compared 610130 event pairs, 24708 based on Foata normal form. 3466/87866 useless extension candidates. Maximal degree in co-relation 351947. Up to 52024 conditions per place. [2025-04-14 01:15:52,291 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 282 selfloop transitions, 41 changer transitions 2/337 dead transitions. [2025-04-14 01:15:52,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 337 transitions, 4151 flow [2025-04-14 01:15:52,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:15:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:15:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2025-04-14 01:15:52,292 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5043731778425656 [2025-04-14 01:15:52,293 INFO L175 Difference]: Start difference. First operand has 114 places, 173 transitions, 1805 flow. Second operand 7 states and 173 transitions. [2025-04-14 01:15:52,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 337 transitions, 4151 flow [2025-04-14 01:15:56,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 337 transitions, 4136 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 01:15:56,441 INFO L231 Difference]: Finished difference. Result has 122 places, 212 transitions, 2673 flow [2025-04-14 01:15:56,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2673, PETRI_PLACES=122, PETRI_TRANSITIONS=212} [2025-04-14 01:15:56,442 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 72 predicate places. [2025-04-14 01:15:56,442 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 212 transitions, 2673 flow [2025-04-14 01:15:56,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.0) internal successors, (192), 12 states have internal predecessors, (192), 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-04-14 01:15:56,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:56,442 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:56,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:15:56,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:15:56,644 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:56,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1600764932, now seen corresponding path program 3 times [2025-04-14 01:15:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:56,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810807785] [2025-04-14 01:15:56,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:15:56,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:56,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-14 01:15:56,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:15:56,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:15:56,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:56,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:56,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810807785] [2025-04-14 01:15:56,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810807785] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:15:56,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631383460] [2025-04-14 01:15:56,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:15:56,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:15:56,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:56,805 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-04-14 01:15:56,806 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-04-14 01:15:56,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-14 01:15:56,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:15:56,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:15:56,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:56,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:15:56,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:15:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:56,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:15:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:57,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631383460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:15:57,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:15:57,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:15:57,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921624688] [2025-04-14 01:15:57,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:15:57,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:15:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:57,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:15:57,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:15:57,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:15:57,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 212 transitions, 2673 flow. Second operand has 12 states, 12 states have (on average 16.333333333333332) internal successors, (196), 12 states have internal predecessors, (196), 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-04-14 01:15:57,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:57,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:15:57,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:12,357 INFO L116 PetriNetUnfolderBase]: 98262/140880 cut-off events. [2025-04-14 01:16:12,358 INFO L117 PetriNetUnfolderBase]: For 950132/954628 co-relation queries the response was YES. [2025-04-14 01:16:13,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664972 conditions, 140880 events. 98262/140880 cut-off events. For 950132/954628 co-relation queries the response was YES. Maximal size of possible extension queue 5348. Compared 1092963 event pairs, 38681 based on Foata normal form. 4675/142824 useless extension candidates. Maximal degree in co-relation 576957. Up to 79583 conditions per place. [2025-04-14 01:16:14,411 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 429 selfloop transitions, 13 changer transitions 0/454 dead transitions. [2025-04-14 01:16:14,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 454 transitions, 6758 flow [2025-04-14 01:16:14,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:16:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:16:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2025-04-14 01:16:14,412 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4956268221574344 [2025-04-14 01:16:14,412 INFO L175 Difference]: Start difference. First operand has 122 places, 212 transitions, 2673 flow. Second operand 7 states and 170 transitions. [2025-04-14 01:16:14,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 454 transitions, 6758 flow [2025-04-14 01:16:26,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 454 transitions, 6748 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 01:16:26,097 INFO L231 Difference]: Finished difference. Result has 130 places, 222 transitions, 2855 flow [2025-04-14 01:16:26,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2663, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2855, PETRI_PLACES=130, PETRI_TRANSITIONS=222} [2025-04-14 01:16:26,097 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 80 predicate places. [2025-04-14 01:16:26,097 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 222 transitions, 2855 flow [2025-04-14 01:16:26,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.333333333333332) internal successors, (196), 12 states have internal predecessors, (196), 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-04-14 01:16:26,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:26,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:26,104 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-04-14 01:16:26,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:26,302 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:16:26,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1987269760, now seen corresponding path program 1 times [2025-04-14 01:16:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:26,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177883280] [2025-04-14 01:16:26,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:26,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 01:16:26,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:16:26,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:26,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:16:28,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:28,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177883280] [2025-04-14 01:16:28,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177883280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:28,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027724742] [2025-04-14 01:16:28,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:28,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:28,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:28,233 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-04-14 01:16:28,236 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-04-14 01:16:28,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 01:16:28,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:16:28,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:28,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:28,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:16:28,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:28,810 INFO L325 Elim1Store]: treesize reduction 16, result has 69.8 percent of original size [2025-04-14 01:16:28,811 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 50 [2025-04-14 01:16:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:16:28,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:29,206 INFO L325 Elim1Store]: treesize reduction 19, result has 92.5 percent of original size [2025-04-14 01:16:29,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 250 [2025-04-14 01:16:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:16:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027724742] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:16:33,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:16:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 19 [2025-04-14 01:16:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964042148] [2025-04-14 01:16:33,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:16:33,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 01:16:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:33,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 01:16:33,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:16:33,818 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:16:33,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 222 transitions, 2855 flow. Second operand has 21 states, 21 states have (on average 16.666666666666668) internal successors, (350), 21 states have internal predecessors, (350), 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-04-14 01:16:33,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:33,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:16:33,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:56,296 INFO L116 PetriNetUnfolderBase]: 136892/195685 cut-off events. [2025-04-14 01:16:56,296 INFO L117 PetriNetUnfolderBase]: For 1355566/1362582 co-relation queries the response was YES. [2025-04-14 01:16:58,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947122 conditions, 195685 events. 136892/195685 cut-off events. For 1355566/1362582 co-relation queries the response was YES. Maximal size of possible extension queue 7354. Compared 1538467 event pairs, 8939 based on Foata normal form. 2054/193388 useless extension candidates. Maximal degree in co-relation 797864. Up to 89011 conditions per place. [2025-04-14 01:16:59,153 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 516 selfloop transitions, 102 changer transitions 3/633 dead transitions. [2025-04-14 01:16:59,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 633 transitions, 8879 flow [2025-04-14 01:16:59,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 01:16:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 01:16:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 403 transitions. [2025-04-14 01:16:59,154 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45691609977324266 [2025-04-14 01:16:59,154 INFO L175 Difference]: Start difference. First operand has 130 places, 222 transitions, 2855 flow. Second operand 18 states and 403 transitions. [2025-04-14 01:16:59,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 633 transitions, 8879 flow [2025-04-14 01:17:41,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 633 transitions, 8859 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-14 01:17:41,698 INFO L231 Difference]: Finished difference. Result has 152 places, 289 transitions, 4263 flow [2025-04-14 01:17:41,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2843, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4263, PETRI_PLACES=152, PETRI_TRANSITIONS=289} [2025-04-14 01:17:41,698 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 102 predicate places. [2025-04-14 01:17:41,698 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 289 transitions, 4263 flow [2025-04-14 01:17:41,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 16.666666666666668) internal successors, (350), 21 states have internal predecessors, (350), 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-04-14 01:17:41,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:41,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:41,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:17:41,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 01:17:41,899 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:17:41,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1986878926, now seen corresponding path program 2 times [2025-04-14 01:17:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:41,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126320505] [2025-04-14 01:17:41,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:17:41,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:41,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-14 01:17:41,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:17:41,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:41,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:43,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:43,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126320505] [2025-04-14 01:17:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126320505] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:43,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915854836] [2025-04-14 01:17:43,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:17:43,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:43,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:43,801 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-04-14 01:17:43,803 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-04-14 01:17:43,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-14 01:17:43,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:17:43,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:43,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:43,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-14 01:17:43,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:43,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:17:43,968 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:17:44,026 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-14 01:17:44,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-14 01:17:44,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:17:44,089 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:17:44,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:17:44,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:17:44,685 INFO L325 Elim1Store]: treesize reduction 13, result has 55.2 percent of original size [2025-04-14 01:17:44,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 30 [2025-04-14 01:17:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:44,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:45,453 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:17:45,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 109 [2025-04-14 01:17:45,490 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:17:45,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1422 treesize of output 1354 [2025-04-14 01:17:45,579 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:17:45,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 726 treesize of output 818 [2025-04-14 01:17:45,680 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:17:45,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 618 treesize of output 650