/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/mix026.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:02:13,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:02:13,221 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:02:13,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:02:13,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:02:13,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:02:13,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:02:13,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:02:13,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:02:13,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:02:13,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:02:13,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:02:13,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:02:13,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:02:13,248 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:02:13,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:02:13,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:02:13,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:02:13,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:02:13,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:02:13,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:02:13,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:02:13,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:02:13,251 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:02:13,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:02:13,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:02:13,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:02:13,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:02:13,502 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:02:13,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2025-04-14 00:02:14,929 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4dcf96df/4581503d929d4e14b01290ada9759ea2/FLAG44000581c [2025-04-14 00:02:15,223 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:02:15,224 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2025-04-14 00:02:15,240 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4dcf96df/4581503d929d4e14b01290ada9759ea2/FLAG44000581c [2025-04-14 00:02:15,979 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4dcf96df/4581503d929d4e14b01290ada9759ea2 [2025-04-14 00:02:15,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:02:15,982 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:02:15,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:02:15,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:02:15,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:02:15,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:02:15" (1/1) ... [2025-04-14 00:02:15,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d28b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:15, skipping insertion in model container [2025-04-14 00:02:15,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:02:15" (1/1) ... [2025-04-14 00:02:16,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:02:16,209 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/mix026.oepc.i[945,958] [2025-04-14 00:02:16,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:02:16,409 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:02:16,434 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/mix026.oepc.i[945,958] [2025-04-14 00:02:16,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:02:16,517 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:02:16,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16 WrapperNode [2025-04-14 00:02:16,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:02:16,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:02:16,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:02:16,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:02:16,525 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:02:16" (1/1) ... [2025-04-14 00:02:16,548 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:02:16" (1/1) ... [2025-04-14 00:02:16,575 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2025-04-14 00:02:16,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:02:16,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:02:16,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:02:16,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:02:16,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,609 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:02:16,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:02:16,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:02:16,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:02:16,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:02:16,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (1/1) ... [2025-04-14 00:02:16,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:02:16,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:02:16,653 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:02:16,659 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:02:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:02:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:02:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:02:16,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:02:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:02:16,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:02:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:02:16,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:02:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-14 00:02:16,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-14 00:02:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:02:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:02:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:02:16,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:02:16,680 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:02:16,784 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:02:16,785 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:02:17,122 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:02:17,123 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:02:17,123 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:02:17,417 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:02:17,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:02:17 BoogieIcfgContainer [2025-04-14 00:02:17,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:02:17,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:02:17,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:02:17,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:02:17,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:02:15" (1/3) ... [2025-04-14 00:02:17,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38df886d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:02:17, skipping insertion in model container [2025-04-14 00:02:17,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:02:16" (2/3) ... [2025-04-14 00:02:17,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38df886d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:02:17, skipping insertion in model container [2025-04-14 00:02:17,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:02:17" (3/3) ... [2025-04-14 00:02:17,426 INFO L128 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2025-04-14 00:02:17,436 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:02:17,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix026.oepc.i that has 5 procedures, 46 locations, 41 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:02:17,438 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:02:17,494 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:02:17,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 106 flow [2025-04-14 00:02:17,548 INFO L116 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-04-14 00:02:17,550 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:02:17,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:02:17,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 106 flow [2025-04-14 00:02:17,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 94 flow [2025-04-14 00:02:17,558 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:02:17,571 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;@2cd85bda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:02:17,572 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-14 00:02:17,575 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:02:17,575 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-14 00:02:17,576 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:02:17,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:17,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-14 00:02:17,576 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:17,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 12970989, now seen corresponding path program 1 times [2025-04-14 00:02:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:17,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319622213] [2025-04-14 00:02:17,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:02:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:17,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-14 00:02:17,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-14 00:02:17,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:02:17,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:17,958 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:02:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:17,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319622213] [2025-04-14 00:02:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319622213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:17,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:17,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:02:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569461023] [2025-04-14 00:02:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:17,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:02:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:17,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:02:17,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:02:17,989 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:17,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:02:17,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:17,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:17,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:21,922 INFO L116 PetriNetUnfolderBase]: 40307/52930 cut-off events. [2025-04-14 00:02:21,923 INFO L117 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2025-04-14 00:02:22,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106374 conditions, 52930 events. 40307/52930 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 1565. Compared 309243 event pairs, 4967 based on Foata normal form. 0/51405 useless extension candidates. Maximal degree in co-relation 106362. Up to 45851 conditions per place. [2025-04-14 00:02:22,230 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 61 selfloop transitions, 2 changer transitions 2/69 dead transitions. [2025-04-14 00:02:22,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 289 flow [2025-04-14 00:02:22,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:02:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:02:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-04-14 00:02:22,239 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-14 00:02:22,240 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 3 states and 90 transitions. [2025-04-14 00:02:22,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 289 flow [2025-04-14 00:02:22,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 282 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:02:22,251 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 90 flow [2025-04-14 00:02:22,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-04-14 00:02:22,256 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-04-14 00:02:22,256 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 90 flow [2025-04-14 00:02:22,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:02:22,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:22,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:02:22,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:02:22,257 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:22,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:22,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1591148880, now seen corresponding path program 1 times [2025-04-14 00:02:22,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:22,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021763544] [2025-04-14 00:02:22,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:02:22,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:22,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:02:22,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:02:22,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:02:22,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:22,500 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:02:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:22,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021763544] [2025-04-14 00:02:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021763544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:22,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:22,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:02:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183666053] [2025-04-14 00:02:22,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:22,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:02:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:22,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:02:22,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:02:22,502 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:22,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 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-14 00:02:22,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:22,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:22,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:25,400 INFO L116 PetriNetUnfolderBase]: 32715/43761 cut-off events. [2025-04-14 00:02:25,400 INFO L117 PetriNetUnfolderBase]: For 1702/1702 co-relation queries the response was YES. [2025-04-14 00:02:25,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89713 conditions, 43761 events. 32715/43761 cut-off events. For 1702/1702 co-relation queries the response was YES. Maximal size of possible extension queue 1412. Compared 252383 event pairs, 4407 based on Foata normal form. 1512/45224 useless extension candidates. Maximal degree in co-relation 89703. Up to 24941 conditions per place. [2025-04-14 00:02:25,684 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 74 selfloop transitions, 6 changer transitions 1/85 dead transitions. [2025-04-14 00:02:25,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 354 flow [2025-04-14 00:02:25,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:02:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:02:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-04-14 00:02:25,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-04-14 00:02:25,685 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 4 states and 115 transitions. [2025-04-14 00:02:25,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 354 flow [2025-04-14 00:02:25,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:02:25,690 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 128 flow [2025-04-14 00:02:25,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-04-14 00:02:25,691 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-04-14 00:02:25,691 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 128 flow [2025-04-14 00:02:25,691 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-14 00:02:25,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:25,691 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:02:25,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:02:25,692 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:25,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -427980594, now seen corresponding path program 1 times [2025-04-14 00:02:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:25,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915347102] [2025-04-14 00:02:25,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:02:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:25,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:02:25,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:02:25,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:02:25,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:25,942 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:02:25,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:25,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915347102] [2025-04-14 00:02:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915347102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:02:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377018479] [2025-04-14 00:02:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:25,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:02:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:25,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:02:25,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:02:25,943 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:25,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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:02:25,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:25,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:25,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:28,065 INFO L116 PetriNetUnfolderBase]: 21403/29089 cut-off events. [2025-04-14 00:02:28,066 INFO L117 PetriNetUnfolderBase]: For 6092/6092 co-relation queries the response was YES. [2025-04-14 00:02:28,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66977 conditions, 29089 events. 21403/29089 cut-off events. For 6092/6092 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 162117 event pairs, 2563 based on Foata normal form. 1192/30232 useless extension candidates. Maximal degree in co-relation 66965. Up to 11261 conditions per place. [2025-04-14 00:02:28,295 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 96 selfloop transitions, 10 changer transitions 1/111 dead transitions. [2025-04-14 00:02:28,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 507 flow [2025-04-14 00:02:28,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:02:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:02:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-04-14 00:02:28,298 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2025-04-14 00:02:28,298 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 128 flow. Second operand 5 states and 149 transitions. [2025-04-14 00:02:28,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 507 flow [2025-04-14 00:02:28,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 496 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:02:28,317 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 180 flow [2025-04-14 00:02:28,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-04-14 00:02:28,319 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-04-14 00:02:28,319 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 180 flow [2025-04-14 00:02:28,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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:02:28,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:28,320 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:02:28,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:02:28,320 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:28,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash 120412075, now seen corresponding path program 1 times [2025-04-14 00:02:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:28,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166788290] [2025-04-14 00:02:28,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:02:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:28,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:02:28,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:02:28,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:02:28,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:28,628 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:02:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:28,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166788290] [2025-04-14 00:02:28,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166788290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:02:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565548608] [2025-04-14 00:02:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:28,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:02:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:28,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:02:28,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:02:28,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:28,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:02:28,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:28,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:28,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:30,275 INFO L116 PetriNetUnfolderBase]: 13227/18145 cut-off events. [2025-04-14 00:02:30,275 INFO L117 PetriNetUnfolderBase]: For 11602/11602 co-relation queries the response was YES. [2025-04-14 00:02:30,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45261 conditions, 18145 events. 13227/18145 cut-off events. For 11602/11602 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 95338 event pairs, 2215 based on Foata normal form. 584/18680 useless extension candidates. Maximal degree in co-relation 45247. Up to 5388 conditions per place. [2025-04-14 00:02:30,352 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 116 selfloop transitions, 14 changer transitions 1/135 dead transitions. [2025-04-14 00:02:30,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 135 transitions, 666 flow [2025-04-14 00:02:30,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:02:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:02:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-04-14 00:02:30,354 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6703703703703704 [2025-04-14 00:02:30,354 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 180 flow. Second operand 6 states and 181 transitions. [2025-04-14 00:02:30,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 135 transitions, 666 flow [2025-04-14 00:02:30,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 135 transitions, 636 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-14 00:02:30,448 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 230 flow [2025-04-14 00:02:30,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-04-14 00:02:30,449 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-04-14 00:02:30,449 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 230 flow [2025-04-14 00:02:30,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:02:30,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:30,449 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:02:30,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:02:30,449 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:30,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:30,450 INFO L85 PathProgramCache]: Analyzing trace with hash 653511442, now seen corresponding path program 1 times [2025-04-14 00:02:30,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:30,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219303358] [2025-04-14 00:02:30,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:02:30,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:30,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:02:30,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:02:30,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:02:30,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:30,741 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:02:30,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:30,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219303358] [2025-04-14 00:02:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219303358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:30,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:02:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089849113] [2025-04-14 00:02:30,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:30,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:02:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:30,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:02:30,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:02:30,742 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:30,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:02:30,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:30,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:31,648 INFO L116 PetriNetUnfolderBase]: 10367/14173 cut-off events. [2025-04-14 00:02:31,648 INFO L117 PetriNetUnfolderBase]: For 11290/11290 co-relation queries the response was YES. [2025-04-14 00:02:31,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36294 conditions, 14173 events. 10367/14173 cut-off events. For 11290/11290 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 73118 event pairs, 2043 based on Foata normal form. 152/14276 useless extension candidates. Maximal degree in co-relation 36279. Up to 5376 conditions per place. [2025-04-14 00:02:31,724 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 100 selfloop transitions, 18 changer transitions 1/123 dead transitions. [2025-04-14 00:02:31,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 123 transitions, 628 flow [2025-04-14 00:02:31,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:02:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:02:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-04-14 00:02:31,726 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2025-04-14 00:02:31,726 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 230 flow. Second operand 7 states and 177 transitions. [2025-04-14 00:02:31,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 123 transitions, 628 flow [2025-04-14 00:02:31,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 123 transitions, 582 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-04-14 00:02:31,888 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 240 flow [2025-04-14 00:02:31,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2025-04-14 00:02:31,889 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-04-14 00:02:31,889 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 240 flow [2025-04-14 00:02:31,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:02:31,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:31,889 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, 1, 1, 1, 1, 1, 1] [2025-04-14 00:02:31,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:02:31,889 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:31,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1603844485, now seen corresponding path program 1 times [2025-04-14 00:02:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:31,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574010128] [2025-04-14 00:02:31,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:02:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:31,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:02:31,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:02:31,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:02:31,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:32,360 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:02:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:32,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574010128] [2025-04-14 00:02:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574010128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:32,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:02:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139574283] [2025-04-14 00:02:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:32,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:02:32,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:32,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:02:32,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:02:32,366 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:32,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:02:32,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:32,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:32,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:34,385 INFO L116 PetriNetUnfolderBase]: 21187/28979 cut-off events. [2025-04-14 00:02:34,386 INFO L117 PetriNetUnfolderBase]: For 24340/24340 co-relation queries the response was YES. [2025-04-14 00:02:34,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75113 conditions, 28979 events. 21187/28979 cut-off events. For 24340/24340 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 162209 event pairs, 1071 based on Foata normal form. 32/29003 useless extension candidates. Maximal degree in co-relation 75097. Up to 11144 conditions per place. [2025-04-14 00:02:34,504 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 97 selfloop transitions, 10 changer transitions 62/173 dead transitions. [2025-04-14 00:02:34,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 173 transitions, 1140 flow [2025-04-14 00:02:34,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:02:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:02:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2025-04-14 00:02:34,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2025-04-14 00:02:34,506 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 240 flow. Second operand 8 states and 193 transitions. [2025-04-14 00:02:34,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 173 transitions, 1140 flow [2025-04-14 00:02:34,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 173 transitions, 822 flow, removed 51 selfloop flow, removed 10 redundant places. [2025-04-14 00:02:34,833 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 219 flow [2025-04-14 00:02:34,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2025-04-14 00:02:34,834 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2025-04-14 00:02:34,834 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 219 flow [2025-04-14 00:02:34,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:02:34,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:34,834 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, 1, 1, 1, 1, 1, 1] [2025-04-14 00:02:34,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:02:34,835 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:34,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash 711005387, now seen corresponding path program 2 times [2025-04-14 00:02:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:34,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792176606] [2025-04-14 00:02:34,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:02:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:34,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:02:34,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:02:34,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:02:34,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:35,259 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:02:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:35,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792176606] [2025-04-14 00:02:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792176606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:35,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:02:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709518230] [2025-04-14 00:02:35,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:35,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:02:35,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:35,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:02:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:02:35,261 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:35,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:02:35,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:35,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:35,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:37,805 INFO L116 PetriNetUnfolderBase]: 21901/30485 cut-off events. [2025-04-14 00:02:37,806 INFO L117 PetriNetUnfolderBase]: For 14549/14553 co-relation queries the response was YES. [2025-04-14 00:02:37,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77312 conditions, 30485 events. 21901/30485 cut-off events. For 14549/14553 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 178364 event pairs, 3563 based on Foata normal form. 19/30495 useless extension candidates. Maximal degree in co-relation 77295. Up to 12060 conditions per place. [2025-04-14 00:02:37,909 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 80 selfloop transitions, 8 changer transitions 102/194 dead transitions. [2025-04-14 00:02:37,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 194 transitions, 1069 flow [2025-04-14 00:02:37,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:02:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:02:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2025-04-14 00:02:37,911 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-04-14 00:02:37,911 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 219 flow. Second operand 7 states and 192 transitions. [2025-04-14 00:02:37,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 194 transitions, 1069 flow [2025-04-14 00:02:37,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 194 transitions, 1044 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:02:37,919 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 224 flow [2025-04-14 00:02:37,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2025-04-14 00:02:37,920 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2025-04-14 00:02:37,920 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 224 flow [2025-04-14 00:02:37,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:02:37,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:37,920 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, 1, 1, 1, 1, 1, 1] [2025-04-14 00:02:37,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:02:37,921 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:37,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash -415670987, now seen corresponding path program 3 times [2025-04-14 00:02:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:37,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222802419] [2025-04-14 00:02:37,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:02:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:37,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:02:37,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:02:37,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:02:37,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:38,205 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:02:38,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:38,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222802419] [2025-04-14 00:02:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222802419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:38,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:02:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595681425] [2025-04-14 00:02:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:38,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:02:38,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:38,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:02:38,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:02:38,206 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:38,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:02:38,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:38,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:38,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:39,283 INFO L116 PetriNetUnfolderBase]: 12577/17825 cut-off events. [2025-04-14 00:02:39,283 INFO L117 PetriNetUnfolderBase]: For 11090/11094 co-relation queries the response was YES. [2025-04-14 00:02:39,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44420 conditions, 17825 events. 12577/17825 cut-off events. For 11090/11094 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 100021 event pairs, 3561 based on Foata normal form. 19/17841 useless extension candidates. Maximal degree in co-relation 44401. Up to 10444 conditions per place. [2025-04-14 00:02:39,366 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 68 selfloop transitions, 4 changer transitions 25/101 dead transitions. [2025-04-14 00:02:39,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 555 flow [2025-04-14 00:02:39,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:02:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:02:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-04-14 00:02:39,368 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2025-04-14 00:02:39,368 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 224 flow. Second operand 5 states and 113 transitions. [2025-04-14 00:02:39,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 555 flow [2025-04-14 00:02:39,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 542 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-14 00:02:39,375 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 193 flow [2025-04-14 00:02:39,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2025-04-14 00:02:39,376 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2025-04-14 00:02:39,376 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 193 flow [2025-04-14 00:02:39,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:02:39,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:39,376 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, 1, 1, 1, 1, 1, 1] [2025-04-14 00:02:39,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:02:39,376 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:39,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:39,376 INFO L85 PathProgramCache]: Analyzing trace with hash 735694949, now seen corresponding path program 4 times [2025-04-14 00:02:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:39,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875787822] [2025-04-14 00:02:39,377 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:02:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:39,385 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-14 00:02:39,436 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:02:39,436 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:02:39,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:02:40,813 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:02:40,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:02:40,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875787822] [2025-04-14 00:02:40,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875787822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:02:40,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:02:40,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:02:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370145500] [2025-04-14 00:02:40,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:02:40,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:02:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:02:40,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:02:40,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:02:40,814 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:02:40,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 193 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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:02:40,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:02:40,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:02:40,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:02:41,630 INFO L116 PetriNetUnfolderBase]: 6691/9610 cut-off events. [2025-04-14 00:02:41,631 INFO L117 PetriNetUnfolderBase]: For 5646/5646 co-relation queries the response was YES. [2025-04-14 00:02:41,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24124 conditions, 9610 events. 6691/9610 cut-off events. For 5646/5646 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 48952 event pairs, 1536 based on Foata normal form. 16/9625 useless extension candidates. Maximal degree in co-relation 24104. Up to 4020 conditions per place. [2025-04-14 00:02:41,666 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 98 selfloop transitions, 4 changer transitions 45/151 dead transitions. [2025-04-14 00:02:41,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 151 transitions, 840 flow [2025-04-14 00:02:41,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:02:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:02:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-04-14 00:02:41,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.526984126984127 [2025-04-14 00:02:41,667 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 193 flow. Second operand 7 states and 166 transitions. [2025-04-14 00:02:41,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 151 transitions, 840 flow [2025-04-14 00:02:41,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 151 transitions, 774 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-04-14 00:02:41,673 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 190 flow [2025-04-14 00:02:41,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2025-04-14 00:02:41,675 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2025-04-14 00:02:41,675 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 190 flow [2025-04-14 00:02:41,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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:02:41,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:02:41,675 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, 1, 1, 1, 1, 1, 1] [2025-04-14 00:02:41,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:02:41,676 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:02:41,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:02:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -894286265, now seen corresponding path program 5 times [2025-04-14 00:02:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:02:41,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096530378] [2025-04-14 00:02:41,677 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:02:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:02:41,694 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:02:41,762 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:02:41,762 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:02:41,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:02:41,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:02:41,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:02:41,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:02:41,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:02:41,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:02:41,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:02:41,852 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:02:41,852 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-14 00:02:41,854 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-14 00:02:41,854 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-14 00:02:41,854 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-14 00:02:41,854 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-14 00:02:41,854 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-14 00:02:41,854 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-14 00:02:41,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:02:41,854 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-04-14 00:02:41,975 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:02:41,975 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:02:41,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:02:41 BasicIcfg [2025-04-14 00:02:41,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:02:41,984 INFO L158 Benchmark]: Toolchain (without parser) took 26002.38ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 97.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2025-04-14 00:02:41,984 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 163.6MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:02:41,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.28ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 70.5MB in the end (delta: 27.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:02:41,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.78ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 68.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:02:41,985 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 64.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:02:41,985 INFO L158 Benchmark]: IcfgBuilder took 792.77ms. Allocated memory is still 142.6MB. Free memory was 64.4MB in the beginning and 56.3MB in the end (delta: 8.2MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2025-04-14 00:02:41,985 INFO L158 Benchmark]: TraceAbstraction took 24563.95ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 55.6MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-14 00:02:41,988 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.25ms. Allocated memory is still 163.6MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 536.28ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 70.5MB in the end (delta: 27.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.78ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 68.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 64.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 792.77ms. Allocated memory is still 142.6MB. Free memory was 64.4MB in the beginning and 56.3MB in the end (delta: 8.2MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. * TraceAbstraction took 24563.95ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 55.6MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 1.9GB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t681=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t681=-3, t682=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t681=-3, t682=-2, t683=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t681=-3, t682=-2, t683=-1, t684=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 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_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 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_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 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_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L825] 4 __unbuffered_p3_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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L815] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681=-3, t682=-2, t683=-1, t684=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681=-3, t682=-2, t683=-1, t684=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681=-3, t682=-2, t683=-1, t684=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L888] 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(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 867]: 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: 873]: 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: 871]: 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 9 procedures, 80 locations, 75 edges, 7 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: 24.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 818 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 818 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1925 IncrementalHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 0 mSDtfsCounter, 1925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-14 00:02:42,005 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...