/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:42,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:42,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:10:42,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:42,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:42,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:42,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:42,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:42,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:42,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:42,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:42,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:42,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:42,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:42,964 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:42,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:42,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:42,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:42,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:42,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:42,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:42,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:42,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:42,966 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:10:43,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:43,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:43,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:43,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:43,219 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:43,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2025-04-14 00:10:44,614 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d85e982/0abe9450ea5b4a4793bc9924abe54a73/FLAGf7d467f1a [2025-04-14 00:10:44,882 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:44,883 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2025-04-14 00:10:44,895 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d85e982/0abe9450ea5b4a4793bc9924abe54a73/FLAGf7d467f1a [2025-04-14 00:10:45,665 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d85e982/0abe9450ea5b4a4793bc9924abe54a73 [2025-04-14 00:10:45,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:10:45,669 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:10:45,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:45,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:10:45,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:10:45,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:45" (1/1) ... [2025-04-14 00:10:45,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc6cd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:45, skipping insertion in model container [2025-04-14 00:10:45,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:45" (1/1) ... [2025-04-14 00:10:45,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:10:45,916 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2025-04-14 00:10:46,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:46,154 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:10:46,179 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2025-04-14 00:10:46,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:46,256 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:10:46,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46 WrapperNode [2025-04-14 00:10:46,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:46,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:46,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:10:46,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:10:46,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,304 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-04-14 00:10:46,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:46,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:10:46,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:10:46,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:10:46,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,341 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-14 00:10:46,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,349 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:10:46,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:10:46,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:10:46,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:10:46,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (1/1) ... [2025-04-14 00:10:46,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:46,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:10:46,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:10:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:10:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:10:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:10:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:10:46,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:10:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:10:46,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:10:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:10:46,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:10:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:10:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:10:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:10:46,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:10:46,413 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:10:46,546 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:10:46,549 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:10:46,794 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:10:46,795 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:10:46,795 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:10:47,029 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:10:47,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:47 BoogieIcfgContainer [2025-04-14 00:10:47,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:10:47,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:10:47,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:10:47,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:10:47,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:10:45" (1/3) ... [2025-04-14 00:10:47,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d8a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:47, skipping insertion in model container [2025-04-14 00:10:47,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:46" (2/3) ... [2025-04-14 00:10:47,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d8a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:47, skipping insertion in model container [2025-04-14 00:10:47,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:47" (3/3) ... [2025-04-14 00:10:47,036 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2025-04-14 00:10:47,047 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:10:47,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 36 locations, 32 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:10:47,048 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:10:47,085 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:10:47,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 82 flow [2025-04-14 00:10:47,133 INFO L116 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-04-14 00:10:47,134 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:47,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 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-14 00:10:47,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 35 transitions, 82 flow [2025-04-14 00:10:47,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-04-14 00:10:47,150 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:10:47,158 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;@227bb87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:10:47,158 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:10:47,167 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:10:47,167 INFO L116 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-04-14 00:10:47,167 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:47,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:47,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:47,168 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:47,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1146329980, now seen corresponding path program 1 times [2025-04-14 00:10:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:47,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268123467] [2025-04-14 00:10:47,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:47,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:10:47,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:10:47,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:47,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:47,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268123467] [2025-04-14 00:10:47,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268123467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:47,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:10:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570644311] [2025-04-14 00:10:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:47,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:10:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:47,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:10:47,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:10:47,583 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:47,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:47,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:47,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:47,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:48,400 INFO L116 PetriNetUnfolderBase]: 4235/6059 cut-off events. [2025-04-14 00:10:48,400 INFO L117 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-04-14 00:10:48,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12198 conditions, 6059 events. 4235/6059 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 30326 event pairs, 575 based on Foata normal form. 0/5828 useless extension candidates. Maximal degree in co-relation 12187. Up to 5101 conditions per place. [2025-04-14 00:10:48,448 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2025-04-14 00:10:48,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 195 flow [2025-04-14 00:10:48,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:10:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:10:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-04-14 00:10:48,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-04-14 00:10:48,462 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 64 transitions. [2025-04-14 00:10:48,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 195 flow [2025-04-14 00:10:48,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:48,469 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 70 flow [2025-04-14 00:10:48,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2025-04-14 00:10:48,474 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-04-14 00:10:48,474 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 70 flow [2025-04-14 00:10:48,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:48,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:48,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:48,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:10:48,475 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:48,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1101710811, now seen corresponding path program 1 times [2025-04-14 00:10:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:48,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289232903] [2025-04-14 00:10:48,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:48,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:10:48,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:10:48,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:48,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:49,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289232903] [2025-04-14 00:10:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289232903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:49,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:49,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195845249] [2025-04-14 00:10:49,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:49,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:49,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:49,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:49,326 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:49,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:49,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:49,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:49,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:50,532 INFO L116 PetriNetUnfolderBase]: 6541/9527 cut-off events. [2025-04-14 00:10:50,533 INFO L117 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-04-14 00:10:50,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19627 conditions, 9527 events. 6541/9527 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 54208 event pairs, 488 based on Foata normal form. 362/9887 useless extension candidates. Maximal degree in co-relation 19617. Up to 5324 conditions per place. [2025-04-14 00:10:50,581 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 54 selfloop transitions, 11 changer transitions 40/108 dead transitions. [2025-04-14 00:10:50,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 108 transitions, 452 flow [2025-04-14 00:10:50,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:10:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:10:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2025-04-14 00:10:50,583 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-04-14 00:10:50,583 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 70 flow. Second operand 7 states and 150 transitions. [2025-04-14 00:10:50,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 108 transitions, 452 flow [2025-04-14 00:10:50,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 108 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:50,590 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 166 flow [2025-04-14 00:10:50,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-04-14 00:10:50,591 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2025-04-14 00:10:50,591 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 166 flow [2025-04-14 00:10:50,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:50,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:50,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:50,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:10:50,591 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:50,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2112299748, now seen corresponding path program 1 times [2025-04-14 00:10:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:50,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031366844] [2025-04-14 00:10:50,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:50,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:10:50,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:10:50,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:50,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:50,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031366844] [2025-04-14 00:10:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031366844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:10:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463422382] [2025-04-14 00:10:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:50,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:50,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:50,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:50,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:50,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:50,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:50,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:50,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:51,823 INFO L116 PetriNetUnfolderBase]: 6190/9075 cut-off events. [2025-04-14 00:10:51,823 INFO L117 PetriNetUnfolderBase]: For 8578/8578 co-relation queries the response was YES. [2025-04-14 00:10:51,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25669 conditions, 9075 events. 6190/9075 cut-off events. For 8578/8578 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 49831 event pairs, 2316 based on Foata normal form. 292/9364 useless extension candidates. Maximal degree in co-relation 25653. Up to 8200 conditions per place. [2025-04-14 00:10:51,887 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 50 selfloop transitions, 4 changer transitions 28/85 dead transitions. [2025-04-14 00:10:51,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 516 flow [2025-04-14 00:10:51,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-04-14 00:10:51,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5542857142857143 [2025-04-14 00:10:51,888 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 166 flow. Second operand 5 states and 97 transitions. [2025-04-14 00:10:51,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 516 flow [2025-04-14 00:10:51,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 514 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:10:51,902 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 210 flow [2025-04-14 00:10:51,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2025-04-14 00:10:51,903 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2025-04-14 00:10:51,903 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 210 flow [2025-04-14 00:10:51,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:51,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:51,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:51,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:10:51,904 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:51,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -861141118, now seen corresponding path program 1 times [2025-04-14 00:10:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:51,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641989018] [2025-04-14 00:10:51,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:51,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:10:51,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:10:51,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:51,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:52,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:52,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641989018] [2025-04-14 00:10:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641989018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:52,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304888505] [2025-04-14 00:10:52,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:52,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:52,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:52,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:52,465 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:52,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:52,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:52,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:52,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:53,632 INFO L116 PetriNetUnfolderBase]: 8086/11844 cut-off events. [2025-04-14 00:10:53,632 INFO L117 PetriNetUnfolderBase]: For 15172/15172 co-relation queries the response was YES. [2025-04-14 00:10:53,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35182 conditions, 11844 events. 8086/11844 cut-off events. For 15172/15172 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 69091 event pairs, 1837 based on Foata normal form. 308/12151 useless extension candidates. Maximal degree in co-relation 35162. Up to 5826 conditions per place. [2025-04-14 00:10:53,705 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 65 selfloop transitions, 21 changer transitions 37/126 dead transitions. [2025-04-14 00:10:53,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 126 transitions, 787 flow [2025-04-14 00:10:53,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:10:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:10:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-04-14 00:10:53,707 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6081632653061224 [2025-04-14 00:10:53,707 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 210 flow. Second operand 7 states and 149 transitions. [2025-04-14 00:10:53,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 126 transitions, 787 flow [2025-04-14 00:10:53,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 126 transitions, 774 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:53,722 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 404 flow [2025-04-14 00:10:53,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-04-14 00:10:53,722 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2025-04-14 00:10:53,722 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 404 flow [2025-04-14 00:10:53,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:53,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:53,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:53,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:10:53,723 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:53,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash -921455591, now seen corresponding path program 1 times [2025-04-14 00:10:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:53,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889838590] [2025-04-14 00:10:53,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:53,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:10:53,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:10:53,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:53,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:54,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889838590] [2025-04-14 00:10:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889838590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:54,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:54,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:10:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917280618] [2025-04-14 00:10:54,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:54,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:54,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:54,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:54,202 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:54,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:54,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:54,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:54,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:55,288 INFO L116 PetriNetUnfolderBase]: 7985/11804 cut-off events. [2025-04-14 00:10:55,288 INFO L117 PetriNetUnfolderBase]: For 35301/35303 co-relation queries the response was YES. [2025-04-14 00:10:55,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40510 conditions, 11804 events. 7985/11804 cut-off events. For 35301/35303 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 67501 event pairs, 2694 based on Foata normal form. 389/12186 useless extension candidates. Maximal degree in co-relation 40484. Up to 10598 conditions per place. [2025-04-14 00:10:55,371 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 67 selfloop transitions, 5 changer transitions 30/105 dead transitions. [2025-04-14 00:10:55,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 912 flow [2025-04-14 00:10:55,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-04-14 00:10:55,372 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2025-04-14 00:10:55,372 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 404 flow. Second operand 5 states and 93 transitions. [2025-04-14 00:10:55,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 912 flow [2025-04-14 00:10:55,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 904 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:55,446 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 447 flow [2025-04-14 00:10:55,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-04-14 00:10:55,447 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2025-04-14 00:10:55,447 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 447 flow [2025-04-14 00:10:55,448 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:55,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:55,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:55,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:10:55,448 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:55,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1793233655, now seen corresponding path program 1 times [2025-04-14 00:10:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:55,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022897474] [2025-04-14 00:10:55,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:55,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:10:55,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:10:55,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:55,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:55,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022897474] [2025-04-14 00:10:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022897474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960470512] [2025-04-14 00:10:55,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:55,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:55,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:55,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:55,686 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:55,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 447 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:55,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:55,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:55,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:56,551 INFO L116 PetriNetUnfolderBase]: 7899/11662 cut-off events. [2025-04-14 00:10:56,551 INFO L117 PetriNetUnfolderBase]: For 34798/34806 co-relation queries the response was YES. [2025-04-14 00:10:56,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42321 conditions, 11662 events. 7899/11662 cut-off events. For 34798/34806 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 66354 event pairs, 1185 based on Foata normal form. 323/11978 useless extension candidates. Maximal degree in co-relation 42292. Up to 9454 conditions per place. [2025-04-14 00:10:56,644 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 79 selfloop transitions, 10 changer transitions 33/125 dead transitions. [2025-04-14 00:10:56,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 125 transitions, 1119 flow [2025-04-14 00:10:56,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:10:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:10:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-14 00:10:56,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-04-14 00:10:56,646 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 447 flow. Second operand 6 states and 114 transitions. [2025-04-14 00:10:56,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 125 transitions, 1119 flow [2025-04-14 00:10:56,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 125 transitions, 1110 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:56,673 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 502 flow [2025-04-14 00:10:56,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-04-14 00:10:56,673 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2025-04-14 00:10:56,674 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 502 flow [2025-04-14 00:10:56,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:56,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:56,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:56,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:10:56,674 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:56,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1793666105, now seen corresponding path program 2 times [2025-04-14 00:10:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:56,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69378517] [2025-04-14 00:10:56,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:10:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:56,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:10:56,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:10:56,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:10:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:56,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69378517] [2025-04-14 00:10:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69378517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:56,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:56,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568566973] [2025-04-14 00:10:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:56,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:10:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:56,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:10:56,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:10:56,986 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:56,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:56,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:56,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:56,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:57,857 INFO L116 PetriNetUnfolderBase]: 7475/11058 cut-off events. [2025-04-14 00:10:57,857 INFO L117 PetriNetUnfolderBase]: For 41962/41976 co-relation queries the response was YES. [2025-04-14 00:10:57,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41545 conditions, 11058 events. 7475/11058 cut-off events. For 41962/41976 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 62034 event pairs, 1378 based on Foata normal form. 327/11378 useless extension candidates. Maximal degree in co-relation 41513. Up to 9260 conditions per place. [2025-04-14 00:10:57,932 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 75 selfloop transitions, 9 changer transitions 33/120 dead transitions. [2025-04-14 00:10:57,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 120 transitions, 1108 flow [2025-04-14 00:10:57,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:10:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:10:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-04-14 00:10:57,933 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-14 00:10:57,933 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 502 flow. Second operand 6 states and 112 transitions. [2025-04-14 00:10:57,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 120 transitions, 1108 flow [2025-04-14 00:10:57,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 120 transitions, 1083 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:57,971 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 506 flow [2025-04-14 00:10:57,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2025-04-14 00:10:57,972 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2025-04-14 00:10:57,972 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 506 flow [2025-04-14 00:10:57,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:57,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:57,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:57,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:10:57,972 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:57,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1475583819, now seen corresponding path program 1 times [2025-04-14 00:10:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:57,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583056098] [2025-04-14 00:10:57,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:57,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:10:57,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:10:57,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:57,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:58,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583056098] [2025-04-14 00:10:58,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583056098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:58,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:58,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:58,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973129438] [2025-04-14 00:10:58,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:58,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:58,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:58,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:58,083 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:58,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:58,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:58,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:58,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:59,497 INFO L116 PetriNetUnfolderBase]: 11458/17038 cut-off events. [2025-04-14 00:10:59,498 INFO L117 PetriNetUnfolderBase]: For 62472/62486 co-relation queries the response was YES. [2025-04-14 00:10:59,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60752 conditions, 17038 events. 11458/17038 cut-off events. For 62472/62486 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 104985 event pairs, 4206 based on Foata normal form. 446/17477 useless extension candidates. Maximal degree in co-relation 60718. Up to 8609 conditions per place. [2025-04-14 00:10:59,609 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 68 selfloop transitions, 8 changer transitions 34/113 dead transitions. [2025-04-14 00:10:59,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 113 transitions, 1052 flow [2025-04-14 00:10:59,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-14 00:10:59,610 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2025-04-14 00:10:59,610 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 506 flow. Second operand 5 states and 101 transitions. [2025-04-14 00:10:59,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 113 transitions, 1052 flow [2025-04-14 00:10:59,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 113 transitions, 1020 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-04-14 00:10:59,671 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 488 flow [2025-04-14 00:10:59,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=488, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-04-14 00:10:59,672 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2025-04-14 00:10:59,672 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 488 flow [2025-04-14 00:10:59,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:59,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:59,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:59,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:10:59,672 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:59,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1308147487, now seen corresponding path program 1 times [2025-04-14 00:10:59,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:59,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686099707] [2025-04-14 00:10:59,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:59,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:10:59,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:10:59,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:59,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:00,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:00,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686099707] [2025-04-14 00:11:00,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686099707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:00,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:00,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690029416] [2025-04-14 00:11:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:00,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:00,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:00,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:00,271 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:11:00,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:00,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:00,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:11:00,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:01,520 INFO L116 PetriNetUnfolderBase]: 10986/16453 cut-off events. [2025-04-14 00:11:01,520 INFO L117 PetriNetUnfolderBase]: For 67045/67059 co-relation queries the response was YES. [2025-04-14 00:11:01,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57968 conditions, 16453 events. 10986/16453 cut-off events. For 67045/67059 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 100921 event pairs, 4204 based on Foata normal form. 584/17030 useless extension candidates. Maximal degree in co-relation 57934. Up to 14040 conditions per place. [2025-04-14 00:11:01,635 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 83 selfloop transitions, 10 changer transitions 37/133 dead transitions. [2025-04-14 00:11:01,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 133 transitions, 1329 flow [2025-04-14 00:11:01,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-04-14 00:11:01,636 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-14 00:11:01,636 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 488 flow. Second operand 6 states and 112 transitions. [2025-04-14 00:11:01,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 133 transitions, 1329 flow [2025-04-14 00:11:01,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 1300 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-14 00:11:01,707 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 556 flow [2025-04-14 00:11:01,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=556, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2025-04-14 00:11:01,707 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2025-04-14 00:11:01,707 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 556 flow [2025-04-14 00:11:01,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:01,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:01,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:01,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:11:01,708 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:01,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1714870111, now seen corresponding path program 1 times [2025-04-14 00:11:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:01,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585723517] [2025-04-14 00:11:01,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:01,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:01,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:01,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:01,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:02,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:02,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585723517] [2025-04-14 00:11:02,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585723517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:02,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:02,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:02,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676168295] [2025-04-14 00:11:02,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:02,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:11:02,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:02,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:11:02,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:11:02,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:11:02,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 556 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:02,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:02,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:11:02,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:03,556 INFO L116 PetriNetUnfolderBase]: 11074/16501 cut-off events. [2025-04-14 00:11:03,556 INFO L117 PetriNetUnfolderBase]: For 72592/72606 co-relation queries the response was YES. [2025-04-14 00:11:03,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62665 conditions, 16501 events. 11074/16501 cut-off events. For 72592/72606 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 99715 event pairs, 3464 based on Foata normal form. 415/16909 useless extension candidates. Maximal degree in co-relation 62629. Up to 14265 conditions per place. [2025-04-14 00:11:03,657 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 86 selfloop transitions, 15 changer transitions 30/134 dead transitions. [2025-04-14 00:11:03,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 134 transitions, 1354 flow [2025-04-14 00:11:03,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-04-14 00:11:03,659 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-04-14 00:11:03,659 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 556 flow. Second operand 6 states and 115 transitions. [2025-04-14 00:11:03,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 134 transitions, 1354 flow [2025-04-14 00:11:03,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 134 transitions, 1334 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-14 00:11:03,756 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 657 flow [2025-04-14 00:11:03,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=657, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2025-04-14 00:11:03,757 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2025-04-14 00:11:03,757 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 657 flow [2025-04-14 00:11:03,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:03,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:03,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:03,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:11:03,758 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:03,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1449545975, now seen corresponding path program 2 times [2025-04-14 00:11:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:03,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492452635] [2025-04-14 00:11:03,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:03,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:03,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:03,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:03,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:03,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:03,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492452635] [2025-04-14 00:11:03,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492452635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:03,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:03,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299337283] [2025-04-14 00:11:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:03,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:11:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:03,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:11:03,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:11:03,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:11:03,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 657 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:03,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:03,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:11:03,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:04,887 INFO L116 PetriNetUnfolderBase]: 9207/14018 cut-off events. [2025-04-14 00:11:04,888 INFO L117 PetriNetUnfolderBase]: For 60827/60841 co-relation queries the response was YES. [2025-04-14 00:11:04,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52781 conditions, 14018 events. 9207/14018 cut-off events. For 60827/60841 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 88150 event pairs, 1469 based on Foata normal form. 767/14779 useless extension candidates. Maximal degree in co-relation 52744. Up to 7356 conditions per place. [2025-04-14 00:11:04,961 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 118 selfloop transitions, 5 changer transitions 24/150 dead transitions. [2025-04-14 00:11:04,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 150 transitions, 1761 flow [2025-04-14 00:11:04,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:11:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:11:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-14 00:11:04,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-04-14 00:11:04,963 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 657 flow. Second operand 4 states and 86 transitions. [2025-04-14 00:11:04,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 150 transitions, 1761 flow [2025-04-14 00:11:05,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 150 transitions, 1676 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-04-14 00:11:05,030 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 616 flow [2025-04-14 00:11:05,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=616, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-04-14 00:11:05,034 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2025-04-14 00:11:05,034 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 616 flow [2025-04-14 00:11:05,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:05,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:05,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:05,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:11:05,034 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:05,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1466870570, now seen corresponding path program 1 times [2025-04-14 00:11:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:05,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877151226] [2025-04-14 00:11:05,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:05,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:05,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:11:05,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:11:05,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:05,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:05,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877151226] [2025-04-14 00:11:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877151226] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:05,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197400451] [2025-04-14 00:11:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:05,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:05,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:05,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:05,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:11:05,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 616 flow. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:05,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:05,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:11:05,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:07,211 INFO L116 PetriNetUnfolderBase]: 8852/13468 cut-off events. [2025-04-14 00:11:07,211 INFO L117 PetriNetUnfolderBase]: For 55748/55762 co-relation queries the response was YES. [2025-04-14 00:11:07,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54910 conditions, 13468 events. 8852/13468 cut-off events. For 55748/55762 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 82532 event pairs, 2864 based on Foata normal form. 256/13717 useless extension candidates. Maximal degree in co-relation 54873. Up to 10275 conditions per place. [2025-04-14 00:11:07,317 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 94 selfloop transitions, 19 changer transitions 41/157 dead transitions. [2025-04-14 00:11:07,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 157 transitions, 1639 flow [2025-04-14 00:11:07,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-04-14 00:11:07,319 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-04-14 00:11:07,319 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 616 flow. Second operand 7 states and 134 transitions. [2025-04-14 00:11:07,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 157 transitions, 1639 flow [2025-04-14 00:11:07,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 157 transitions, 1614 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:07,402 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 727 flow [2025-04-14 00:11:07,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=727, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2025-04-14 00:11:07,402 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2025-04-14 00:11:07,402 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 727 flow [2025-04-14 00:11:07,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:07,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:07,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:07,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:11:07,403 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:07,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash 504605730, now seen corresponding path program 2 times [2025-04-14 00:11:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:07,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458227440] [2025-04-14 00:11:07,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:07,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:11:07,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:11:07,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:07,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:08,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458227440] [2025-04-14 00:11:08,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458227440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:08,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422467110] [2025-04-14 00:11:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:08,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:08,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:08,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:08,086 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:11:08,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 727 flow. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:08,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:08,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:11:08,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:09,317 INFO L116 PetriNetUnfolderBase]: 9326/14230 cut-off events. [2025-04-14 00:11:09,318 INFO L117 PetriNetUnfolderBase]: For 81014/81028 co-relation queries the response was YES. [2025-04-14 00:11:09,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60049 conditions, 14230 events. 9326/14230 cut-off events. For 81014/81028 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 88450 event pairs, 3824 based on Foata normal form. 196/14419 useless extension candidates. Maximal degree in co-relation 60009. Up to 11790 conditions per place. [2025-04-14 00:11:09,424 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 90 selfloop transitions, 13 changer transitions 43/149 dead transitions. [2025-04-14 00:11:09,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 149 transitions, 1634 flow [2025-04-14 00:11:09,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2025-04-14 00:11:09,425 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-04-14 00:11:09,425 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 727 flow. Second operand 7 states and 129 transitions. [2025-04-14 00:11:09,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 149 transitions, 1634 flow [2025-04-14 00:11:09,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 149 transitions, 1603 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-14 00:11:09,564 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 782 flow [2025-04-14 00:11:09,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=782, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2025-04-14 00:11:09,564 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2025-04-14 00:11:09,564 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 782 flow [2025-04-14 00:11:09,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:09,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:09,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:09,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:11:09,565 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:09,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash 964063006, now seen corresponding path program 3 times [2025-04-14 00:11:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:09,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169135999] [2025-04-14 00:11:09,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:09,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:11:09,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:11:09,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:10,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169135999] [2025-04-14 00:11:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169135999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:10,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:10,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24728456] [2025-04-14 00:11:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:10,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:10,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:10,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:10,048 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:11:10,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 782 flow. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:10,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:10,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:11:10,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:11,852 INFO L116 PetriNetUnfolderBase]: 12115/18593 cut-off events. [2025-04-14 00:11:11,852 INFO L117 PetriNetUnfolderBase]: For 106402/106416 co-relation queries the response was YES. [2025-04-14 00:11:11,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74469 conditions, 18593 events. 12115/18593 cut-off events. For 106402/106416 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 123160 event pairs, 3535 based on Foata normal form. 348/18934 useless extension candidates. Maximal degree in co-relation 74427. Up to 9946 conditions per place. [2025-04-14 00:11:12,031 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 90 selfloop transitions, 11 changer transitions 46/150 dead transitions. [2025-04-14 00:11:12,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 150 transitions, 1755 flow [2025-04-14 00:11:12,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2025-04-14 00:11:12,032 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2025-04-14 00:11:12,032 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 782 flow. Second operand 7 states and 122 transitions. [2025-04-14 00:11:12,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 150 transitions, 1755 flow [2025-04-14 00:11:12,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 150 transitions, 1698 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-04-14 00:11:12,195 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 769 flow [2025-04-14 00:11:12,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=769, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2025-04-14 00:11:12,196 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2025-04-14 00:11:12,196 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 769 flow [2025-04-14 00:11:12,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:12,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:12,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:12,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:11:12,196 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:12,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash 927059073, now seen corresponding path program 1 times [2025-04-14 00:11:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:12,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200526347] [2025-04-14 00:11:12,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:12,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:11:12,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:11:12,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:12,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:12,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200526347] [2025-04-14 00:11:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200526347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515070309] [2025-04-14 00:11:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:12,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:12,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:12,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:12,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:11:12,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 769 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:12,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:12,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:11:12,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:13,305 INFO L116 PetriNetUnfolderBase]: 7972/12696 cut-off events. [2025-04-14 00:11:13,305 INFO L117 PetriNetUnfolderBase]: For 54796/54810 co-relation queries the response was YES. [2025-04-14 00:11:13,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45848 conditions, 12696 events. 7972/12696 cut-off events. For 54796/54810 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 84573 event pairs, 782 based on Foata normal form. 914/13606 useless extension candidates. Maximal degree in co-relation 45805. Up to 4113 conditions per place. [2025-04-14 00:11:13,398 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 100 selfloop transitions, 8 changer transitions 44/155 dead transitions. [2025-04-14 00:11:13,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 155 transitions, 2009 flow [2025-04-14 00:11:13,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-14 00:11:13,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-04-14 00:11:13,400 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 769 flow. Second operand 5 states and 110 transitions. [2025-04-14 00:11:13,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 155 transitions, 2009 flow [2025-04-14 00:11:13,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 155 transitions, 1818 flow, removed 61 selfloop flow, removed 8 redundant places. [2025-04-14 00:11:13,455 INFO L231 Difference]: Finished difference. Result has 82 places, 66 transitions, 632 flow [2025-04-14 00:11:13,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=632, PETRI_PLACES=82, PETRI_TRANSITIONS=66} [2025-04-14 00:11:13,456 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2025-04-14 00:11:13,456 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 632 flow [2025-04-14 00:11:13,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:13,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:13,456 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-14 00:11:13,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:11:13,456 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:13,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1980224500, now seen corresponding path program 1 times [2025-04-14 00:11:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:13,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648790944] [2025-04-14 00:11:13,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:13,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:11:13,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:11:13,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:13,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:13,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648790944] [2025-04-14 00:11:13,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648790944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:13,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:13,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384640908] [2025-04-14 00:11:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:13,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:13,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:13,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:13,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:13,576 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:11:13,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:13,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:13,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:11:13,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:13,954 INFO L116 PetriNetUnfolderBase]: 2122/3431 cut-off events. [2025-04-14 00:11:13,954 INFO L117 PetriNetUnfolderBase]: For 12170/12176 co-relation queries the response was YES. [2025-04-14 00:11:13,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12851 conditions, 3431 events. 2122/3431 cut-off events. For 12170/12176 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18532 event pairs, 220 based on Foata normal form. 193/3622 useless extension candidates. Maximal degree in co-relation 12826. Up to 1280 conditions per place. [2025-04-14 00:11:13,973 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 11 changer transitions 52/112 dead transitions. [2025-04-14 00:11:13,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 112 transitions, 1231 flow [2025-04-14 00:11:13,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2025-04-14 00:11:13,975 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-04-14 00:11:13,975 INFO L175 Difference]: Start difference. First operand has 82 places, 66 transitions, 632 flow. Second operand 6 states and 102 transitions. [2025-04-14 00:11:13,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 112 transitions, 1231 flow [2025-04-14 00:11:13,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 1075 flow, removed 42 selfloop flow, removed 11 redundant places. [2025-04-14 00:11:13,994 INFO L231 Difference]: Finished difference. Result has 78 places, 38 transitions, 252 flow [2025-04-14 00:11:13,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=78, PETRI_TRANSITIONS=38} [2025-04-14 00:11:13,994 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2025-04-14 00:11:13,995 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 38 transitions, 252 flow [2025-04-14 00:11:13,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:13,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:13,995 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-14 00:11:13,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:11:13,995 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:13,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1051870031, now seen corresponding path program 1 times [2025-04-14 00:11:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:13,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267783366] [2025-04-14 00:11:13,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:14,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:11:14,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:11:14,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:14,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:14,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:11:14,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:11:14,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:11:14,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:14,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:14,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:11:14,122 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:11:14,123 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:11:14,124 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:11:14,124 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 00:11:14,124 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-14 00:11:14,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-14 00:11:14,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:11:14,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:11:14,125 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:14,209 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:11:14,209 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:11:14,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:11:14 BasicIcfg [2025-04-14 00:11:14,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:11:14,214 INFO L158 Benchmark]: Toolchain (without parser) took 28545.05ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 98.9MB in the beginning and 950.8MB in the end (delta: -851.9MB). Peak memory consumption was 926.7MB. Max. memory is 8.0GB. [2025-04-14 00:11:14,214 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:14,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.96ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 72.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:14,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.68ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 69.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:14,214 INFO L158 Benchmark]: Boogie Preprocessor took 53.76ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 66.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:14,214 INFO L158 Benchmark]: IcfgBuilder took 667.12ms. Allocated memory is still 142.6MB. Free memory was 66.9MB in the beginning and 75.2MB in the end (delta: -8.3MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB. [2025-04-14 00:11:14,215 INFO L158 Benchmark]: TraceAbstraction took 27182.28ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 74.4MB in the beginning and 950.8MB in the end (delta: -876.3MB). Peak memory consumption was 903.0MB. Max. memory is 8.0GB. [2025-04-14 00:11:14,216 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.18ms. Allocated memory is still 155.2MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 586.96ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 72.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.68ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 69.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.76ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 66.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 667.12ms. Allocated memory is still 142.6MB. Free memory was 66.9MB in the beginning and 75.2MB in the end (delta: -8.3MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB. * TraceAbstraction took 27182.28ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 74.4MB in the beginning and 950.8MB in the end (delta: -876.3MB). Peak memory consumption was 903.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-1, t2493=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-1, t2493=0, t2494=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-1, t2493=0, t2494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-1, t2493=0, t2494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-1, t2493=0, t2494=1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 61 locations, 57 edges, 6 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: 27.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 780 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 780 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2734 IncrementalHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 0 mSDtfsCounter, 2734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=782occurred in iteration=13, InterpolantAutomatonStates: 92, 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.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 2132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 00:11:14,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...