/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/mix042.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:05:34,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:05:34,475 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:05:34,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:05:34,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:05:34,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:05:34,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:05:34,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:05:34,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:05:34,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:05:34,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:05:34,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:05:34,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:05:34,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:05:34,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:05:34,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:05:34,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:05:34,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:05:34,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:05:34,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:05:34,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:05:34,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:05:34,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:05:34,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:05:34,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:05:34,497 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:05:34,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:05:34,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:05:34,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:05:34,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:05:34,962 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:05:34,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2025-04-14 00:05:36,311 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd78754c/47ca99df8bcb4c619b60bf85b6c1aeb5/FLAGd9dc67965 [2025-04-14 00:05:36,555 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:05:36,556 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2025-04-14 00:05:36,568 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd78754c/47ca99df8bcb4c619b60bf85b6c1aeb5/FLAGd9dc67965 [2025-04-14 00:05:37,363 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd78754c/47ca99df8bcb4c619b60bf85b6c1aeb5 [2025-04-14 00:05:37,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:05:37,366 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:05:37,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:05:37,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:05:37,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:05:37,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4242f479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37, skipping insertion in model container [2025-04-14 00:05:37,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:05:37,584 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/mix042.opt.i[944,957] [2025-04-14 00:05:37,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:05:37,800 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:05:37,821 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/mix042.opt.i[944,957] [2025-04-14 00:05:37,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:05:37,900 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:05:37,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37 WrapperNode [2025-04-14 00:05:37,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:05:37,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:05:37,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:05:37,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:05:37,908 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:05:37" (1/1) ... [2025-04-14 00:05:37,924 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:05:37" (1/1) ... [2025-04-14 00:05:37,946 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2025-04-14 00:05:37,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:05:37,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:05:37,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:05:37,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:05:37,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,981 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:05:37,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:05:37,994 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:05:37,994 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:05:37,994 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:05:37,995 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (1/1) ... [2025-04-14 00:05:37,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:05:38,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:05:38,020 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:05:38,030 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:05:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:05:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:05:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:05:38,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:05:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:05:38,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:05:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:05:38,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:05:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:05:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:05:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:05:38,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:05:38,048 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:05:38,139 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:05:38,141 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:05:38,372 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:05:38,372 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:05:38,372 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:05:38,611 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:05:38,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:05:38 BoogieIcfgContainer [2025-04-14 00:05:38,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:05:38,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:05:38,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:05:38,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:05:38,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:05:37" (1/3) ... [2025-04-14 00:05:38,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5c3baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:05:38, skipping insertion in model container [2025-04-14 00:05:38,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:05:37" (2/3) ... [2025-04-14 00:05:38,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5c3baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:05:38, skipping insertion in model container [2025-04-14 00:05:38,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:05:38" (3/3) ... [2025-04-14 00:05:38,621 INFO L128 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2025-04-14 00:05:38,634 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:05:38,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix042.opt.i that has 4 procedures, 38 locations, 34 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:05:38,636 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:05:38,680 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:05:38,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 86 flow [2025-04-14 00:05:38,732 INFO L116 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-04-14 00:05:38,734 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:05:38,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:05:38,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 37 transitions, 86 flow [2025-04-14 00:05:38,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2025-04-14 00:05:38,749 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:05:38,760 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;@1b3a83a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:05:38,760 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:05:38,769 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:05:38,769 INFO L116 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-04-14 00:05:38,769 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:05:38,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:38,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:05:38,770 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:05:38,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1626864716, now seen corresponding path program 1 times [2025-04-14 00:05:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:38,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071251613] [2025-04-14 00:05:38,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:05:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:38,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:05:38,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:05:38,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:05:38,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:05:39,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:05:39,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:05:39,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071251613] [2025-04-14 00:05:39,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071251613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:05:39,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:05:39,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:05:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854851471] [2025-04-14 00:05:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:05:39,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:05:39,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:05:39,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:05:39,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:05:39,240 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:05:39,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 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:05:39,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:05:39,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:05:39,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:05:40,210 INFO L116 PetriNetUnfolderBase]: 5699/8097 cut-off events. [2025-04-14 00:05:40,211 INFO L117 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-04-14 00:05:40,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16276 conditions, 8097 events. 5699/8097 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 41634 event pairs, 575 based on Foata normal form. 0/7804 useless extension candidates. Maximal degree in co-relation 16265. Up to 7141 conditions per place. [2025-04-14 00:05:40,270 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2025-04-14 00:05:40,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 203 flow [2025-04-14 00:05:40,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:05:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:05:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-14 00:05:40,282 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-04-14 00:05:40,284 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 66 transitions. [2025-04-14 00:05:40,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 203 flow [2025-04-14 00:05:40,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 200 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:05:40,291 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 74 flow [2025-04-14 00:05:40,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-04-14 00:05:40,296 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2025-04-14 00:05:40,296 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 74 flow [2025-04-14 00:05:40,297 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:05:40,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:40,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:05:40,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:05:40,297 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:05:40,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -869016575, now seen corresponding path program 1 times [2025-04-14 00:05:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:40,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854717435] [2025-04-14 00:05:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:05:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:40,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:05:40,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:05:40,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:05:40,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:05:40,964 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:05:40,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:05:40,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854717435] [2025-04-14 00:05:40,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854717435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:05:40,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:05:40,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:05:40,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234127420] [2025-04-14 00:05:40,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:05:40,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:05:40,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:05:40,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:05:40,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:05:40,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:05:40,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 74 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:05:40,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:05:40,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:05:40,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:05:41,671 INFO L116 PetriNetUnfolderBase]: 4943/7125 cut-off events. [2025-04-14 00:05:41,672 INFO L117 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2025-04-14 00:05:41,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14547 conditions, 7125 events. 4943/7125 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 36420 event pairs, 1571 based on Foata normal form. 288/7408 useless extension candidates. Maximal degree in co-relation 14537. Up to 4369 conditions per place. [2025-04-14 00:05:41,709 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 41 selfloop transitions, 2 changer transitions 28/74 dead transitions. [2025-04-14 00:05:41,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 302 flow [2025-04-14 00:05:41,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:05:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:05:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-14 00:05:41,711 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5567567567567567 [2025-04-14 00:05:41,711 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 74 flow. Second operand 5 states and 103 transitions. [2025-04-14 00:05:41,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 302 flow [2025-04-14 00:05:41,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:05:41,715 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 82 flow [2025-04-14 00:05:41,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2025-04-14 00:05:41,715 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-04-14 00:05:41,715 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 82 flow [2025-04-14 00:05:41,715 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:05:41,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:41,716 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:05:41,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:05:41,716 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:05:41,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash -497815590, now seen corresponding path program 1 times [2025-04-14 00:05:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:41,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984937789] [2025-04-14 00:05:41,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:05:41,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:41,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:05:41,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:05:41,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:05:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:05:42,341 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:05:42,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:05:42,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984937789] [2025-04-14 00:05:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984937789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:05:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:05:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:05:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109217298] [2025-04-14 00:05:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:05:42,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:05:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:05:42,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:05:42,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:05:42,343 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:05:42,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 82 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:05:42,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:05:42,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:05:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:05:42,954 INFO L116 PetriNetUnfolderBase]: 4543/6569 cut-off events. [2025-04-14 00:05:42,955 INFO L117 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-04-14 00:05:42,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14074 conditions, 6569 events. 4543/6569 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 32756 event pairs, 1209 based on Foata normal form. 180/6744 useless extension candidates. Maximal degree in co-relation 14061. Up to 5133 conditions per place. [2025-04-14 00:05:42,984 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 53 selfloop transitions, 5 changer transitions 24/85 dead transitions. [2025-04-14 00:05:42,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 359 flow [2025-04-14 00:05:42,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:05:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:05:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-04-14 00:05:42,986 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2025-04-14 00:05:42,986 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 82 flow. Second operand 6 states and 120 transitions. [2025-04-14 00:05:42,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 359 flow [2025-04-14 00:05:43,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 85 transitions, 349 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-14 00:05:43,010 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 112 flow [2025-04-14 00:05:43,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-04-14 00:05:43,011 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-04-14 00:05:43,012 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 112 flow [2025-04-14 00:05:43,012 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:05:43,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:43,012 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:05:43,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:05:43,012 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:05:43,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1070274113, now seen corresponding path program 1 times [2025-04-14 00:05:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:43,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975778001] [2025-04-14 00:05:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:05:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:43,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:05:43,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:05:43,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:05:43,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:05:43,163 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:05:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:05:43,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975778001] [2025-04-14 00:05:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975778001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:05:43,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:05:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:05:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517830181] [2025-04-14 00:05:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:05:43,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:05:43,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:05:43,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:05:43,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:05:43,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:05:43,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:05:43,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:05:43,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:05:43,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:05:43,583 INFO L116 PetriNetUnfolderBase]: 3739/5521 cut-off events. [2025-04-14 00:05:43,583 INFO L117 PetriNetUnfolderBase]: For 1111/1111 co-relation queries the response was YES. [2025-04-14 00:05:43,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12796 conditions, 5521 events. 3739/5521 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 28726 event pairs, 695 based on Foata normal form. 288/5804 useless extension candidates. Maximal degree in co-relation 12781. Up to 2717 conditions per place. [2025-04-14 00:05:43,609 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 72 selfloop transitions, 5 changer transitions 1/81 dead transitions. [2025-04-14 00:05:43,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 406 flow [2025-04-14 00:05:43,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:05:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:05:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-14 00:05:43,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2025-04-14 00:05:43,611 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 112 flow. Second operand 4 states and 92 transitions. [2025-04-14 00:05:43,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 406 flow [2025-04-14 00:05:43,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 404 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:05:43,617 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 144 flow [2025-04-14 00:05:43,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-04-14 00:05:43,618 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2025-04-14 00:05:43,618 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 144 flow [2025-04-14 00:05:43,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:05:43,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:43,619 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:05:43,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:05:43,619 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:05:43,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2000066112, now seen corresponding path program 1 times [2025-04-14 00:05:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:43,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285132301] [2025-04-14 00:05:43,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:05:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:43,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:05:43,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:05:43,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:05:43,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:05:43,820 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:05:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:05:43,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285132301] [2025-04-14 00:05:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285132301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:05:43,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:05:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:05:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866095818] [2025-04-14 00:05:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:05:43,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:05:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:05:43,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:05:43,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:05:43,822 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:05:43,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 144 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:05:43,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:05:43,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:05:43,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:05:44,191 INFO L116 PetriNetUnfolderBase]: 2259/3417 cut-off events. [2025-04-14 00:05:44,191 INFO L117 PetriNetUnfolderBase]: For 1367/1367 co-relation queries the response was YES. [2025-04-14 00:05:44,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8849 conditions, 3417 events. 2259/3417 cut-off events. For 1367/1367 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 16459 event pairs, 443 based on Foata normal form. 192/3604 useless extension candidates. Maximal degree in co-relation 8831. Up to 1272 conditions per place. [2025-04-14 00:05:44,207 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 85 selfloop transitions, 8 changer transitions 1/97 dead transitions. [2025-04-14 00:05:44,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 97 transitions, 509 flow [2025-04-14 00:05:44,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:05:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:05:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-04-14 00:05:44,211 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6378378378378379 [2025-04-14 00:05:44,212 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 144 flow. Second operand 5 states and 118 transitions. [2025-04-14 00:05:44,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 97 transitions, 509 flow [2025-04-14 00:05:44,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 97 transitions, 499 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:05:44,219 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 184 flow [2025-04-14 00:05:44,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-04-14 00:05:44,221 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2025-04-14 00:05:44,221 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 184 flow [2025-04-14 00:05:44,221 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:05:44,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:44,221 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:05:44,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:05:44,221 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:05:44,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1811669148, now seen corresponding path program 1 times [2025-04-14 00:05:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:44,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940674898] [2025-04-14 00:05:44,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:05:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:44,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:05:44,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:05:44,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:05:44,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:05:44,649 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:05:44,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:05:44,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940674898] [2025-04-14 00:05:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940674898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:05:44,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:05:44,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:05:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764285206] [2025-04-14 00:05:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:05:44,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:05:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:05:44,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:05:44,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:05:44,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:05:44,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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:05:44,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:05:44,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:05:44,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:05:45,280 INFO L116 PetriNetUnfolderBase]: 2707/4116 cut-off events. [2025-04-14 00:05:45,280 INFO L117 PetriNetUnfolderBase]: For 3183/3183 co-relation queries the response was YES. [2025-04-14 00:05:45,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11436 conditions, 4116 events. 2707/4116 cut-off events. For 3183/3183 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 20168 event pairs, 680 based on Foata normal form. 44/4158 useless extension candidates. Maximal degree in co-relation 11416. Up to 2445 conditions per place. [2025-04-14 00:05:45,304 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 80 selfloop transitions, 11 changer transitions 32/126 dead transitions. [2025-04-14 00:05:45,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 126 transitions, 775 flow [2025-04-14 00:05:45,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:05:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:05:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-04-14 00:05:45,306 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5482625482625483 [2025-04-14 00:05:45,306 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 184 flow. Second operand 7 states and 142 transitions. [2025-04-14 00:05:45,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 126 transitions, 775 flow [2025-04-14 00:05:45,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 718 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-14 00:05:45,315 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 249 flow [2025-04-14 00:05:45,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-04-14 00:05:45,316 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2025-04-14 00:05:45,316 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 249 flow [2025-04-14 00:05:45,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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:05:45,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:45,316 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:05:45,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:05:45,316 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:05:45,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 920000868, now seen corresponding path program 2 times [2025-04-14 00:05:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:45,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098822238] [2025-04-14 00:05:45,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:05:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:45,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:05:45,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:05:45,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:05:45,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:05:45,508 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:05:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:05:45,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098822238] [2025-04-14 00:05:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098822238] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:05:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:05:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:05:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151312874] [2025-04-14 00:05:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:05:45,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:05:45,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:05:45,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:05:45,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:05:45,510 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:05:45,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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:05:45,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:05:45,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:05:45,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:05:45,816 INFO L116 PetriNetUnfolderBase]: 2047/3129 cut-off events. [2025-04-14 00:05:45,817 INFO L117 PetriNetUnfolderBase]: For 2836/2836 co-relation queries the response was YES. [2025-04-14 00:05:45,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8939 conditions, 3129 events. 2047/3129 cut-off events. For 2836/2836 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15094 event pairs, 365 based on Foata normal form. 108/3232 useless extension candidates. Maximal degree in co-relation 8915. Up to 1172 conditions per place. [2025-04-14 00:05:45,831 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 64 selfloop transitions, 11 changer transitions 19/97 dead transitions. [2025-04-14 00:05:45,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 605 flow [2025-04-14 00:05:45,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:05:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:05:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-14 00:05:45,832 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-04-14 00:05:45,832 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 249 flow. Second operand 6 states and 114 transitions. [2025-04-14 00:05:45,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 605 flow [2025-04-14 00:05:45,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 587 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-14 00:05:45,836 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 223 flow [2025-04-14 00:05:45,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2025-04-14 00:05:45,837 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2025-04-14 00:05:45,837 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 223 flow [2025-04-14 00:05:45,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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:05:45,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:45,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:05:45,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:05:45,837 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:05:45,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:45,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2012430376, now seen corresponding path program 1 times [2025-04-14 00:05:45,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:45,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398354918] [2025-04-14 00:05:45,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:05:45,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:45,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:05:45,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:05:45,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:05:45,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:05:46,195 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:05:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:05:46,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398354918] [2025-04-14 00:05:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398354918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:05:46,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:05:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:05:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045044818] [2025-04-14 00:05:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:05:46,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:05:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:05:46,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:05:46,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:05:46,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:05:46,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:05:46,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:05:46,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:05:46,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:05:46,552 INFO L116 PetriNetUnfolderBase]: 1704/2650 cut-off events. [2025-04-14 00:05:46,553 INFO L117 PetriNetUnfolderBase]: For 3040/3040 co-relation queries the response was YES. [2025-04-14 00:05:46,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7842 conditions, 2650 events. 1704/2650 cut-off events. For 3040/3040 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12550 event pairs, 346 based on Foata normal form. 8/2657 useless extension candidates. Maximal degree in co-relation 7817. Up to 1386 conditions per place. [2025-04-14 00:05:46,562 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 44 selfloop transitions, 3 changer transitions 47/97 dead transitions. [2025-04-14 00:05:46,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 658 flow [2025-04-14 00:05:46,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:05:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:05:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2025-04-14 00:05:46,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4555984555984556 [2025-04-14 00:05:46,564 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 223 flow. Second operand 7 states and 118 transitions. [2025-04-14 00:05:46,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 658 flow [2025-04-14 00:05:46,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 525 flow, removed 24 selfloop flow, removed 9 redundant places. [2025-04-14 00:05:46,572 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 153 flow [2025-04-14 00:05:46,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2025-04-14 00:05:46,573 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2025-04-14 00:05:46,573 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 153 flow [2025-04-14 00:05:46,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:05:46,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:05:46,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:05:46,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:05:46,573 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:05:46,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:05:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1636306804, now seen corresponding path program 2 times [2025-04-14 00:05:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:05:46,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682630528] [2025-04-14 00:05:46,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:05:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:05:46,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:05:46,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:05:46,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:05:46,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:05:46,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:05:46,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:05:46,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:05:46,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:05:46,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:05:46,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:05:46,665 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:05:46,666 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:05:46,667 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:05:46,668 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 00:05:46,668 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-14 00:05:46,668 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-14 00:05:46,668 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:05:46,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:05:46,668 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-04-14 00:05:46,738 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:05:46,739 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:05:46,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:05:46 BasicIcfg [2025-04-14 00:05:46,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:05:46,743 INFO L158 Benchmark]: Toolchain (without parser) took 9376.76ms. Allocated memory was 125.8MB in the beginning and 725.6MB in the end (delta: 599.8MB). Free memory was 85.0MB in the beginning and 359.4MB in the end (delta: -274.4MB). Peak memory consumption was 326.3MB. Max. memory is 8.0GB. [2025-04-14 00:05:46,743 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:05:46,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.65ms. Allocated memory is still 125.8MB. Free memory was 85.0MB in the beginning and 58.7MB in the end (delta: 26.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:05:46,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.61ms. Allocated memory is still 125.8MB. Free memory was 58.7MB in the beginning and 55.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:05:46,743 INFO L158 Benchmark]: Boogie Preprocessor took 46.79ms. Allocated memory is still 125.8MB. Free memory was 55.7MB in the beginning and 53.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:05:46,744 INFO L158 Benchmark]: IcfgBuilder took 617.45ms. Allocated memory is still 125.8MB. Free memory was 52.7MB in the beginning and 49.4MB in the end (delta: 3.3MB). Peak memory consumption was 40.1MB. Max. memory is 8.0GB. [2025-04-14 00:05:46,744 INFO L158 Benchmark]: TraceAbstraction took 8128.02ms. Allocated memory was 125.8MB in the beginning and 725.6MB in the end (delta: 599.8MB). Free memory was 48.4MB in the beginning and 359.4MB in the end (delta: -311.0MB). Peak memory consumption was 286.2MB. Max. memory is 8.0GB. [2025-04-14 00:05:46,745 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.24ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 533.65ms. Allocated memory is still 125.8MB. Free memory was 85.0MB in the beginning and 58.7MB in the end (delta: 26.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.61ms. Allocated memory is still 125.8MB. Free memory was 58.7MB in the beginning and 55.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 46.79ms. Allocated memory is still 125.8MB. Free memory was 55.7MB in the beginning and 53.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 617.45ms. Allocated memory is still 125.8MB. Free memory was 52.7MB in the beginning and 49.4MB in the end (delta: 3.3MB). Peak memory consumption was 40.1MB. Max. memory is 8.0GB. * TraceAbstraction took 8128.02ms. Allocated memory was 125.8MB in the beginning and 725.6MB in the end (delta: 599.8MB). Free memory was 48.4MB in the beginning and 359.4MB in the end (delta: -311.0MB). Peak memory consumption was 286.2MB. 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; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1108=-2, 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] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1108=-2, t1109=-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] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1108=-2, t1109=-1, t1110=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] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 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, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L794] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L797] 3 __unbuffered_p2_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L800] 3 __unbuffered_p2_EBX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L747] 1 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L750] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L762] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=1] [L765] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=1, z=1] [L768] 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) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 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 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 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, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=1, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=1, z=1] [L803] 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) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 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 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L810] 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, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108=-2, t1109=-1, t1110=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=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 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) [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] 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 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 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, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108=-2, t1109=-1, t1110=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=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 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) [L848] 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)) [L849] 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)) [L850] 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)) [L851] 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)) [L852] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108=-2, t1109=-1, t1110=0, weak$$choice0=1, weak$$choice2=0, x=1, 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=1] [L858] 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, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, 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=1] - 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: 826]: 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: 828]: 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: 830]: 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, 65 locations, 61 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: 8.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 491 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1052 IncrementalHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 0 mSDtfsCounter, 1052 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=6, InterpolantAutomatonStates: 43, 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, 2.6s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:05:46,762 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...