/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/pthread-wmm/safe012_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:36:28,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:36:28,544 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 19:36:28,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:36:28,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:36:28,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:36:28,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:36:28,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:36:28,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:36:28,573 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:36:28,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:36:28,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:36:28,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:36:28,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:36:28,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:36:28,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:36:28,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:28,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:28,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:36:28,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:36:28,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:36:28,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:36:28,577 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 19:36:28,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:36:28,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:36:28,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:36:28,835 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:36:28,836 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:36:28,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2025-04-13 19:36:30,174 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11864f00/1af643322c6246288615e02f9ce816bc/FLAG97d5885a8 [2025-04-13 19:36:30,354 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:36:30,355 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2025-04-13 19:36:30,365 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11864f00/1af643322c6246288615e02f9ce816bc/FLAG97d5885a8 [2025-04-13 19:36:31,225 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11864f00/1af643322c6246288615e02f9ce816bc [2025-04-13 19:36:31,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:36:31,228 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:36:31,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:36:31,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:36:31,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:36:31,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ccea79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31, skipping insertion in model container [2025-04-13 19:36:31,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:36:31,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_tso.i[945,958] [2025-04-13 19:36:31,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:36:31,589 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:36:31,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_tso.i[945,958] [2025-04-13 19:36:31,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:36:31,656 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:36:31,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31 WrapperNode [2025-04-13 19:36:31,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:36:31,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:36:31,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:36:31,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:36:31,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,697 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-04-13 19:36:31,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:36:31,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:36:31,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:36:31,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:36:31,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,722 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:36:31,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:36:31,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:36:31,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:36:31,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:36:31,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:31,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:36:31,776 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 19:36:31,779 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 19:36:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:36:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:36:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:36:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:36:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:36:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:36:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:36:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:36:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:36:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:36:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:36:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:36:31,804 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 19:36:31,908 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:36:31,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:36:32,029 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:36:32,031 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:36:32,031 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:36:32,119 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:36:32,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:36:32 BoogieIcfgContainer [2025-04-13 19:36:32,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:36:32,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:36:32,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:36:32,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:36:32,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:36:31" (1/3) ... [2025-04-13 19:36:32,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734f88f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:36:32, skipping insertion in model container [2025-04-13 19:36:32,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31" (2/3) ... [2025-04-13 19:36:32,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734f88f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:36:32, skipping insertion in model container [2025-04-13 19:36:32,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:36:32" (3/3) ... [2025-04-13 19:36:32,128 INFO L128 eAbstractionObserver]: Analyzing ICFG safe012_tso.i [2025-04-13 19:36:32,138 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:36:32,139 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe012_tso.i that has 4 procedures, 35 locations, 31 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:36:32,140 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:36:32,175 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:36:32,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 19:36:32,226 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-13 19:36:32,229 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:36:32,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:36:32,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 19:36:32,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 30 transitions, 69 flow [2025-04-13 19:36:32,241 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:36:32,252 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;@2b123f2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:36:32,252 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:36:32,261 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:36:32,265 INFO L116 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-04-13 19:36:32,265 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:36:32,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:32,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:32,266 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 19:36:32,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1023405359, now seen corresponding path program 1 times [2025-04-13 19:36:32,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:32,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936374755] [2025-04-13 19:36:32,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:32,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:36:32,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:36:32,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:32,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:32,684 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 19:36:32,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:32,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936374755] [2025-04-13 19:36:32,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936374755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:32,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:32,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:36:32,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480389858] [2025-04-13 19:36:32,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:32,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:32,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:32,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:32,722 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 34 [2025-04-13 19:36:32,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:32,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:32,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 34 [2025-04-13 19:36:32,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:32,859 INFO L116 PetriNetUnfolderBase]: 103/276 cut-off events. [2025-04-13 19:36:32,860 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:36:32,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 276 events. 103/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1549 event pairs, 19 based on Foata normal form. 12/270 useless extension candidates. Maximal degree in co-relation 476. Up to 133 conditions per place. [2025-04-13 19:36:32,864 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 20 selfloop transitions, 2 changer transitions 7/45 dead transitions. [2025-04-13 19:36:32,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 163 flow [2025-04-13 19:36:32,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-04-13 19:36:32,874 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7411764705882353 [2025-04-13 19:36:32,875 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 5 states and 126 transitions. [2025-04-13 19:36:32,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 163 flow [2025-04-13 19:36:32,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:36:32,881 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 78 flow [2025-04-13 19:36:32,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2025-04-13 19:36:32,886 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-04-13 19:36:32,886 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 78 flow [2025-04-13 19:36:32,887 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:32,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:32,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:32,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:36:32,887 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 19:36:32,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash -894134636, now seen corresponding path program 1 times [2025-04-13 19:36:32,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:32,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33819233] [2025-04-13 19:36:32,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:32,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:36:32,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:36:32,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:32,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:33,067 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 19:36:33,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:33,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33819233] [2025-04-13 19:36:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33819233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:33,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:33,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594083071] [2025-04-13 19:36:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:33,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:33,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:33,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:33,083 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 34 [2025-04-13 19:36:33,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 19:36:33,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:33,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 34 [2025-04-13 19:36:33,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:33,301 INFO L116 PetriNetUnfolderBase]: 339/707 cut-off events. [2025-04-13 19:36:33,302 INFO L117 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2025-04-13 19:36:33,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 707 events. 339/707 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4551 event pairs, 48 based on Foata normal form. 30/720 useless extension candidates. Maximal degree in co-relation 1413. Up to 229 conditions per place. [2025-04-13 19:36:33,306 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 34 selfloop transitions, 7 changer transitions 18/72 dead transitions. [2025-04-13 19:36:33,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 300 flow [2025-04-13 19:36:33,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:36:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:36:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-04-13 19:36:33,308 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-04-13 19:36:33,308 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 78 flow. Second operand 9 states and 207 transitions. [2025-04-13 19:36:33,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 300 flow [2025-04-13 19:36:33,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 284 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:33,311 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 132 flow [2025-04-13 19:36:33,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=132, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2025-04-13 19:36:33,311 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-04-13 19:36:33,312 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 132 flow [2025-04-13 19:36:33,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 19:36:33,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:33,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:33,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:36:33,312 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 19:36:33,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1497832712, now seen corresponding path program 1 times [2025-04-13 19:36:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:33,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378485627] [2025-04-13 19:36:33,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:33,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:36:33,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:36:33,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:33,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:33,437 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 19:36:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:33,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378485627] [2025-04-13 19:36:33,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378485627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:33,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81137554] [2025-04-13 19:36:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:33,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:33,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:33,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:33,444 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:36:33,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:33,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:33,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:36:33,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:33,534 INFO L116 PetriNetUnfolderBase]: 225/515 cut-off events. [2025-04-13 19:36:33,534 INFO L117 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2025-04-13 19:36:33,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 515 events. 225/515 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3144 event pairs, 61 based on Foata normal form. 12/496 useless extension candidates. Maximal degree in co-relation 1331. Up to 249 conditions per place. [2025-04-13 19:36:33,538 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 23 selfloop transitions, 3 changer transitions 7/48 dead transitions. [2025-04-13 19:36:33,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 241 flow [2025-04-13 19:36:33,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-04-13 19:36:33,539 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2025-04-13 19:36:33,539 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 132 flow. Second operand 5 states and 116 transitions. [2025-04-13 19:36:33,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 241 flow [2025-04-13 19:36:33,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 226 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:33,542 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 134 flow [2025-04-13 19:36:33,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-04-13 19:36:33,544 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-04-13 19:36:33,545 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 134 flow [2025-04-13 19:36:33,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:33,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:33,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:33,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:36:33,545 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 19:36:33,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash -811511789, now seen corresponding path program 1 times [2025-04-13 19:36:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:33,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326429278] [2025-04-13 19:36:33,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:33,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:33,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:36:33,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:36:33,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:33,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:33,642 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 19:36:33,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:33,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326429278] [2025-04-13 19:36:33,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326429278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:33,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:33,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:33,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859936562] [2025-04-13 19:36:33,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:33,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:33,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:33,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:33,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:33,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 34 [2025-04-13 19:36:33,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:33,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:33,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 34 [2025-04-13 19:36:33,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:33,761 INFO L116 PetriNetUnfolderBase]: 245/545 cut-off events. [2025-04-13 19:36:33,761 INFO L117 PetriNetUnfolderBase]: For 550/574 co-relation queries the response was YES. [2025-04-13 19:36:33,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 545 events. 245/545 cut-off events. For 550/574 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3466 event pairs, 75 based on Foata normal form. 22/537 useless extension candidates. Maximal degree in co-relation 1319. Up to 142 conditions per place. [2025-04-13 19:36:33,763 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 19 selfloop transitions, 3 changer transitions 16/53 dead transitions. [2025-04-13 19:36:33,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 261 flow [2025-04-13 19:36:33,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:36:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:36:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2025-04-13 19:36:33,764 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7009803921568627 [2025-04-13 19:36:33,764 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 134 flow. Second operand 6 states and 143 transitions. [2025-04-13 19:36:33,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 261 flow [2025-04-13 19:36:33,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 251 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:33,765 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 114 flow [2025-04-13 19:36:33,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2025-04-13 19:36:33,766 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-04-13 19:36:33,766 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 114 flow [2025-04-13 19:36:33,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:33,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:33,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:33,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:36:33,767 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 19:36:33,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1393436295, now seen corresponding path program 1 times [2025-04-13 19:36:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:33,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835489134] [2025-04-13 19:36:33,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:33,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:36:33,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:36:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:33,843 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 19:36:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:33,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835489134] [2025-04-13 19:36:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835489134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644383650] [2025-04-13 19:36:33,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:33,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:33,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:33,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:33,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 34 [2025-04-13 19:36:33,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 30 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:33,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:33,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 34 [2025-04-13 19:36:33,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:33,948 INFO L116 PetriNetUnfolderBase]: 158/371 cut-off events. [2025-04-13 19:36:33,948 INFO L117 PetriNetUnfolderBase]: For 812/834 co-relation queries the response was YES. [2025-04-13 19:36:33,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 371 events. 158/371 cut-off events. For 812/834 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1981 event pairs, 66 based on Foata normal form. 18/362 useless extension candidates. Maximal degree in co-relation 994. Up to 114 conditions per place. [2025-04-13 19:36:33,951 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 19 selfloop transitions, 3 changer transitions 13/50 dead transitions. [2025-04-13 19:36:33,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 255 flow [2025-04-13 19:36:33,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:36:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:36:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-04-13 19:36:33,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7107843137254902 [2025-04-13 19:36:33,953 INFO L175 Difference]: Start difference. First operand has 55 places, 30 transitions, 114 flow. Second operand 6 states and 145 transitions. [2025-04-13 19:36:33,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 255 flow [2025-04-13 19:36:33,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 203 flow, removed 16 selfloop flow, removed 11 redundant places. [2025-04-13 19:36:33,957 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 100 flow [2025-04-13 19:36:33,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2025-04-13 19:36:33,957 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-04-13 19:36:33,957 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 100 flow [2025-04-13 19:36:33,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:33,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:33,957 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 19:36:33,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:36:33,958 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 19:36:33,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash -910054902, now seen corresponding path program 1 times [2025-04-13 19:36:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:33,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184527283] [2025-04-13 19:36:33,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:33,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:36:33,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:36:33,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:33,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:34,043 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 19:36:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:34,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184527283] [2025-04-13 19:36:34,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184527283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:34,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:34,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066472206] [2025-04-13 19:36:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:34,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:34,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:34,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:34,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:34,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:36:34,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 30 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 19:36:34,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:34,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:36:34,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:34,122 INFO L116 PetriNetUnfolderBase]: 311/537 cut-off events. [2025-04-13 19:36:34,122 INFO L117 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2025-04-13 19:36:34,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 537 events. 311/537 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2549 event pairs, 140 based on Foata normal form. 27/524 useless extension candidates. Maximal degree in co-relation 1221. Up to 290 conditions per place. [2025-04-13 19:36:34,124 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 23 selfloop transitions, 5 changer transitions 1/43 dead transitions. [2025-04-13 19:36:34,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 186 flow [2025-04-13 19:36:34,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:36:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:36:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-04-13 19:36:34,126 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7279411764705882 [2025-04-13 19:36:34,126 INFO L175 Difference]: Start difference. First operand has 50 places, 30 transitions, 100 flow. Second operand 4 states and 99 transitions. [2025-04-13 19:36:34,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 186 flow [2025-04-13 19:36:34,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 170 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-04-13 19:36:34,127 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 118 flow [2025-04-13 19:36:34,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-04-13 19:36:34,128 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-04-13 19:36:34,128 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 118 flow [2025-04-13 19:36:34,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 19:36:34,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:34,128 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 19:36:34,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:36:34,128 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 19:36:34,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1547742141, now seen corresponding path program 1 times [2025-04-13 19:36:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:34,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534055711] [2025-04-13 19:36:34,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:34,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:34,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:36:34,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:36:34,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:34,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:34,210 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 19:36:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:34,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534055711] [2025-04-13 19:36:34,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534055711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:34,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:34,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:34,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085345616] [2025-04-13 19:36:34,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:34,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:34,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:34,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:34,220 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:36:34,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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 19:36:34,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:34,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:36:34,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:34,296 INFO L116 PetriNetUnfolderBase]: 241/454 cut-off events. [2025-04-13 19:36:34,296 INFO L117 PetriNetUnfolderBase]: For 228/292 co-relation queries the response was YES. [2025-04-13 19:36:34,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 454 events. 241/454 cut-off events. For 228/292 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2047 event pairs, 23 based on Foata normal form. 30/463 useless extension candidates. Maximal degree in co-relation 1158. Up to 181 conditions per place. [2025-04-13 19:36:34,298 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 27 selfloop transitions, 8 changer transitions 1/50 dead transitions. [2025-04-13 19:36:34,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 241 flow [2025-04-13 19:36:34,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-04-13 19:36:34,299 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2025-04-13 19:36:34,299 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 118 flow. Second operand 5 states and 123 transitions. [2025-04-13 19:36:34,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 241 flow [2025-04-13 19:36:34,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 231 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:36:34,300 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 158 flow [2025-04-13 19:36:34,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-04-13 19:36:34,301 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-04-13 19:36:34,301 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 158 flow [2025-04-13 19:36:34,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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 19:36:34,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:34,301 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 19:36:34,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:36:34,301 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 19:36:34,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash -494062534, now seen corresponding path program 1 times [2025-04-13 19:36:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:34,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204364557] [2025-04-13 19:36:34,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:34,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:36:34,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:36:34,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:34,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:34,403 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 19:36:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:34,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204364557] [2025-04-13 19:36:34,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204364557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:34,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:34,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:36:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753993857] [2025-04-13 19:36:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:34,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:36:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:34,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:36:34,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:36:34,412 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:36:34,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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 19:36:34,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:34,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:36:34,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:34,496 INFO L116 PetriNetUnfolderBase]: 150/285 cut-off events. [2025-04-13 19:36:34,496 INFO L117 PetriNetUnfolderBase]: For 365/461 co-relation queries the response was YES. [2025-04-13 19:36:34,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 285 events. 150/285 cut-off events. For 365/461 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 963 event pairs, 6 based on Foata normal form. 28/299 useless extension candidates. Maximal degree in co-relation 808. Up to 84 conditions per place. [2025-04-13 19:36:34,498 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 25 selfloop transitions, 11 changer transitions 1/51 dead transitions. [2025-04-13 19:36:34,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 268 flow [2025-04-13 19:36:34,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:36:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:36:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2025-04-13 19:36:34,499 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2025-04-13 19:36:34,499 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 158 flow. Second operand 6 states and 141 transitions. [2025-04-13 19:36:34,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 268 flow [2025-04-13 19:36:34,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 229 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-04-13 19:36:34,501 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 158 flow [2025-04-13 19:36:34,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-04-13 19:36:34,502 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-04-13 19:36:34,502 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 158 flow [2025-04-13 19:36:34,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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 19:36:34,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:34,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:34,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:36:34,502 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 19:36:34,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1152763605, now seen corresponding path program 1 times [2025-04-13 19:36:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:34,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110412151] [2025-04-13 19:36:34,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:34,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 19:36:34,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:36:34,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:34,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:34,640 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 19:36:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:34,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110412151] [2025-04-13 19:36:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110412151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:34,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:34,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:34,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039357111] [2025-04-13 19:36:34,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:34,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:34,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:34,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:34,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 34 [2025-04-13 19:36:34,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:34,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:34,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 34 [2025-04-13 19:36:34,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:34,717 INFO L116 PetriNetUnfolderBase]: 104/248 cut-off events. [2025-04-13 19:36:34,717 INFO L117 PetriNetUnfolderBase]: For 198/202 co-relation queries the response was YES. [2025-04-13 19:36:34,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 248 events. 104/248 cut-off events. For 198/202 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 952 event pairs, 24 based on Foata normal form. 8/240 useless extension candidates. Maximal degree in co-relation 611. Up to 98 conditions per place. [2025-04-13 19:36:34,718 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 0 selfloop transitions, 0 changer transitions 44/44 dead transitions. [2025-04-13 19:36:34,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 226 flow [2025-04-13 19:36:34,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:36:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:36:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-04-13 19:36:34,719 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2025-04-13 19:36:34,719 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 158 flow. Second operand 6 states and 122 transitions. [2025-04-13 19:36:34,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 226 flow [2025-04-13 19:36:34,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 170 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-04-13 19:36:34,720 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2025-04-13 19:36:34,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2025-04-13 19:36:34,721 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-04-13 19:36:34,721 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2025-04-13 19:36:34,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:34,723 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 19:36:34,723 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 19:36:34,723 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:36:34,723 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 19:36:34,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:36:34,724 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:34,728 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:36:34,728 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:36:34,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:36:34 BasicIcfg [2025-04-13 19:36:34,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:36:34,731 INFO L158 Benchmark]: Toolchain (without parser) took 3504.03ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 85.6MB in the beginning and 49.7MB in the end (delta: 35.9MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. [2025-04-13 19:36:34,731 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:36:34,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.43ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 62.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:36:34,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.06ms. Allocated memory is still 125.8MB. Free memory was 62.1MB in the beginning and 60.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:36:34,732 INFO L158 Benchmark]: Boogie Preprocessor took 42.48ms. Allocated memory is still 125.8MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:36:34,732 INFO L158 Benchmark]: RCFGBuilder took 378.12ms. Allocated memory is still 125.8MB. Free memory was 58.0MB in the beginning and 36.2MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:36:34,732 INFO L158 Benchmark]: TraceAbstraction took 2609.69ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 35.4MB in the beginning and 49.7MB in the end (delta: -14.3MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2025-04-13 19:36:34,733 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.29ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 428.43ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 62.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.06ms. Allocated memory is still 125.8MB. Free memory was 62.1MB in the beginning and 60.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 42.48ms. Allocated memory is still 125.8MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 378.12ms. Allocated memory is still 125.8MB. Free memory was 58.0MB in the beginning and 36.2MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2609.69ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 35.4MB in the beginning and 49.7MB in the end (delta: -14.3MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 59 locations, 55 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: 2.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 26 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=7, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:36:34,744 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...