/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-lit/qw2004-2b.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:37:51,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:37:51,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:37:52,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:37:52,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:37:52,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:37:52,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:37:52,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:37:52,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:37:52,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:37:52,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:37:52,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:37:52,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:37:52,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:37:52,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:37:52,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:52,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:52,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:37:52,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:37:52,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:37:52,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:37:52,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:37:52,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:37:52,271 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:37:52,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/qw2004-2b.i [2025-04-13 19:37:53,591 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66896aa1a/15747889791e4330a809e417536d669c/FLAGa519cb211 [2025-04-13 19:37:53,842 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:37:53,842 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/qw2004-2b.i [2025-04-13 19:37:53,856 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66896aa1a/15747889791e4330a809e417536d669c/FLAGa519cb211 [2025-04-13 19:37:54,592 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66896aa1a/15747889791e4330a809e417536d669c [2025-04-13 19:37:54,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:37:54,595 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:37:54,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:54,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:37:54,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:37:54,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db589ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54, skipping insertion in model container [2025-04-13 19:37:54,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:37:54,926 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-lit/qw2004-2b.i[30003,30016] [2025-04-13 19:37:54,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:54,953 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:37:54,996 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-lit/qw2004-2b.i[30003,30016] [2025-04-13 19:37:55,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:55,036 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:37:55,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55 WrapperNode [2025-04-13 19:37:55,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:55,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:55,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:37:55,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:37:55,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,070 INFO L138 Inliner]: procedures = 174, calls = 32, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 114 [2025-04-13 19:37:55,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:55,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:37:55,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:37:55,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:37:55,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,091 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:37:55,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:37:55,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:37:55,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:37:55,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:37:55,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (1/1) ... [2025-04-13 19:37:55,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:55,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:37:55,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:37:55,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:37:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-04-13 19:37:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-04-13 19:37:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:37:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:37:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:37:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:37:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:37:55,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:37:55,174 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:37:55,268 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:37:55,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:37:55,423 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:37:55,423 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:37:55,423 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:37:55,513 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:37:55,520 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:37:55,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:55 BoogieIcfgContainer [2025-04-13 19:37:55,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:37:55,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:37:55,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:37:55,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:37:55,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:37:54" (1/3) ... [2025-04-13 19:37:55,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48154d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:55, skipping insertion in model container [2025-04-13 19:37:55,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:55" (2/3) ... [2025-04-13 19:37:55,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48154d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:55, skipping insertion in model container [2025-04-13 19:37:55,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:55" (3/3) ... [2025-04-13 19:37:55,527 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004-2b.i [2025-04-13 19:37:55,537 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:37:55,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004-2b.i that has 2 procedures, 28 locations, 31 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:37:55,538 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:37:55,571 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:37:55,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 32 transitions, 68 flow [2025-04-13 19:37:55,619 INFO L116 PetriNetUnfolderBase]: 5/31 cut-off events. [2025-04-13 19:37:55,621 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:55,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 31 events. 5/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2025-04-13 19:37:55,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 32 transitions, 68 flow [2025-04-13 19:37:55,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 31 transitions, 65 flow [2025-04-13 19:37:55,633 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:37:55,641 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;@737ed7f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:37:55,641 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 19:37:55,654 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:37:55,655 INFO L116 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-04-13 19:37:55,655 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:55,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:55,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:55,656 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:37:55,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash -346198647, now seen corresponding path program 1 times [2025-04-13 19:37:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:55,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277758077] [2025-04-13 19:37:55,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:55,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:37:55,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:37:55,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:55,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:55,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277758077] [2025-04-13 19:37:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277758077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:55,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:55,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:55,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64963298] [2025-04-13 19:37:55,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:55,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:55,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:55,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:55,905 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-04-13 19:37:55,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:55,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:55,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-04-13 19:37:55,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,032 INFO L116 PetriNetUnfolderBase]: 98/233 cut-off events. [2025-04-13 19:37:56,032 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:56,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 233 events. 98/233 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 955 event pairs, 36 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 408. Up to 140 conditions per place. [2025-04-13 19:37:56,035 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 22 selfloop transitions, 7 changer transitions 10/47 dead transitions. [2025-04-13 19:37:56,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 173 flow [2025-04-13 19:37:56,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-04-13 19:37:56,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-04-13 19:37:56,045 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 65 flow. Second operand 5 states and 95 transitions. [2025-04-13 19:37:56,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 173 flow [2025-04-13 19:37:56,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:37:56,051 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 94 flow [2025-04-13 19:37:56,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-04-13 19:37:56,056 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-04-13 19:37:56,056 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 94 flow [2025-04-13 19:37:56,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:56,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:37:56,057 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:37:56,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1429659003, now seen corresponding path program 1 times [2025-04-13 19:37:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233790097] [2025-04-13 19:37:56,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:37:56,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:37:56,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:56,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:56,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233790097] [2025-04-13 19:37:56,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233790097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:56,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:56,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:37:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183851760] [2025-04-13 19:37:56,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:56,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:56,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:56,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:56,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:56,180 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-04-13 19:37:56,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:56,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-04-13 19:37:56,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,260 INFO L116 PetriNetUnfolderBase]: 52/131 cut-off events. [2025-04-13 19:37:56,260 INFO L117 PetriNetUnfolderBase]: For 88/95 co-relation queries the response was YES. [2025-04-13 19:37:56,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 131 events. 52/131 cut-off events. For 88/95 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 458 event pairs, 12 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 292. Up to 59 conditions per place. [2025-04-13 19:37:56,261 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 18 selfloop transitions, 4 changer transitions 7/41 dead transitions. [2025-04-13 19:37:56,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 186 flow [2025-04-13 19:37:56,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-13 19:37:56,262 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-04-13 19:37:56,262 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 94 flow. Second operand 5 states and 85 transitions. [2025-04-13 19:37:56,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 186 flow [2025-04-13 19:37:56,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:37:56,266 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 116 flow [2025-04-13 19:37:56,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2025-04-13 19:37:56,266 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-13 19:37:56,266 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 116 flow [2025-04-13 19:37:56,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,267 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-13 19:37:56,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:37:56,267 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:37:56,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1319998101, now seen corresponding path program 1 times [2025-04-13 19:37:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739523995] [2025-04-13 19:37:56,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:37:56,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:37:56,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:56,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:56,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739523995] [2025-04-13 19:37:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739523995] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994515217] [2025-04-13 19:37:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:56,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:56,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:56,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:56,327 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-04-13 19:37:56,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:56,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-04-13 19:37:56,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,379 INFO L116 PetriNetUnfolderBase]: 48/134 cut-off events. [2025-04-13 19:37:56,379 INFO L117 PetriNetUnfolderBase]: For 139/156 co-relation queries the response was YES. [2025-04-13 19:37:56,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 134 events. 48/134 cut-off events. For 139/156 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 521 event pairs, 9 based on Foata normal form. 13/136 useless extension candidates. Maximal degree in co-relation 343. Up to 49 conditions per place. [2025-04-13 19:37:56,380 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 13 selfloop transitions, 2 changer transitions 11/38 dead transitions. [2025-04-13 19:37:56,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 208 flow [2025-04-13 19:37:56,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:37:56,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:37:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-13 19:37:56,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2025-04-13 19:37:56,381 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 116 flow. Second operand 4 states and 65 transitions. [2025-04-13 19:37:56,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 208 flow [2025-04-13 19:37:56,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:56,383 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 102 flow [2025-04-13 19:37:56,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2025-04-13 19:37:56,383 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-04-13 19:37:56,383 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 102 flow [2025-04-13 19:37:56,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:56,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:37:56,384 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:37:56,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 547652745, now seen corresponding path program 1 times [2025-04-13 19:37:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101323587] [2025-04-13 19:37:56,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:37:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:37:56,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:56,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:56,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101323587] [2025-04-13 19:37:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101323587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:56,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:37:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795356666] [2025-04-13 19:37:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:56,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:37:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:56,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:37:56,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:37:56,483 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-04-13 19:37:56,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:56,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-04-13 19:37:56,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,620 INFO L116 PetriNetUnfolderBase]: 35/126 cut-off events. [2025-04-13 19:37:56,620 INFO L117 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-04-13 19:37:56,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 126 events. 35/126 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 471 event pairs, 12 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 292. Up to 45 conditions per place. [2025-04-13 19:37:56,621 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 22 selfloop transitions, 6 changer transitions 7/47 dead transitions. [2025-04-13 19:37:56,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 232 flow [2025-04-13 19:37:56,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:37:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:37:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2025-04-13 19:37:56,624 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46875 [2025-04-13 19:37:56,624 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 102 flow. Second operand 9 states and 135 transitions. [2025-04-13 19:37:56,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 232 flow [2025-04-13 19:37:56,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 202 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-13 19:37:56,626 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 123 flow [2025-04-13 19:37:56,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2025-04-13 19:37:56,626 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2025-04-13 19:37:56,626 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 123 flow [2025-04-13 19:37:56,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:56,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:37:56,627 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:37:56,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2102550353, now seen corresponding path program 2 times [2025-04-13 19:37:56,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653444932] [2025-04-13 19:37:56,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:37:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:37:56,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:37:56,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:37:56,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:56,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653444932] [2025-04-13 19:37:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653444932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:56,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:56,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54196189] [2025-04-13 19:37:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:56,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:56,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:56,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:56,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:56,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-04-13 19:37:56,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:56,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-04-13 19:37:56,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,711 INFO L116 PetriNetUnfolderBase]: 25/111 cut-off events. [2025-04-13 19:37:56,712 INFO L117 PetriNetUnfolderBase]: For 95/99 co-relation queries the response was YES. [2025-04-13 19:37:56,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 111 events. 25/111 cut-off events. For 95/99 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 391 event pairs, 8 based on Foata normal form. 8/115 useless extension candidates. Maximal degree in co-relation 272. Up to 60 conditions per place. [2025-04-13 19:37:56,712 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 15 selfloop transitions, 1 changer transitions 8/34 dead transitions. [2025-04-13 19:37:56,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 189 flow [2025-04-13 19:37:56,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:37:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:37:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-13 19:37:56,713 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-04-13 19:37:56,713 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 123 flow. Second operand 4 states and 62 transitions. [2025-04-13 19:37:56,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 189 flow [2025-04-13 19:37:56,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 175 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:56,715 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 100 flow [2025-04-13 19:37:56,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2025-04-13 19:37:56,715 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-04-13 19:37:56,715 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 100 flow [2025-04-13 19:37:56,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:56,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:56,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:37:56,716 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:37:56,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash -968030969, now seen corresponding path program 3 times [2025-04-13 19:37:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140990280] [2025-04-13 19:37:56,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:37:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:37:56,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:37:56,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:37:56,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:37:56,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:37:56,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:37:56,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:37:56,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:56,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:37:56,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:37:56,755 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:37:56,756 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-13 19:37:56,757 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-13 19:37:56,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:37:56,757 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-13 19:37:56,804 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:37:56,804 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:37:56,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:37:56 BasicIcfg [2025-04-13 19:37:56,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:37:56,810 INFO L158 Benchmark]: Toolchain (without parser) took 2214.86ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 77.0MB in the end (delta: 21.7MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2025-04-13 19:37:56,810 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:56,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.74ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 75.9MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:37:56,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.03ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 73.3MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:37:56,811 INFO L158 Benchmark]: Boogie Preprocessor took 39.17ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 71.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:56,811 INFO L158 Benchmark]: RCFGBuilder took 409.97ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 44.4MB in the end (delta: 27.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 19:37:56,811 INFO L158 Benchmark]: TraceAbstraction took 1287.56ms. Allocated memory is still 142.6MB. Free memory was 43.4MB in the beginning and 77.0MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:56,812 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.19ms. Allocated memory is still 155.2MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 440.74ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 75.9MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.03ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 73.3MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.17ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 71.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 409.97ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 44.4MB in the end (delta: 27.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1287.56ms. Allocated memory is still 142.6MB. Free memory was 43.4MB in the beginning and 77.0MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 690]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L697] 0 volatile int stoppingFlag; [L698] 0 volatile int pendingIo; [L699] 0 volatile int stoppingEvent; [L700] 0 volatile int stopped; [L756] 0 pthread_t t; [L757] 0 pendingIo = 1 [L758] 0 stoppingFlag = 0 [L759] 0 stoppingEvent = 0 [L760] 0 stopped = 0 [L761] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L762] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L745] 1 stoppingFlag = 1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L747] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; [L726] CALL, EXPR 1 dec() [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L709] 0 int lp = pendingIo; VAL [lp=0, lsf=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L712] 0 pendingIo = lp + 1 VAL [lp=0, lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L715] 0 return 0; [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() [L736] COND TRUE 0 status == 0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, pendingIo=1, status=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L722] 1 return tmp; [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=1, stopped=0, stoppingEvent=1, stoppingFlag=1] [L747] RET 1 BCSP_IoDecrement() [L749] 1 int lse = stoppingEvent; VAL [\at(arg, Pre)={0:0}, arg={0:0}, lse=1, pendingIo=1, stopped=0, stoppingEvent=1, stoppingFlag=1] [L751] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) [L751] RET 1 assume_abort_if_not(lse) [L752] 1 stopped = 1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, lse=1, pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 int local_assertion = !stopped; VAL [\at(arg, Pre)={0:0}, arg={0:0}, local_assertion=0, pendingIo=1, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L738] CALL 0 __VERIFIER_assert(local_assertion) [L689] COND TRUE 0 !(cond) [L690] 0 reach_error() VAL [\at(cond, Pre)=0, cond=0, pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] - UnprovableResult [Line: 761]: 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 3 procedures, 41 locations, 45 edges, 2 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: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 6 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=4, InterpolantAutomatonStates: 27, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-13 19:37:56,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...