/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:00:59,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:00:59,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:00:59,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:00:59,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:00:59,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:00:59,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:00:59,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:00:59,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:00:59,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:00:59,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:00:59,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:00:59,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:00:59,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:00:59,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:00:59,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:00:59,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:00:59,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:00:59,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:00:59,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:00:59,757 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:01:00,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:01:00,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:01:00,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:01:00,043 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:01:00,044 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:01:00,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2025-04-14 00:01:01,564 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41897e889/b36fea2ab5ef4e19b1a3eb9ecc0bd956/FLAG8300fb850 [2025-04-14 00:01:01,950 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:01:01,951 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2025-04-14 00:01:01,968 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41897e889/b36fea2ab5ef4e19b1a3eb9ecc0bd956/FLAG8300fb850 [2025-04-14 00:01:02,630 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41897e889/b36fea2ab5ef4e19b1a3eb9ecc0bd956 [2025-04-14 00:01:02,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:01:02,635 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:01:02,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:01:02,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:01:02,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:01:02,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:01:02" (1/1) ... [2025-04-14 00:01:02,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e553fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:02, skipping insertion in model container [2025-04-14 00:01:02,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:01:02" (1/1) ... [2025-04-14 00:01:02,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:01:03,035 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/mix020.opt.i[944,957] [2025-04-14 00:01:03,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:01:03,298 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:01:03,338 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/mix020.opt.i[944,957] [2025-04-14 00:01:03,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:01:03,529 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:01:03,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03 WrapperNode [2025-04-14 00:01:03,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:01:03,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:01:03,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:01:03,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:01:03,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,679 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2025-04-14 00:01:03,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:01:03,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:01:03,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:01:03,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:01:03,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:01:03,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:01:03,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:01:03,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:01:03,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:01:03,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (1/1) ... [2025-04-14 00:01:03,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:01:03,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:01:03,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:01:03,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:01:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:01:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:01:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:01:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:01:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:01:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:01:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:01:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:01:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-14 00:01:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-14 00:01:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:01:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:01:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:01:03,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:01:03,907 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:01:04,126 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:01:04,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:01:04,608 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:01:04,609 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:01:04,609 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:01:05,155 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:01:05,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:01:05 BoogieIcfgContainer [2025-04-14 00:01:05,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:01:05,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:01:05,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:01:05,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:01:05,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:01:02" (1/3) ... [2025-04-14 00:01:05,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29988ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:01:05, skipping insertion in model container [2025-04-14 00:01:05,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:01:03" (2/3) ... [2025-04-14 00:01:05,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29988ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:01:05, skipping insertion in model container [2025-04-14 00:01:05,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:01:05" (3/3) ... [2025-04-14 00:01:05,164 INFO L128 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2025-04-14 00:01:05,188 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:01:05,189 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix020.opt.i that has 5 procedures, 46 locations, 41 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:01:05,189 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:01:05,324 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:01:05,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 106 flow [2025-04-14 00:01:05,448 INFO L116 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-04-14 00:01:05,450 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:01:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:01:05,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 106 flow [2025-04-14 00:01:05,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 94 flow [2025-04-14 00:01:05,481 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:01:05,508 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;@6d77e75b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:01:05,508 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-14 00:01:05,522 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:01:05,522 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-14 00:01:05,522 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:01:05,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:05,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:05,528 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:05,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash 209339563, now seen corresponding path program 1 times [2025-04-14 00:01:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:05,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974932299] [2025-04-14 00:01:05,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:05,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 00:01:05,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 00:01:05,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:05,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:06,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:06,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974932299] [2025-04-14 00:01:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974932299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:06,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:01:06,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818301873] [2025-04-14 00:01:06,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:06,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:01:06,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:06,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:01:06,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:01:06,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:06,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:06,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:06,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:06,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:10,558 INFO L116 PetriNetUnfolderBase]: 40307/52979 cut-off events. [2025-04-14 00:01:10,559 INFO L117 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-04-14 00:01:10,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106423 conditions, 52979 events. 40307/52979 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 1599. Compared 295526 event pairs, 5315 based on Foata normal form. 0/51424 useless extension candidates. Maximal degree in co-relation 106411. Up to 45361 conditions per place. [2025-04-14 00:01:10,947 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 54 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2025-04-14 00:01:10,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 252 flow [2025-04-14 00:01:10,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:01:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:01:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-04-14 00:01:10,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2025-04-14 00:01:10,960 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 3 states and 83 transitions. [2025-04-14 00:01:10,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 252 flow [2025-04-14 00:01:10,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:01:10,974 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 90 flow [2025-04-14 00:01:10,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-04-14 00:01:10,979 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-04-14 00:01:10,980 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 90 flow [2025-04-14 00:01:10,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:10,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:10,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:10,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:01:10,981 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:10,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1310851562, now seen corresponding path program 1 times [2025-04-14 00:01:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:10,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584718718] [2025-04-14 00:01:10,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:10,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:01:11,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:01:11,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:11,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:11,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584718718] [2025-04-14 00:01:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584718718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:01:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150701647] [2025-04-14 00:01:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:11,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:01:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:11,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:01:11,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:01:11,220 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:11,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:11,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:11,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:11,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:14,164 INFO L116 PetriNetUnfolderBase]: 32715/43771 cut-off events. [2025-04-14 00:01:14,164 INFO L117 PetriNetUnfolderBase]: For 1408/1408 co-relation queries the response was YES. [2025-04-14 00:01:14,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89429 conditions, 43771 events. 32715/43771 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 1430. Compared 253511 event pairs, 4407 based on Foata normal form. 1512/45260 useless extension candidates. Maximal degree in co-relation 89419. Up to 24941 conditions per place. [2025-04-14 00:01:14,512 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 74 selfloop transitions, 6 changer transitions 1/85 dead transitions. [2025-04-14 00:01:14,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 354 flow [2025-04-14 00:01:14,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:01:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:01:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-04-14 00:01:14,522 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-04-14 00:01:14,522 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 4 states and 115 transitions. [2025-04-14 00:01:14,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 354 flow [2025-04-14 00:01:14,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:01:14,557 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 128 flow [2025-04-14 00:01:14,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-04-14 00:01:14,558 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-04-14 00:01:14,558 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 128 flow [2025-04-14 00:01:14,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:14,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:14,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:14,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:01:14,563 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:14,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash -19661686, now seen corresponding path program 1 times [2025-04-14 00:01:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:14,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37771395] [2025-04-14 00:01:14,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:14,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:01:14,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:01:14,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:14,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:15,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:15,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37771395] [2025-04-14 00:01:15,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37771395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:15,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:15,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:01:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815845640] [2025-04-14 00:01:15,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:15,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:01:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:15,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:01:15,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:01:15,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:15,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:15,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:15,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:15,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:18,186 INFO L116 PetriNetUnfolderBase]: 21403/29099 cut-off events. [2025-04-14 00:01:18,187 INFO L117 PetriNetUnfolderBase]: For 6132/6132 co-relation queries the response was YES. [2025-04-14 00:01:18,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66987 conditions, 29099 events. 21403/29099 cut-off events. For 6132/6132 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 162683 event pairs, 2563 based on Foata normal form. 1192/30268 useless extension candidates. Maximal degree in co-relation 66975. Up to 11261 conditions per place. [2025-04-14 00:01:18,334 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 96 selfloop transitions, 10 changer transitions 1/111 dead transitions. [2025-04-14 00:01:18,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 507 flow [2025-04-14 00:01:18,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:01:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:01:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-04-14 00:01:18,336 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2025-04-14 00:01:18,336 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 128 flow. Second operand 5 states and 149 transitions. [2025-04-14 00:01:18,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 507 flow [2025-04-14 00:01:18,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 496 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:01:18,346 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 180 flow [2025-04-14 00:01:18,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-04-14 00:01:18,346 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-04-14 00:01:18,347 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 180 flow [2025-04-14 00:01:18,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:18,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:18,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:18,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:01:18,347 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:18,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1084258336, now seen corresponding path program 1 times [2025-04-14 00:01:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:18,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002206631] [2025-04-14 00:01:18,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:18,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:01:18,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:01:18,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:18,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:18,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002206631] [2025-04-14 00:01:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002206631] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:01:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156674703] [2025-04-14 00:01:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:18,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:01:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:18,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:01:18,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:01:18,632 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:18,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:18,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:18,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:18,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:20,553 INFO L116 PetriNetUnfolderBase]: 13227/18155 cut-off events. [2025-04-14 00:01:20,554 INFO L117 PetriNetUnfolderBase]: For 11662/11662 co-relation queries the response was YES. [2025-04-14 00:01:20,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45271 conditions, 18155 events. 13227/18155 cut-off events. For 11662/11662 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 96188 event pairs, 2215 based on Foata normal form. 584/18716 useless extension candidates. Maximal degree in co-relation 45257. Up to 5388 conditions per place. [2025-04-14 00:01:20,633 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 116 selfloop transitions, 14 changer transitions 1/135 dead transitions. [2025-04-14 00:01:20,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 135 transitions, 666 flow [2025-04-14 00:01:20,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:01:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:01:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-04-14 00:01:20,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6703703703703704 [2025-04-14 00:01:20,638 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 180 flow. Second operand 6 states and 181 transitions. [2025-04-14 00:01:20,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 135 transitions, 666 flow [2025-04-14 00:01:20,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 135 transitions, 636 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-14 00:01:20,796 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 230 flow [2025-04-14 00:01:20,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-04-14 00:01:20,798 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-04-14 00:01:20,799 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 230 flow [2025-04-14 00:01:20,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:20,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:20,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:20,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:01:20,799 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:20,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash -264023036, now seen corresponding path program 1 times [2025-04-14 00:01:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:20,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174040978] [2025-04-14 00:01:20,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:20,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:01:20,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:01:20,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:20,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:21,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:21,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174040978] [2025-04-14 00:01:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174040978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:21,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:21,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:01:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335028888] [2025-04-14 00:01:21,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:21,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:01:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:21,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:01:21,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:01:21,102 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:21,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:21,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:21,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:21,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:22,777 INFO L116 PetriNetUnfolderBase]: 10367/14183 cut-off events. [2025-04-14 00:01:22,777 INFO L117 PetriNetUnfolderBase]: For 11350/11350 co-relation queries the response was YES. [2025-04-14 00:01:22,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36304 conditions, 14183 events. 10367/14183 cut-off events. For 11350/11350 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 73550 event pairs, 2043 based on Foata normal form. 152/14312 useless extension candidates. Maximal degree in co-relation 36289. Up to 5376 conditions per place. [2025-04-14 00:01:22,832 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 100 selfloop transitions, 18 changer transitions 1/123 dead transitions. [2025-04-14 00:01:22,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 123 transitions, 628 flow [2025-04-14 00:01:22,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:01:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:01:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-04-14 00:01:22,836 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2025-04-14 00:01:22,836 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 230 flow. Second operand 7 states and 177 transitions. [2025-04-14 00:01:22,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 123 transitions, 628 flow [2025-04-14 00:01:22,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 123 transitions, 582 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-04-14 00:01:22,987 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 240 flow [2025-04-14 00:01:22,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2025-04-14 00:01:22,988 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-04-14 00:01:22,988 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 240 flow [2025-04-14 00:01:22,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:22,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:22,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:22,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:01:22,990 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:22,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1956490072, now seen corresponding path program 1 times [2025-04-14 00:01:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:22,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662899576] [2025-04-14 00:01:22,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:23,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:01:23,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:01:23,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:23,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:23,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:23,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662899576] [2025-04-14 00:01:23,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662899576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:23,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:23,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:01:23,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860895116] [2025-04-14 00:01:23,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:23,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:01:23,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:23,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:01:23,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:01:23,697 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:23,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:23,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:23,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:23,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:25,429 INFO L116 PetriNetUnfolderBase]: 15315/20931 cut-off events. [2025-04-14 00:01:25,429 INFO L117 PetriNetUnfolderBase]: For 16416/16416 co-relation queries the response was YES. [2025-04-14 00:01:25,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53929 conditions, 20931 events. 15315/20931 cut-off events. For 16416/16416 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 114768 event pairs, 3179 based on Foata normal form. 16/20947 useless extension candidates. Maximal degree in co-relation 53913. Up to 11737 conditions per place. [2025-04-14 00:01:25,629 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 79 selfloop transitions, 6 changer transitions 20/109 dead transitions. [2025-04-14 00:01:25,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 109 transitions, 702 flow [2025-04-14 00:01:25,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:01:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:01:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-04-14 00:01:25,630 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5422222222222223 [2025-04-14 00:01:25,630 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 240 flow. Second operand 5 states and 122 transitions. [2025-04-14 00:01:25,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 109 transitions, 702 flow [2025-04-14 00:01:25,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 109 transitions, 513 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-04-14 00:01:25,811 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 177 flow [2025-04-14 00:01:25,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2025-04-14 00:01:25,814 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-04-14 00:01:25,814 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 177 flow [2025-04-14 00:01:25,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:25,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:25,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:25,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:01:25,815 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:25,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -250693302, now seen corresponding path program 2 times [2025-04-14 00:01:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:25,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782252449] [2025-04-14 00:01:25,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:01:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:25,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:01:25,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:01:25,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:01:25,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:26,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:26,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782252449] [2025-04-14 00:01:26,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782252449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:26,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:26,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:01:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824936872] [2025-04-14 00:01:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:26,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:01:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:26,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:01:26,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:01:26,531 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:26,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:26,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:26,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:26,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:28,065 INFO L116 PetriNetUnfolderBase]: 12069/16681 cut-off events. [2025-04-14 00:01:28,065 INFO L117 PetriNetUnfolderBase]: For 3823/3823 co-relation queries the response was YES. [2025-04-14 00:01:28,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40133 conditions, 16681 events. 12069/16681 cut-off events. For 3823/3823 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 86744 event pairs, 2255 based on Foata normal form. 16/16697 useless extension candidates. Maximal degree in co-relation 40119. Up to 8666 conditions per place. [2025-04-14 00:01:28,173 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 90 selfloop transitions, 8 changer transitions 51/153 dead transitions. [2025-04-14 00:01:28,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 153 transitions, 777 flow [2025-04-14 00:01:28,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:01:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:01:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2025-04-14 00:01:28,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.546031746031746 [2025-04-14 00:01:28,175 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 177 flow. Second operand 7 states and 172 transitions. [2025-04-14 00:01:28,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 153 transitions, 777 flow [2025-04-14 00:01:28,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 153 transitions, 765 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 00:01:28,182 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 214 flow [2025-04-14 00:01:28,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-04-14 00:01:28,183 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2025-04-14 00:01:28,183 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 214 flow [2025-04-14 00:01:28,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:28,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:28,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:28,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:01:28,183 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:28,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash 432309666, now seen corresponding path program 3 times [2025-04-14 00:01:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:28,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871612788] [2025-04-14 00:01:28,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:01:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:28,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:01:28,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:01:28,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:01:28,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:28,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:28,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871612788] [2025-04-14 00:01:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871612788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:28,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:01:28,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677084388] [2025-04-14 00:01:28,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:28,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:01:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:28,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:01:28,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:01:28,738 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:28,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:28,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:28,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:28,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:30,295 INFO L116 PetriNetUnfolderBase]: 13516/18987 cut-off events. [2025-04-14 00:01:30,296 INFO L117 PetriNetUnfolderBase]: For 10058/10058 co-relation queries the response was YES. [2025-04-14 00:01:30,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47820 conditions, 18987 events. 13516/18987 cut-off events. For 10058/10058 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 104875 event pairs, 2782 based on Foata normal form. 32/19019 useless extension candidates. Maximal degree in co-relation 47802. Up to 5739 conditions per place. [2025-04-14 00:01:30,388 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 3 changer transitions 160/216 dead transitions. [2025-04-14 00:01:30,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 216 transitions, 1239 flow [2025-04-14 00:01:30,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:01:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:01:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2025-04-14 00:01:30,390 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2025-04-14 00:01:30,390 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 214 flow. Second operand 10 states and 226 transitions. [2025-04-14 00:01:30,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 216 transitions, 1239 flow [2025-04-14 00:01:30,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 216 transitions, 1173 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-14 00:01:30,402 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 187 flow [2025-04-14 00:01:30,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=187, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2025-04-14 00:01:30,402 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2025-04-14 00:01:30,402 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 187 flow [2025-04-14 00:01:30,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:30,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:30,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:30,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:01:30,403 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:30,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 819591644, now seen corresponding path program 4 times [2025-04-14 00:01:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:30,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597487062] [2025-04-14 00:01:30,404 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:01:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:30,435 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-14 00:01:30,555 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:01:30,555 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:01:30,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:32,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597487062] [2025-04-14 00:01:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597487062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:32,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:01:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417783977] [2025-04-14 00:01:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:32,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:01:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:32,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:01:32,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:01:32,446 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-14 00:01:32,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:32,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:32,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-14 00:01:32,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:33,271 INFO L116 PetriNetUnfolderBase]: 5288/7585 cut-off events. [2025-04-14 00:01:33,271 INFO L117 PetriNetUnfolderBase]: For 3862/3862 co-relation queries the response was YES. [2025-04-14 00:01:33,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17984 conditions, 7585 events. 5288/7585 cut-off events. For 3862/3862 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 38512 event pairs, 1064 based on Foata normal form. 16/7601 useless extension candidates. Maximal degree in co-relation 17962. Up to 3426 conditions per place. [2025-04-14 00:01:33,296 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 64 selfloop transitions, 5 changer transitions 44/117 dead transitions. [2025-04-14 00:01:33,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 117 transitions, 625 flow [2025-04-14 00:01:33,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:01:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:01:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2025-04-14 00:01:33,298 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2025-04-14 00:01:33,298 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 187 flow. Second operand 9 states and 156 transitions. [2025-04-14 00:01:33,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 117 transitions, 625 flow [2025-04-14 00:01:33,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 117 transitions, 603 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-14 00:01:33,303 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 189 flow [2025-04-14 00:01:33,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-04-14 00:01:33,304 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2025-04-14 00:01:33,304 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 189 flow [2025-04-14 00:01:33,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:33,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:33,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:33,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:01:33,304 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:01:33,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1142859476, now seen corresponding path program 5 times [2025-04-14 00:01:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:33,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420739332] [2025-04-14 00:01:33,305 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:01:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:33,319 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:01:33,364 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:01:33,364 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:01:33,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:01:33,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:01:33,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:01:33,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:01:33,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:33,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:01:33,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:01:33,450 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:01:33,451 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-14 00:01:33,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-14 00:01:33,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-14 00:01:33,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-14 00:01:33,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-14 00:01:33,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-14 00:01:33,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-14 00:01:33,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:01:33,453 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-04-14 00:01:33,562 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:01:33,562 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:01:33,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:01:33 BasicIcfg [2025-04-14 00:01:33,572 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:01:33,576 INFO L158 Benchmark]: Toolchain (without parser) took 30940.49ms. Allocated memory was 125.8MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 85.1MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-14 00:01:33,580 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:01:33,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 902.14ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 57.3MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:01:33,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.21ms. Allocated memory is still 125.8MB. Free memory was 57.3MB in the beginning and 54.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:01:33,581 INFO L158 Benchmark]: Boogie Preprocessor took 121.65ms. Allocated memory is still 125.8MB. Free memory was 54.3MB in the beginning and 51.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:01:33,581 INFO L158 Benchmark]: IcfgBuilder took 1353.58ms. Allocated memory is still 125.8MB. Free memory was 51.0MB in the beginning and 30.8MB in the end (delta: 20.1MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. [2025-04-14 00:01:33,581 INFO L158 Benchmark]: TraceAbstraction took 28414.80ms. Allocated memory was 125.8MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 30.8MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-14 00:01:33,582 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 902.14ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 57.3MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 140.21ms. Allocated memory is still 125.8MB. Free memory was 57.3MB in the beginning and 54.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 121.65ms. Allocated memory is still 125.8MB. Free memory was 54.3MB in the beginning and 51.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 1353.58ms. Allocated memory is still 125.8MB. Free memory was 51.0MB in the beginning and 30.8MB in the end (delta: 20.1MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. * TraceAbstraction took 28414.80ms. Allocated memory was 125.8MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 30.8MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t525=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t525=-3, t526=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t525=-3, t526=-2, t527=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t525=-3, t526=-2, t527=-1, t528=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525=-3, t526=-2, t527=-1, t528=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525=-3, t526=-2, t527=-1, t528=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525=-3, t526=-2, t527=-1, t528=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 80 locations, 75 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 896 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 896 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1772 IncrementalHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 0 mSDtfsCounter, 1772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=5, InterpolantAutomatonStates: 56, 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.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-14 00:01:33,611 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...