/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:00:28,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:00:28,543 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-13 20:00:28,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:00:28,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:00:28,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:00:28,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:00:28,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:00:28,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:00:28,563 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:00:28,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:00:28,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:00:28,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:00:28,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:00:28,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:00:28,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:00:28,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:00:28,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:00:28,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:00:28,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:00:28,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:00:28,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:00:28,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:00:28,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:00:28,566 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 [2025-04-13 20:00:28,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:00:28,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:00:28,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:00:28,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:00:28,781 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:00:28,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2025-04-13 20:00:30,093 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2032d64/ee88eae15d264f4e93abb414adef04df/FLAG300c27fd8 [2025-04-13 20:00:30,278 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:00:30,278 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2025-04-13 20:00:30,286 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2032d64/ee88eae15d264f4e93abb414adef04df/FLAG300c27fd8 [2025-04-13 20:00:31,143 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2032d64/ee88eae15d264f4e93abb414adef04df [2025-04-13 20:00:31,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:00:31,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:00:31,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:00:31,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:00:31,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:00:31,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237d4a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31, skipping insertion in model container [2025-04-13 20:00:31,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:00:31,333 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/chl-node-trans.wvr.c[3984,3997] [2025-04-13 20:00:31,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:00:31,359 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:00:31,398 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/chl-node-trans.wvr.c[3984,3997] [2025-04-13 20:00:31,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:00:31,422 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:00:31,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31 WrapperNode [2025-04-13 20:00:31,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:00:31,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:00:31,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:00:31,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:00:31,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,457 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2025-04-13 20:00:31,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:00:31,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:00:31,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:00:31,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:00:31,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,489 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-04-13 20:00:31,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:00:31,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:00:31,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:00:31,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:00:31,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (1/1) ... [2025-04-13 20:00:31,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:00:31,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:00:31,539 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-13 20:00:31,541 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-13 20:00:31,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:00:31,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:00:31,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:00:31,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:00:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:00:31,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:00:31,559 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:00:31,665 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:00:31,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:00:32,076 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:00:32,077 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:00:32,077 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:00:32,492 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:00:32,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:00:32 BoogieIcfgContainer [2025-04-13 20:00:32,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:00:32,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:00:32,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:00:32,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:00:32,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:00:31" (1/3) ... [2025-04-13 20:00:32,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6400dab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:00:32, skipping insertion in model container [2025-04-13 20:00:32,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:00:31" (2/3) ... [2025-04-13 20:00:32,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6400dab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:00:32, skipping insertion in model container [2025-04-13 20:00:32,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:00:32" (3/3) ... [2025-04-13 20:00:32,499 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-04-13 20:00:32,511 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:00:32,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 20:00:32,512 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:00:32,567 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:00:32,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 20:00:32,615 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-13 20:00:32,617 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:00:32,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-13 20:00:32,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 20:00:32,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-13 20:00:32,628 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:00:32,638 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;@654cb4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:00:32,638 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:00:32,662 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:00:32,662 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-13 20:00:32,662 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:00:32,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:32,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:32,663 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 1 more)] === [2025-04-13 20:00:32,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:32,666 INFO L85 PathProgramCache]: Analyzing trace with hash 395713882, now seen corresponding path program 1 times [2025-04-13 20:00:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:32,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121625115] [2025-04-13 20:00:32,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:00:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:32,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:00:32,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:00:32,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:00:32,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:33,081 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-13 20:00:33,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:33,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121625115] [2025-04-13 20:00:33,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121625115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:33,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:33,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:00:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717134299] [2025-04-13 20:00:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:33,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:00:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:33,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:00:33,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:00:33,105 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:33,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-13 20:00:33,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:33,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:33,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:33,206 INFO L116 PetriNetUnfolderBase]: 38/82 cut-off events. [2025-04-13 20:00:33,207 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:00:33,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 82 events. 38/82 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2025-04-13 20:00:33,210 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-04-13 20:00:33,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 126 flow [2025-04-13 20:00:33,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:00:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:00:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 20:00:33,219 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2025-04-13 20:00:33,220 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 3 states and 37 transitions. [2025-04-13 20:00:33,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 126 flow [2025-04-13 20:00:33,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:00:33,227 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 70 flow [2025-04-13 20:00:33,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-13 20:00:33,232 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-13 20:00:33,232 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 70 flow [2025-04-13 20:00:33,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-13 20:00:33,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:33,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:33,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:00:33,233 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 1 more)] === [2025-04-13 20:00:33,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:33,233 INFO L85 PathProgramCache]: Analyzing trace with hash -351411052, now seen corresponding path program 1 times [2025-04-13 20:00:33,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:33,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198185690] [2025-04-13 20:00:33,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:00:33,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:33,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:00:33,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:00:33,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:00:33,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:33,469 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-13 20:00:33,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:33,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198185690] [2025-04-13 20:00:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198185690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:00:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638682431] [2025-04-13 20:00:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:33,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:00:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:33,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:00:33,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:00:33,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:33,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-13 20:00:33,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:33,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:33,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:33,574 INFO L116 PetriNetUnfolderBase]: 38/83 cut-off events. [2025-04-13 20:00:33,574 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 20:00:33,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 83 events. 38/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 171. Up to 82 conditions per place. [2025-04-13 20:00:33,576 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 25 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-04-13 20:00:33,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 128 flow [2025-04-13 20:00:33,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:00:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:00:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 20:00:33,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:00:33,579 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 70 flow. Second operand 4 states and 40 transitions. [2025-04-13 20:00:33,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 128 flow [2025-04-13 20:00:33,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 124 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:00:33,580 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 80 flow [2025-04-13 20:00:33,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2025-04-13 20:00:33,581 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2025-04-13 20:00:33,581 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 80 flow [2025-04-13 20:00:33,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-13 20:00:33,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:33,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:33,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:00:33,581 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 1 more)] === [2025-04-13 20:00:33,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash -55807966, now seen corresponding path program 1 times [2025-04-13 20:00:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:33,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539709121] [2025-04-13 20:00:33,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:00:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:33,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:00:33,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:00:33,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:00:33,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:00:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:33,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539709121] [2025-04-13 20:00:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539709121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:33,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:33,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:00:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193735907] [2025-04-13 20:00:33,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:33,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:00:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:33,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:00:33,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:00:33,781 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:33,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-13 20:00:33,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:33,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:33,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:33,887 INFO L116 PetriNetUnfolderBase]: 38/84 cut-off events. [2025-04-13 20:00:33,887 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:00:33,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 84 events. 38/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 171. Up to 82 conditions per place. [2025-04-13 20:00:33,888 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 25 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-04-13 20:00:33,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 140 flow [2025-04-13 20:00:33,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:00:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:00:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-13 20:00:33,889 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2025-04-13 20:00:33,889 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 80 flow. Second operand 4 states and 41 transitions. [2025-04-13 20:00:33,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 140 flow [2025-04-13 20:00:33,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 134 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 20:00:33,890 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 92 flow [2025-04-13 20:00:33,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-04-13 20:00:33,891 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-04-13 20:00:33,891 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 92 flow [2025-04-13 20:00:33,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-13 20:00:33,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:33,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:33,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:00:33,891 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 1 more)] === [2025-04-13 20:00:33,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash 977231474, now seen corresponding path program 1 times [2025-04-13 20:00:33,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:33,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107143593] [2025-04-13 20:00:33,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:00:33,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:33,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:00:33,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:00:33,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:00:33,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:34,060 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-13 20:00:34,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:34,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107143593] [2025-04-13 20:00:34,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107143593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:34,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:34,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:00:34,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048592143] [2025-04-13 20:00:34,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:34,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:00:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:34,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:00:34,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:00:34,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:34,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 20:00:34,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:34,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:34,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:34,143 INFO L116 PetriNetUnfolderBase]: 38/85 cut-off events. [2025-04-13 20:00:34,143 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:00:34,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 85 events. 38/85 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 176. Up to 84 conditions per place. [2025-04-13 20:00:34,144 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 27 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2025-04-13 20:00:34,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 154 flow [2025-04-13 20:00:34,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:00:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:00:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 20:00:34,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:00:34,145 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 92 flow. Second operand 4 states and 40 transitions. [2025-04-13 20:00:34,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 154 flow [2025-04-13 20:00:34,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:00:34,146 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 102 flow [2025-04-13 20:00:34,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-04-13 20:00:34,147 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2025-04-13 20:00:34,147 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 102 flow [2025-04-13 20:00:34,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 20:00:34,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:34,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:34,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:00:34,147 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 1 more)] === [2025-04-13 20:00:34,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:34,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1002046910, now seen corresponding path program 1 times [2025-04-13 20:00:34,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:34,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430591781] [2025-04-13 20:00:34,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:00:34,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:34,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:00:34,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:00:34,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:00:34,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:34,310 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-13 20:00:34,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:34,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430591781] [2025-04-13 20:00:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430591781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:34,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:00:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674420279] [2025-04-13 20:00:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:34,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:00:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:34,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:00:34,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:00:34,312 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:34,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 20:00:34,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:34,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:34,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:34,395 INFO L116 PetriNetUnfolderBase]: 38/86 cut-off events. [2025-04-13 20:00:34,395 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:00:34,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 86 events. 38/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 182. Up to 85 conditions per place. [2025-04-13 20:00:34,396 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-04-13 20:00:34,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 166 flow [2025-04-13 20:00:34,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:00:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:00:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 20:00:34,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:00:34,398 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 102 flow. Second operand 4 states and 40 transitions. [2025-04-13 20:00:34,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 166 flow [2025-04-13 20:00:34,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 160 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 20:00:34,399 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 110 flow [2025-04-13 20:00:34,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-04-13 20:00:34,400 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-13 20:00:34,400 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 110 flow [2025-04-13 20:00:34,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 20:00:34,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:34,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:34,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:00:34,400 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 1 more)] === [2025-04-13 20:00:34,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:34,400 INFO L85 PathProgramCache]: Analyzing trace with hash 565631141, now seen corresponding path program 1 times [2025-04-13 20:00:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:34,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820466510] [2025-04-13 20:00:34,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:00:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:34,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:00:34,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:00:34,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:00:34,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:00:34,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:34,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820466510] [2025-04-13 20:00:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820466510] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:00:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167683687] [2025-04-13 20:00:34,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:34,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:00:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:34,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:00:34,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:00:34,524 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:34,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 20:00:34,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:34,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:34,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:34,595 INFO L116 PetriNetUnfolderBase]: 38/87 cut-off events. [2025-04-13 20:00:34,595 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-13 20:00:34,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 87 events. 38/87 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 187. Up to 86 conditions per place. [2025-04-13 20:00:34,595 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 29 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-04-13 20:00:34,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 176 flow [2025-04-13 20:00:34,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:00:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:00:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 20:00:34,596 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:00:34,596 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 110 flow. Second operand 4 states and 40 transitions. [2025-04-13 20:00:34,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 176 flow [2025-04-13 20:00:34,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 20:00:34,597 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 118 flow [2025-04-13 20:00:34,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-04-13 20:00:34,598 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2025-04-13 20:00:34,598 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 118 flow [2025-04-13 20:00:34,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 20:00:34,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:34,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:34,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:00:34,598 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 1 more)] === [2025-04-13 20:00:34,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1834315460, now seen corresponding path program 1 times [2025-04-13 20:00:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:34,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600819615] [2025-04-13 20:00:34,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:00:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:34,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:00:34,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:00:34,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:00:34,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:00:35,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:35,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600819615] [2025-04-13 20:00:35,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600819615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:35,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:35,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:35,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904357994] [2025-04-13 20:00:35,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:35,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:35,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:35,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:35,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:35,321 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:35,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:35,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:35,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:35,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:35,481 INFO L116 PetriNetUnfolderBase]: 39/105 cut-off events. [2025-04-13 20:00:35,481 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 20:00:35,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 105 events. 39/105 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 283 event pairs, 7 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 227. Up to 41 conditions per place. [2025-04-13 20:00:35,482 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 42 selfloop transitions, 2 changer transitions 7/51 dead transitions. [2025-04-13 20:00:35,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 267 flow [2025-04-13 20:00:35,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:00:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:00:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-13 20:00:35,485 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2025-04-13 20:00:35,485 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 118 flow. Second operand 5 states and 61 transitions. [2025-04-13 20:00:35,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 267 flow [2025-04-13 20:00:35,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 261 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 20:00:35,486 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 127 flow [2025-04-13 20:00:35,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-04-13 20:00:35,487 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-04-13 20:00:35,487 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 127 flow [2025-04-13 20:00:35,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:35,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:35,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:35,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:00:35,489 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 1 more)] === [2025-04-13 20:00:35,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 750395152, now seen corresponding path program 2 times [2025-04-13 20:00:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:35,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058244771] [2025-04-13 20:00:35,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:00:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:35,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:00:35,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 20:00:35,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:00:35,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:00:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:36,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058244771] [2025-04-13 20:00:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058244771] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:36,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:36,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652053377] [2025-04-13 20:00:36,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:36,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:36,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:36,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:36,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:36,036 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:36,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:36,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:36,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:36,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:36,188 INFO L116 PetriNetUnfolderBase]: 35/109 cut-off events. [2025-04-13 20:00:36,188 INFO L117 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-04-13 20:00:36,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 109 events. 35/109 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 304 event pairs, 10 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 290. Up to 48 conditions per place. [2025-04-13 20:00:36,190 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 41 selfloop transitions, 3 changer transitions 5/49 dead transitions. [2025-04-13 20:00:36,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 275 flow [2025-04-13 20:00:36,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:00:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:00:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-04-13 20:00:36,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2025-04-13 20:00:36,191 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 127 flow. Second operand 5 states and 58 transitions. [2025-04-13 20:00:36,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 275 flow [2025-04-13 20:00:36,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 268 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:00:36,194 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 144 flow [2025-04-13 20:00:36,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2025-04-13 20:00:36,195 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-04-13 20:00:36,195 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 144 flow [2025-04-13 20:00:36,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:36,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:36,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:36,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:00:36,195 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 1 more)] === [2025-04-13 20:00:36,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash 873582962, now seen corresponding path program 3 times [2025-04-13 20:00:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:36,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330659087] [2025-04-13 20:00:36,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:00:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:36,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:00:36,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 20:00:36,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:00:36,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:00:36,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:36,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330659087] [2025-04-13 20:00:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330659087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:36,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:36,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121261605] [2025-04-13 20:00:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:36,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:36,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:36,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:36,644 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:36,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:36,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:36,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:36,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:36,792 INFO L116 PetriNetUnfolderBase]: 35/112 cut-off events. [2025-04-13 20:00:36,792 INFO L117 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-04-13 20:00:36,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 112 events. 35/112 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 351 event pairs, 8 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 348. Up to 50 conditions per place. [2025-04-13 20:00:36,793 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 40 selfloop transitions, 2 changer transitions 9/51 dead transitions. [2025-04-13 20:00:36,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 307 flow [2025-04-13 20:00:36,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:00:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:00:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-04-13 20:00:36,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2025-04-13 20:00:36,795 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 144 flow. Second operand 5 states and 59 transitions. [2025-04-13 20:00:36,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 307 flow [2025-04-13 20:00:36,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 296 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 20:00:36,797 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 151 flow [2025-04-13 20:00:36,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2025-04-13 20:00:36,797 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-04-13 20:00:36,797 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 151 flow [2025-04-13 20:00:36,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:36,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:36,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:36,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:00:36,799 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 1 more)] === [2025-04-13 20:00:36,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:36,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1147905634, now seen corresponding path program 4 times [2025-04-13 20:00:36,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:36,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934928948] [2025-04-13 20:00:36,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:00:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:36,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:00:36,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:00:36,835 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:00:36,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:00:37,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:37,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934928948] [2025-04-13 20:00:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934928948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:37,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:37,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077083719] [2025-04-13 20:00:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:37,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:37,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:37,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:37,282 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:37,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:37,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:37,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:37,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:37,425 INFO L116 PetriNetUnfolderBase]: 30/96 cut-off events. [2025-04-13 20:00:37,425 INFO L117 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2025-04-13 20:00:37,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 96 events. 30/96 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 225 event pairs, 15 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 327. Up to 64 conditions per place. [2025-04-13 20:00:37,426 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 40 selfloop transitions, 3 changer transitions 7/50 dead transitions. [2025-04-13 20:00:37,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 319 flow [2025-04-13 20:00:37,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:00:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:00:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-13 20:00:37,428 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-04-13 20:00:37,428 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 151 flow. Second operand 5 states and 57 transitions. [2025-04-13 20:00:37,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 319 flow [2025-04-13 20:00:37,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 300 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 20:00:37,430 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 158 flow [2025-04-13 20:00:37,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-04-13 20:00:37,430 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-04-13 20:00:37,430 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 158 flow [2025-04-13 20:00:37,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:37,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:37,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:37,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:00:37,431 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 1 more)] === [2025-04-13 20:00:37,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1460525892, now seen corresponding path program 5 times [2025-04-13 20:00:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:37,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950563447] [2025-04-13 20:00:37,431 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:00:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:37,448 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:00:37,470 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:00:37,471 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:00:37,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:00:37,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:37,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950563447] [2025-04-13 20:00:37,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950563447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:37,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:37,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:37,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128859624] [2025-04-13 20:00:37,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:37,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:37,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:37,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:37,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:37,949 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:37,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:37,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:37,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:37,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:38,086 INFO L116 PetriNetUnfolderBase]: 24/76 cut-off events. [2025-04-13 20:00:38,087 INFO L117 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-04-13 20:00:38,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 76 events. 24/76 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 143 event pairs, 7 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 271. Up to 45 conditions per place. [2025-04-13 20:00:38,087 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 33 selfloop transitions, 1 changer transitions 14/48 dead transitions. [2025-04-13 20:00:38,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 296 flow [2025-04-13 20:00:38,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:00:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:00:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-13 20:00:38,089 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-04-13 20:00:38,089 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 158 flow. Second operand 5 states and 57 transitions. [2025-04-13 20:00:38,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 296 flow [2025-04-13 20:00:38,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 284 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 20:00:38,091 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 137 flow [2025-04-13 20:00:38,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2025-04-13 20:00:38,091 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-04-13 20:00:38,091 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 137 flow [2025-04-13 20:00:38,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:38,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:38,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:38,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:00:38,092 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 1 more)] === [2025-04-13 20:00:38,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -480389706, now seen corresponding path program 6 times [2025-04-13 20:00:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:38,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567560896] [2025-04-13 20:00:38,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:00:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:38,107 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:00:38,134 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 20:00:38,134 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:00:38,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:00:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:38,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567560896] [2025-04-13 20:00:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567560896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:38,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:38,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:38,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280081045] [2025-04-13 20:00:38,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:38,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:38,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:38,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:38,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:38,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:38,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:38,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:38,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:38,623 INFO L116 PetriNetUnfolderBase]: 15/51 cut-off events. [2025-04-13 20:00:38,624 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-13 20:00:38,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 51 events. 15/51 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 5 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 176. Up to 38 conditions per place. [2025-04-13 20:00:38,624 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2025-04-13 20:00:38,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 227 flow [2025-04-13 20:00:38,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:00:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:00:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-13 20:00:38,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31333333333333335 [2025-04-13 20:00:38,625 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 137 flow. Second operand 5 states and 47 transitions. [2025-04-13 20:00:38,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 227 flow [2025-04-13 20:00:38,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 209 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-04-13 20:00:38,626 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2025-04-13 20:00:38,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2025-04-13 20:00:38,626 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-04-13 20:00:38,626 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2025-04-13 20:00:38,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 20:00:38,628 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:00:38,628 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:00:38,628 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:00:38,628 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:00:38,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:00:38,629 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:38,634 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:00:38,634 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:00:38,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:00:38 BasicIcfg [2025-04-13 20:00:38,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:00:38,637 INFO L158 Benchmark]: Toolchain (without parser) took 7491.82ms. Allocated memory was 142.6MB in the beginning and 499.1MB in the end (delta: 356.5MB). Free memory was 99.1MB in the beginning and 430.4MB in the end (delta: -331.3MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. [2025-04-13 20:00:38,638 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:38,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.73ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 82.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:00:38,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.93ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 79.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:38,639 INFO L158 Benchmark]: Boogie Preprocessor took 54.16ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 75.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:00:38,639 INFO L158 Benchmark]: RCFGBuilder took 980.58ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 53.6MB in the end (delta: 22.0MB). Peak memory consumption was 62.0MB. Max. memory is 8.0GB. [2025-04-13 20:00:38,639 INFO L158 Benchmark]: TraceAbstraction took 6142.85ms. Allocated memory was 142.6MB in the beginning and 499.1MB in the end (delta: 356.5MB). Free memory was 53.6MB in the beginning and 430.4MB in the end (delta: -376.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:38,640 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.73ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 82.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.93ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 79.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 54.16ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 75.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 980.58ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 53.6MB in the end (delta: 22.0MB). Peak memory consumption was 62.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6142.85ms. Allocated memory was 142.6MB in the beginning and 499.1MB in the end (delta: 356.5MB). Free memory was 53.6MB in the beginning and 430.4MB in the end (delta: -376.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 34 locations, 39 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1062 IncrementalHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 1062 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 291 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 51/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 20:00:38,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...