/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:32:28,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:32:28,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:32:28,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:32:28,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:32:28,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:32:28,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:32:28,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:32:28,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:32:28,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:32:28,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:32:28,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:32:28,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:32:28,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:32:28,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:32:28,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:32:28,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:32:28,379 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:32:28,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:32:28,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:32:28,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:32:28,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:32:28,601 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:32:28,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2025-04-13 19:32:29,856 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca281aa3/1c2c7be03e954433add77d09c9e86b56/FLAGc2ad4ef20 [2025-04-13 19:32:30,124 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:32:30,127 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2025-04-13 19:32:30,140 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca281aa3/1c2c7be03e954433add77d09c9e86b56/FLAGc2ad4ef20 [2025-04-13 19:32:30,906 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca281aa3/1c2c7be03e954433add77d09c9e86b56 [2025-04-13 19:32:30,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:32:30,910 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:32:30,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:32:30,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:32:30,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:32:30,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:32:30" (1/1) ... [2025-04-13 19:32:30,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447c2920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:30, skipping insertion in model container [2025-04-13 19:32:30,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:32:30" (1/1) ... [2025-04-13 19:32:30,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:32:31,078 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/mix032.oepc.i[945,958] [2025-04-13 19:32:31,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:32:31,209 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:32:31,226 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/mix032.oepc.i[945,958] [2025-04-13 19:32:31,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:32:31,319 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:32:31,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31 WrapperNode [2025-04-13 19:32:31,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:32:31,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:32:31,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:32:31,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:32:31,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,367 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2025-04-13 19:32:31,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:32:31,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:32:31,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:32:31,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:32:31,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:32:31,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:32:31,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:32:31,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:32:31,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:32:31,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (1/1) ... [2025-04-13 19:32:31,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:32:31,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:32:31,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:32:31,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:32:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:32:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:32:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:32:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:32:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:32:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:32:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:32:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:32:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:32:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:32:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:32:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:32:31,463 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:32:31,568 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:32:31,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:32:31,822 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:32:31,822 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:32:31,822 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:32:32,033 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:32:32,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:32:32 BoogieIcfgContainer [2025-04-13 19:32:32,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:32:32,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:32:32,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:32:32,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:32:32,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:32:30" (1/3) ... [2025-04-13 19:32:32,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf69da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:32:32, skipping insertion in model container [2025-04-13 19:32:32,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:32:31" (2/3) ... [2025-04-13 19:32:32,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf69da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:32:32, skipping insertion in model container [2025-04-13 19:32:32,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:32:32" (3/3) ... [2025-04-13 19:32:32,041 INFO L128 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2025-04-13 19:32:32,051 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:32:32,052 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix032.oepc.i that has 4 procedures, 40 locations, 36 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:32:32,053 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:32:32,098 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:32:32,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 90 flow [2025-04-13 19:32:32,144 INFO L116 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-04-13 19:32:32,148 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:32:32,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:32:32,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 39 transitions, 90 flow [2025-04-13 19:32:32,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 81 flow [2025-04-13 19:32:32,162 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:32:32,171 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;@44ee6823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:32:32,171 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:32:32,175 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:32:32,176 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 19:32:32,176 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:32:32,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:32,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:32:32,176 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:32,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:32,181 INFO L85 PathProgramCache]: Analyzing trace with hash 11544098, now seen corresponding path program 1 times [2025-04-13 19:32:32,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:32,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283422482] [2025-04-13 19:32:32,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:32:32,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:32,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:32:32,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:32:32,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:32,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:32,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283422482] [2025-04-13 19:32:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283422482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:32:32,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569841875] [2025-04-13 19:32:32,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:32,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:32:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:32,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:32:32,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:32:32,619 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2025-04-13 19:32:32,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:32,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:32,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2025-04-13 19:32:32,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:32,939 INFO L116 PetriNetUnfolderBase]: 617/1093 cut-off events. [2025-04-13 19:32:32,939 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 19:32:32,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 1093 events. 617/1093 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6374 event pairs, 343 based on Foata normal form. 0/1023 useless extension candidates. Maximal degree in co-relation 2059. Up to 763 conditions per place. [2025-04-13 19:32:32,951 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2025-04-13 19:32:32,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 179 flow [2025-04-13 19:32:32,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:32:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:32:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-04-13 19:32:32,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-04-13 19:32:32,961 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 91 transitions. [2025-04-13 19:32:32,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 179 flow [2025-04-13 19:32:32,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:32:32,968 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2025-04-13 19:32:32,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-04-13 19:32:32,974 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-04-13 19:32:32,974 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2025-04-13 19:32:32,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:32,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:32,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:32:32,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:32:32,975 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:32,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1253405279, now seen corresponding path program 1 times [2025-04-13 19:32:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:32,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233761496] [2025-04-13 19:32:32,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:32:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:32,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:32:33,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:32:33,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:33,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:33,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233761496] [2025-04-13 19:32:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233761496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:33,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:33,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:32:33,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918218682] [2025-04-13 19:32:33,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:33,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:32:33,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:33,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:32:33,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:32:33,232 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2025-04-13 19:32:33,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:33,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:33,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2025-04-13 19:32:33,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:33,702 INFO L116 PetriNetUnfolderBase]: 1929/3069 cut-off events. [2025-04-13 19:32:33,702 INFO L117 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-04-13 19:32:33,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6181 conditions, 3069 events. 1929/3069 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 18368 event pairs, 1105 based on Foata normal form. 125/3166 useless extension candidates. Maximal degree in co-relation 6171. Up to 2536 conditions per place. [2025-04-13 19:32:33,719 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 30 selfloop transitions, 4 changer transitions 17/62 dead transitions. [2025-04-13 19:32:33,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 246 flow [2025-04-13 19:32:33,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:32:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:32:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-04-13 19:32:33,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2025-04-13 19:32:33,722 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 5 states and 123 transitions. [2025-04-13 19:32:33,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 246 flow [2025-04-13 19:32:33,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:32:33,724 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 110 flow [2025-04-13 19:32:33,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2025-04-13 19:32:33,724 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-04-13 19:32:33,724 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 110 flow [2025-04-13 19:32:33,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:33,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:33,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:32:33,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:32:33,725 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:33,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2051357588, now seen corresponding path program 1 times [2025-04-13 19:32:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:33,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963527932] [2025-04-13 19:32:33,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:32:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:33,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:32:33,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:32:33,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:33,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:33,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963527932] [2025-04-13 19:32:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963527932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:32:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377273334] [2025-04-13 19:32:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:33,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:32:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:33,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:32:33,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:32:33,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2025-04-13 19:32:33,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:33,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:33,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2025-04-13 19:32:33,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:34,244 INFO L116 PetriNetUnfolderBase]: 1814/2922 cut-off events. [2025-04-13 19:32:34,244 INFO L117 PetriNetUnfolderBase]: For 1586/1604 co-relation queries the response was YES. [2025-04-13 19:32:34,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6924 conditions, 2922 events. 1814/2922 cut-off events. For 1586/1604 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16954 event pairs, 686 based on Foata normal form. 115/3015 useless extension candidates. Maximal degree in co-relation 6911. Up to 2123 conditions per place. [2025-04-13 19:32:34,259 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 36 selfloop transitions, 3 changer transitions 21/71 dead transitions. [2025-04-13 19:32:34,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 330 flow [2025-04-13 19:32:34,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:32:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:32:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-04-13 19:32:34,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2025-04-13 19:32:34,261 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 110 flow. Second operand 5 states and 129 transitions. [2025-04-13 19:32:34,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 330 flow [2025-04-13 19:32:34,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 324 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:32:34,267 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 119 flow [2025-04-13 19:32:34,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-04-13 19:32:34,268 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2025-04-13 19:32:34,268 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 119 flow [2025-04-13 19:32:34,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:34,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:34,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:32:34,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:32:34,268 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:34,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1168069793, now seen corresponding path program 1 times [2025-04-13 19:32:34,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:34,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074644370] [2025-04-13 19:32:34,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:32:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:34,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:32:34,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:32:34,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:34,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:34,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:34,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074644370] [2025-04-13 19:32:34,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074644370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:34,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:34,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:32:34,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667088323] [2025-04-13 19:32:34,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:34,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:32:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:34,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:32:34,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:32:34,410 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2025-04-13 19:32:34,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-13 19:32:34,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:34,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2025-04-13 19:32:34,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:34,655 INFO L116 PetriNetUnfolderBase]: 1035/1791 cut-off events. [2025-04-13 19:32:34,656 INFO L117 PetriNetUnfolderBase]: For 1046/1076 co-relation queries the response was YES. [2025-04-13 19:32:34,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 1791 events. 1035/1791 cut-off events. For 1046/1076 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10790 event pairs, 209 based on Foata normal form. 75/1747 useless extension candidates. Maximal degree in co-relation 4068. Up to 1171 conditions per place. [2025-04-13 19:32:34,667 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 26 selfloop transitions, 3 changer transitions 15/60 dead transitions. [2025-04-13 19:32:34,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 261 flow [2025-04-13 19:32:34,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:32:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:32:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-04-13 19:32:34,668 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 19:32:34,668 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 119 flow. Second operand 5 states and 130 transitions. [2025-04-13 19:32:34,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 261 flow [2025-04-13 19:32:34,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 251 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:32:34,672 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 124 flow [2025-04-13 19:32:34,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2025-04-13 19:32:34,672 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2025-04-13 19:32:34,673 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 124 flow [2025-04-13 19:32:34,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-13 19:32:34,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:34,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:32:34,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:32:34,673 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:34,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -551287453, now seen corresponding path program 1 times [2025-04-13 19:32:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:34,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874899863] [2025-04-13 19:32:34,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:32:34,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:34,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:32:34,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:32:34,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:34,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:34,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874899863] [2025-04-13 19:32:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874899863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:34,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:34,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:32:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351881295] [2025-04-13 19:32:34,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:34,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:32:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:34,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:32:34,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:32:34,783 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2025-04-13 19:32:34,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-13 19:32:34,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:34,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2025-04-13 19:32:34,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:35,073 INFO L116 PetriNetUnfolderBase]: 1678/2722 cut-off events. [2025-04-13 19:32:35,074 INFO L117 PetriNetUnfolderBase]: For 979/1013 co-relation queries the response was YES. [2025-04-13 19:32:35,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6056 conditions, 2722 events. 1678/2722 cut-off events. For 979/1013 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 15969 event pairs, 259 based on Foata normal form. 141/2721 useless extension candidates. Maximal degree in co-relation 6039. Up to 1314 conditions per place. [2025-04-13 19:32:35,087 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 42 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-04-13 19:32:35,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 272 flow [2025-04-13 19:32:35,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:32:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:32:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-13 19:32:35,090 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2025-04-13 19:32:35,090 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 124 flow. Second operand 4 states and 109 transitions. [2025-04-13 19:32:35,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 272 flow [2025-04-13 19:32:35,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 262 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:32:35,100 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 152 flow [2025-04-13 19:32:35,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2025-04-13 19:32:35,101 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2025-04-13 19:32:35,101 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 152 flow [2025-04-13 19:32:35,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-13 19:32:35,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:35,101 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] [2025-04-13 19:32:35,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:32:35,101 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:35,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2017461643, now seen corresponding path program 1 times [2025-04-13 19:32:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:35,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716812782] [2025-04-13 19:32:35,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:32:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:35,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:32:35,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:32:35,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:35,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:35,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716812782] [2025-04-13 19:32:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716812782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:35,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:32:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561181593] [2025-04-13 19:32:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:35,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:32:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:35,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:32:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:32:35,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2025-04-13 19:32:35,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:35,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:35,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2025-04-13 19:32:35,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:35,581 INFO L116 PetriNetUnfolderBase]: 1290/2154 cut-off events. [2025-04-13 19:32:35,582 INFO L117 PetriNetUnfolderBase]: For 807/817 co-relation queries the response was YES. [2025-04-13 19:32:35,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 2154 events. 1290/2154 cut-off events. For 807/817 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11976 event pairs, 200 based on Foata normal form. 110/2128 useless extension candidates. Maximal degree in co-relation 5326. Up to 674 conditions per place. [2025-04-13 19:32:35,590 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 54 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2025-04-13 19:32:35,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 369 flow [2025-04-13 19:32:35,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:32:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:32:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-04-13 19:32:35,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7128205128205128 [2025-04-13 19:32:35,591 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 152 flow. Second operand 5 states and 139 transitions. [2025-04-13 19:32:35,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 369 flow [2025-04-13 19:32:35,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:32:35,596 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 204 flow [2025-04-13 19:32:35,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-04-13 19:32:35,597 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2025-04-13 19:32:35,597 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 204 flow [2025-04-13 19:32:35,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:35,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:35,597 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] [2025-04-13 19:32:35,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:32:35,598 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:35,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1244536733, now seen corresponding path program 1 times [2025-04-13 19:32:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:35,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821792092] [2025-04-13 19:32:35,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:32:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:35,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 19:32:35,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:32:35,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:35,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:35,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821792092] [2025-04-13 19:32:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821792092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:35,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:35,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:32:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994978496] [2025-04-13 19:32:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:35,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:32:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:35,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:32:35,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:32:35,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2025-04-13 19:32:35,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:35,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:35,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2025-04-13 19:32:35,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:36,114 INFO L116 PetriNetUnfolderBase]: 1062/1782 cut-off events. [2025-04-13 19:32:36,115 INFO L117 PetriNetUnfolderBase]: For 1908/1910 co-relation queries the response was YES. [2025-04-13 19:32:36,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4922 conditions, 1782 events. 1062/1782 cut-off events. For 1908/1910 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9672 event pairs, 200 based on Foata normal form. 48/1693 useless extension candidates. Maximal degree in co-relation 4902. Up to 674 conditions per place. [2025-04-13 19:32:36,123 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 48 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2025-04-13 19:32:36,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 391 flow [2025-04-13 19:32:36,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:32:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:32:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2025-04-13 19:32:36,126 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6452991452991453 [2025-04-13 19:32:36,126 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 204 flow. Second operand 6 states and 151 transitions. [2025-04-13 19:32:36,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 391 flow [2025-04-13 19:32:36,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 364 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 19:32:36,130 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 222 flow [2025-04-13 19:32:36,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2025-04-13 19:32:36,131 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2025-04-13 19:32:36,132 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 222 flow [2025-04-13 19:32:36,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:36,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:36,132 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] [2025-04-13 19:32:36,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:32:36,132 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:36,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1207710995, now seen corresponding path program 1 times [2025-04-13 19:32:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:36,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238134856] [2025-04-13 19:32:36,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:32:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:36,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:32:36,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:32:36,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:36,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:36,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238134856] [2025-04-13 19:32:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238134856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:36,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:36,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:32:36,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497120787] [2025-04-13 19:32:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:36,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:32:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:36,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:32:36,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:32:36,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2025-04-13 19:32:36,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:36,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:36,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2025-04-13 19:32:36,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:37,354 INFO L116 PetriNetUnfolderBase]: 1061/2175 cut-off events. [2025-04-13 19:32:37,354 INFO L117 PetriNetUnfolderBase]: For 2936/3189 co-relation queries the response was YES. [2025-04-13 19:32:37,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5946 conditions, 2175 events. 1061/2175 cut-off events. For 2936/3189 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15884 event pairs, 323 based on Foata normal form. 38/1947 useless extension candidates. Maximal degree in co-relation 5926. Up to 664 conditions per place. [2025-04-13 19:32:37,369 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 47 selfloop transitions, 7 changer transitions 10/91 dead transitions. [2025-04-13 19:32:37,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 474 flow [2025-04-13 19:32:37,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:32:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:32:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-04-13 19:32:37,371 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6698717948717948 [2025-04-13 19:32:37,371 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 222 flow. Second operand 8 states and 209 transitions. [2025-04-13 19:32:37,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 474 flow [2025-04-13 19:32:37,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 444 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-04-13 19:32:37,383 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 246 flow [2025-04-13 19:32:37,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=246, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2025-04-13 19:32:37,383 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2025-04-13 19:32:37,383 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 246 flow [2025-04-13 19:32:37,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:37,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:37,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:32:37,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:32:37,384 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:37,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:37,384 INFO L85 PathProgramCache]: Analyzing trace with hash -277097899, now seen corresponding path program 2 times [2025-04-13 19:32:37,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:37,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128437509] [2025-04-13 19:32:37,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:32:37,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:37,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:32:37,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:32:37,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:32:37,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:32:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:32:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:32:37,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128437509] [2025-04-13 19:32:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128437509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:32:37,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:32:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:32:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188944858] [2025-04-13 19:32:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:32:37,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:32:37,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:32:37,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:32:37,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:32:37,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2025-04-13 19:32:37,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:37,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:32:37,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2025-04-13 19:32:37,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:32:38,113 INFO L116 PetriNetUnfolderBase]: 2788/5225 cut-off events. [2025-04-13 19:32:38,113 INFO L117 PetriNetUnfolderBase]: For 4584/5121 co-relation queries the response was YES. [2025-04-13 19:32:38,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14380 conditions, 5225 events. 2788/5225 cut-off events. For 4584/5121 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 40841 event pairs, 355 based on Foata normal form. 107/4835 useless extension candidates. Maximal degree in co-relation 14355. Up to 2112 conditions per place. [2025-04-13 19:32:38,131 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 42 selfloop transitions, 4 changer transitions 33/98 dead transitions. [2025-04-13 19:32:38,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 98 transitions, 586 flow [2025-04-13 19:32:38,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:32:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:32:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-04-13 19:32:38,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-04-13 19:32:38,132 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 246 flow. Second operand 7 states and 156 transitions. [2025-04-13 19:32:38,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 98 transitions, 586 flow [2025-04-13 19:32:38,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 98 transitions, 572 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-13 19:32:38,156 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 243 flow [2025-04-13 19:32:38,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-04-13 19:32:38,157 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2025-04-13 19:32:38,157 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 243 flow [2025-04-13 19:32:38,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:32:38,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:32:38,157 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] [2025-04-13 19:32:38,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:32:38,157 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:32:38,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:32:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash -700554989, now seen corresponding path program 3 times [2025-04-13 19:32:38,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:32:38,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980782817] [2025-04-13 19:32:38,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:32:38,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:32:38,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:32:38,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:32:38,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:32:38,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:32:38,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:32:38,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:32:38,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:32:38,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:32:38,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:32:38,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:32:38,285 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:32:38,286 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 19:32:38,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:32:38,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 19:32:38,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 19:32:38,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 19:32:38,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:32:38,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:32:38,287 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:32:38,365 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:32:38,366 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:32:38,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:32:38 BasicIcfg [2025-04-13 19:32:38,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:32:38,372 INFO L158 Benchmark]: Toolchain (without parser) took 7462.81ms. Allocated memory was 125.8MB in the beginning and 448.8MB in the end (delta: 323.0MB). Free memory was 85.4MB in the beginning and 275.0MB in the end (delta: -189.6MB). Peak memory consumption was 131.8MB. Max. memory is 8.0GB. [2025-04-13 19:32:38,372 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:32:38,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.14ms. Allocated memory is still 125.8MB. Free memory was 85.4MB in the beginning and 58.7MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:32:38,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.75ms. Allocated memory is still 125.8MB. Free memory was 58.7MB in the beginning and 55.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:32:38,373 INFO L158 Benchmark]: Boogie Preprocessor took 52.55ms. Allocated memory is still 125.8MB. Free memory was 55.6MB in the beginning and 52.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:32:38,373 INFO L158 Benchmark]: RCFGBuilder took 612.75ms. Allocated memory is still 125.8MB. Free memory was 52.2MB in the beginning and 47.0MB in the end (delta: 5.2MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2025-04-13 19:32:38,373 INFO L158 Benchmark]: TraceAbstraction took 6336.60ms. Allocated memory was 125.8MB in the beginning and 448.8MB in the end (delta: 323.0MB). Free memory was 46.3MB in the beginning and 275.0MB in the end (delta: -228.7MB). Peak memory consumption was 91.4MB. Max. memory is 8.0GB. [2025-04-13 19:32:38,375 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.14ms. Allocated memory is still 125.8MB. Free memory was 85.4MB in the beginning and 58.7MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.75ms. Allocated memory is still 125.8MB. Free memory was 58.7MB in the beginning and 55.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.55ms. Allocated memory is still 125.8MB. Free memory was 55.6MB in the beginning and 52.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 612.75ms. Allocated memory is still 125.8MB. Free memory was 52.2MB in the beginning and 47.0MB in the end (delta: 5.2MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6336.60ms. Allocated memory was 125.8MB in the beginning and 448.8MB in the end (delta: 323.0MB). Free memory was 46.3MB in the beginning and 275.0MB in the end (delta: -228.7MB). Peak memory consumption was 91.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t849; [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; [L858] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, t850=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t851; [L860] FCALL, FORK 0 pthread_create(&t851, ((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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, t850=-1, t851=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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EBX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L811] 3 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 860]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 69 locations, 65 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 890 IncrementalHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 21 mSDtfsCounter, 890 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=8, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 1162 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-13 19:32:38,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...