/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:40:13,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:40:13,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:40:13,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:40:13,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:40:13,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:40:13,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:40:13,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:40:13,485 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:40:13,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:40:13,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:40:13,489 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:40:13,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:40:13,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:40:13,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:40:13,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:40:13,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:40:13,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:40:13,492 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:40:13,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:40:13,492 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:40:13,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:40:13,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:40:13,494 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:40:13,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:40:13,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:40:13,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:40:13,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:40:13,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:40:13,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:40:13,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:40:13,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:40:13,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:40:13,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-10 11:40:13,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:40:13,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:40:13,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:40:13,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:40:13,779 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:40:13,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-10 11:40:14,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:40:15,175 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:40:15,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-10 11:40:15,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012047090/cd744d6a4616497abb356a3a9d907e7e/FLAG5340516d8 [2023-11-10 11:40:15,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012047090/cd744d6a4616497abb356a3a9d907e7e [2023-11-10 11:40:15,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:40:15,211 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:40:15,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:40:15,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:40:15,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:40:15,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2596b2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15, skipping insertion in model container [2023-11-10 11:40:15,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,278 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:40:15,449 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-11-10 11:40:15,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:40:15,652 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:40:15,661 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-11-10 11:40:15,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:40:15,728 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:40:15,728 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:40:15,735 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:40:15,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15 WrapperNode [2023-11-10 11:40:15,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:40:15,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:40:15,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:40:15,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:40:15,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,779 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2023-11-10 11:40:15,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:40:15,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:40:15,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:40:15,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:40:15,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:40:15,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:40:15,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:40:15,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:40:15,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (1/1) ... [2023-11-10 11:40:15,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:40:15,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:40:15,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:40:15,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:40:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:40:15,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:40:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:40:15,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:40:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-10 11:40:15,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-10 11:40:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:40:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:40:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:40:15,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:40:15,906 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:40:16,087 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:40:16,091 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:40:16,459 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:40:16,573 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:40:16,574 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:40:16,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:40:16 BoogieIcfgContainer [2023-11-10 11:40:16,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:40:16,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:40:16,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:40:16,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:40:16,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:40:15" (1/3) ... [2023-11-10 11:40:16,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ee5a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:40:16, skipping insertion in model container [2023-11-10 11:40:16,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:15" (2/3) ... [2023-11-10 11:40:16,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ee5a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:40:16, skipping insertion in model container [2023-11-10 11:40:16,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:40:16" (3/3) ... [2023-11-10 11:40:16,585 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-10 11:40:16,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:40:16,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:40:16,598 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:40:16,719 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:40:16,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 248 flow [2023-11-10 11:40:16,825 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-11-10 11:40:16,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:40:16,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-10 11:40:16,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 118 transitions, 248 flow [2023-11-10 11:40:16,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 115 transitions, 239 flow [2023-11-10 11:40:16,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:40:16,853 INFO L357 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, mHoare=false, 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;@5cc7ce28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:40:16,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-10 11:40:16,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:40:16,867 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-11-10 11:40:16,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:40:16,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:16,868 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:16,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:16,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash -683655875, now seen corresponding path program 1 times [2023-11-10 11:40:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472348125] [2023-11-10 11:40:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:17,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472348125] [2023-11-10 11:40:17,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472348125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:17,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:40:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686120556] [2023-11-10 11:40:17,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:17,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:40:17,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:40:17,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:40:17,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 118 [2023-11-10 11:40:17,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-11-10 11:40:17,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:17,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 118 [2023-11-10 11:40:17,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:17,582 INFO L124 PetriNetUnfolderBase]: 58/306 cut-off events. [2023-11-10 11:40:17,582 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-10 11:40:17,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 306 events. 58/306 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1332 event pairs, 10 based on Foata normal form. 26/317 useless extension candidates. Maximal degree in co-relation 384. Up to 79 conditions per place. [2023-11-10 11:40:17,587 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 14 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2023-11-10 11:40:17,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 279 flow [2023-11-10 11:40:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:40:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:40:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-11-10 11:40:17,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9350282485875706 [2023-11-10 11:40:17,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-11-10 11:40:17,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-11-10 11:40:17,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:17,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-11-10 11:40:17,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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) [2023-11-10 11:40:17,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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) [2023-11-10 11:40:17,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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) [2023-11-10 11:40:17,614 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 239 flow. Second operand 3 states and 331 transitions. [2023-11-10 11:40:17,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 279 flow [2023-11-10 11:40:17,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 274 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-10 11:40:17,621 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2023-11-10 11:40:17,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2023-11-10 11:40:17,626 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2023-11-10 11:40:17,627 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2023-11-10 11:40:17,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-11-10 11:40:17,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:17,628 INFO L208 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, 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, 1, 1] [2023-11-10 11:40:17,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:40:17,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:17,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2626880, now seen corresponding path program 1 times [2023-11-10 11:40:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:17,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462413473] [2023-11-10 11:40:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:18,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:18,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462413473] [2023-11-10 11:40:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462413473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:18,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:18,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:40:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850188641] [2023-11-10 11:40:18,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:18,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:40:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:40:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:40:18,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 118 [2023-11-10 11:40:18,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 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) [2023-11-10 11:40:18,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:18,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 118 [2023-11-10 11:40:18,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:19,737 INFO L124 PetriNetUnfolderBase]: 4175/8676 cut-off events. [2023-11-10 11:40:19,737 INFO L125 PetriNetUnfolderBase]: For 371/371 co-relation queries the response was YES. [2023-11-10 11:40:19,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15321 conditions, 8676 events. 4175/8676 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 72328 event pairs, 851 based on Foata normal form. 0/8432 useless extension candidates. Maximal degree in co-relation 15266. Up to 2422 conditions per place. [2023-11-10 11:40:19,783 INFO L140 encePairwiseOnDemand]: 101/118 looper letters, 31 selfloop transitions, 11 changer transitions 89/203 dead transitions. [2023-11-10 11:40:19,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 203 transitions, 676 flow [2023-11-10 11:40:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:40:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:40:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2023-11-10 11:40:19,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8361581920903954 [2023-11-10 11:40:19,789 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2023-11-10 11:40:19,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2023-11-10 11:40:19,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:19,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2023-11-10 11:40:19,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 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) [2023-11-10 11:40:19,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 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) [2023-11-10 11:40:19,795 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 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) [2023-11-10 11:40:19,795 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 9 states and 888 transitions. [2023-11-10 11:40:19,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 203 transitions, 676 flow [2023-11-10 11:40:19,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 203 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:40:19,800 INFO L231 Difference]: Finished difference. Result has 133 places, 103 transitions, 318 flow [2023-11-10 11:40:19,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=133, PETRI_TRANSITIONS=103} [2023-11-10 11:40:19,801 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 11 predicate places. [2023-11-10 11:40:19,801 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 103 transitions, 318 flow [2023-11-10 11:40:19,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 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) [2023-11-10 11:40:19,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:19,802 INFO L208 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, 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, 1, 1, 1, 1] [2023-11-10 11:40:19,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:40:19,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:19,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1439888609, now seen corresponding path program 1 times [2023-11-10 11:40:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495343240] [2023-11-10 11:40:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:20,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495343240] [2023-11-10 11:40:20,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495343240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:20,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:20,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:40:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761846047] [2023-11-10 11:40:20,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:20,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:40:20,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:40:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:40:20,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 118 [2023-11-10 11:40:20,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 103 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 states have internal predecessors, (611), 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) [2023-11-10 11:40:20,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:20,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 118 [2023-11-10 11:40:20,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:21,191 INFO L124 PetriNetUnfolderBase]: 1972/3989 cut-off events. [2023-11-10 11:40:21,192 INFO L125 PetriNetUnfolderBase]: For 5053/5064 co-relation queries the response was YES. [2023-11-10 11:40:21,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11475 conditions, 3989 events. 1972/3989 cut-off events. For 5053/5064 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 28912 event pairs, 545 based on Foata normal form. 100/3966 useless extension candidates. Maximal degree in co-relation 11404. Up to 1109 conditions per place. [2023-11-10 11:40:21,218 INFO L140 encePairwiseOnDemand]: 107/118 looper letters, 43 selfloop transitions, 8 changer transitions 79/202 dead transitions. [2023-11-10 11:40:21,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 202 transitions, 1092 flow [2023-11-10 11:40:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:40:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:40:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1225 transitions. [2023-11-10 11:40:21,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7985658409387223 [2023-11-10 11:40:21,222 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1225 transitions. [2023-11-10 11:40:21,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1225 transitions. [2023-11-10 11:40:21,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:21,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1225 transitions. [2023-11-10 11:40:21,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.23076923076923) internal successors, (1225), 13 states have internal predecessors, (1225), 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) [2023-11-10 11:40:21,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2023-11-10 11:40:21,228 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2023-11-10 11:40:21,228 INFO L175 Difference]: Start difference. First operand has 133 places, 103 transitions, 318 flow. Second operand 13 states and 1225 transitions. [2023-11-10 11:40:21,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 202 transitions, 1092 flow [2023-11-10 11:40:21,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 202 transitions, 990 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-11-10 11:40:21,249 INFO L231 Difference]: Finished difference. Result has 136 places, 107 transitions, 384 flow [2023-11-10 11:40:21,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=384, PETRI_PLACES=136, PETRI_TRANSITIONS=107} [2023-11-10 11:40:21,250 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 14 predicate places. [2023-11-10 11:40:21,250 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 107 transitions, 384 flow [2023-11-10 11:40:21,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 states have internal predecessors, (611), 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) [2023-11-10 11:40:21,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:21,251 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:21,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:40:21,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:21,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1452969022, now seen corresponding path program 1 times [2023-11-10 11:40:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280518462] [2023-11-10 11:40:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280518462] [2023-11-10 11:40:21,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280518462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:21,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:21,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:40:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483320263] [2023-11-10 11:40:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:21,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:40:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:40:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:40:21,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 118 [2023-11-10 11:40:21,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 107 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 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) [2023-11-10 11:40:21,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:21,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 118 [2023-11-10 11:40:21,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:22,044 INFO L124 PetriNetUnfolderBase]: 996/2327 cut-off events. [2023-11-10 11:40:22,044 INFO L125 PetriNetUnfolderBase]: For 4704/4773 co-relation queries the response was YES. [2023-11-10 11:40:22,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6877 conditions, 2327 events. 996/2327 cut-off events. For 4704/4773 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16821 event pairs, 364 based on Foata normal form. 99/2290 useless extension candidates. Maximal degree in co-relation 6802. Up to 769 conditions per place. [2023-11-10 11:40:22,062 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 21 selfloop transitions, 4 changer transitions 34/145 dead transitions. [2023-11-10 11:40:22,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 145 transitions, 698 flow [2023-11-10 11:40:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:40:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:40:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2023-11-10 11:40:22,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8361581920903954 [2023-11-10 11:40:22,065 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2023-11-10 11:40:22,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2023-11-10 11:40:22,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:22,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2023-11-10 11:40:22,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 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) [2023-11-10 11:40:22,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 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) [2023-11-10 11:40:22,070 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 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) [2023-11-10 11:40:22,070 INFO L175 Difference]: Start difference. First operand has 136 places, 107 transitions, 384 flow. Second operand 9 states and 888 transitions. [2023-11-10 11:40:22,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 145 transitions, 698 flow [2023-11-10 11:40:22,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 145 transitions, 645 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-11-10 11:40:22,109 INFO L231 Difference]: Finished difference. Result has 135 places, 107 transitions, 381 flow [2023-11-10 11:40:22,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=381, PETRI_PLACES=135, PETRI_TRANSITIONS=107} [2023-11-10 11:40:22,110 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 13 predicate places. [2023-11-10 11:40:22,110 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 107 transitions, 381 flow [2023-11-10 11:40:22,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 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) [2023-11-10 11:40:22,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:22,111 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:22,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:40:22,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:22,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1859652660, now seen corresponding path program 1 times [2023-11-10 11:40:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773333961] [2023-11-10 11:40:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773333961] [2023-11-10 11:40:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773333961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:22,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:40:22,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220859103] [2023-11-10 11:40:22,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:22,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:40:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:40:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:40:22,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2023-11-10 11:40:22,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 107 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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) [2023-11-10 11:40:22,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:22,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2023-11-10 11:40:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:23,345 INFO L124 PetriNetUnfolderBase]: 3134/5993 cut-off events. [2023-11-10 11:40:23,346 INFO L125 PetriNetUnfolderBase]: For 6703/9435 co-relation queries the response was YES. [2023-11-10 11:40:23,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14243 conditions, 5993 events. 3134/5993 cut-off events. For 6703/9435 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 46985 event pairs, 232 based on Foata normal form. 66/5725 useless extension candidates. Maximal degree in co-relation 14166. Up to 1962 conditions per place. [2023-11-10 11:40:23,394 INFO L140 encePairwiseOnDemand]: 108/118 looper letters, 84 selfloop transitions, 17 changer transitions 4/188 dead transitions. [2023-11-10 11:40:23,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 188 transitions, 925 flow [2023-11-10 11:40:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:40:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:40:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1001 transitions. [2023-11-10 11:40:23,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8483050847457627 [2023-11-10 11:40:23,398 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1001 transitions. [2023-11-10 11:40:23,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1001 transitions. [2023-11-10 11:40:23,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:23,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1001 transitions. [2023-11-10 11:40:23,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.1) internal successors, (1001), 10 states have internal predecessors, (1001), 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) [2023-11-10 11:40:23,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 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) [2023-11-10 11:40:23,405 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 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) [2023-11-10 11:40:23,405 INFO L175 Difference]: Start difference. First operand has 135 places, 107 transitions, 381 flow. Second operand 10 states and 1001 transitions. [2023-11-10 11:40:23,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 188 transitions, 925 flow [2023-11-10 11:40:23,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 188 transitions, 847 flow, removed 35 selfloop flow, removed 14 redundant places. [2023-11-10 11:40:23,418 INFO L231 Difference]: Finished difference. Result has 130 places, 122 transitions, 465 flow [2023-11-10 11:40:23,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=465, PETRI_PLACES=130, PETRI_TRANSITIONS=122} [2023-11-10 11:40:23,421 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 8 predicate places. [2023-11-10 11:40:23,421 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 122 transitions, 465 flow [2023-11-10 11:40:23,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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) [2023-11-10 11:40:23,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:23,422 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:23,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:40:23,423 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:23,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash 146471660, now seen corresponding path program 1 times [2023-11-10 11:40:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:23,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095750380] [2023-11-10 11:40:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095750380] [2023-11-10 11:40:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095750380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:23,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:40:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988986604] [2023-11-10 11:40:23,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:23,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:40:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:23,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:40:23,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:40:23,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2023-11-10 11:40:23,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 122 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2023-11-10 11:40:23,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:23,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2023-11-10 11:40:23,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:24,718 INFO L124 PetriNetUnfolderBase]: 2624/5414 cut-off events. [2023-11-10 11:40:24,718 INFO L125 PetriNetUnfolderBase]: For 7851/9999 co-relation queries the response was YES. [2023-11-10 11:40:24,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 5414 events. 2624/5414 cut-off events. For 7851/9999 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 45348 event pairs, 169 based on Foata normal form. 153/5360 useless extension candidates. Maximal degree in co-relation 16179. Up to 875 conditions per place. [2023-11-10 11:40:24,762 INFO L140 encePairwiseOnDemand]: 108/118 looper letters, 84 selfloop transitions, 32 changer transitions 26/225 dead transitions. [2023-11-10 11:40:24,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 225 transitions, 1275 flow [2023-11-10 11:40:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:40:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:40:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1304 transitions. [2023-11-10 11:40:24,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8500651890482399 [2023-11-10 11:40:24,768 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1304 transitions. [2023-11-10 11:40:24,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1304 transitions. [2023-11-10 11:40:24,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:24,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1304 transitions. [2023-11-10 11:40:24,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.3076923076923) internal successors, (1304), 13 states have internal predecessors, (1304), 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) [2023-11-10 11:40:24,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2023-11-10 11:40:24,776 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2023-11-10 11:40:24,776 INFO L175 Difference]: Start difference. First operand has 130 places, 122 transitions, 465 flow. Second operand 13 states and 1304 transitions. [2023-11-10 11:40:24,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 225 transitions, 1275 flow [2023-11-10 11:40:24,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 225 transitions, 1273 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 11:40:24,818 INFO L231 Difference]: Finished difference. Result has 145 places, 142 transitions, 706 flow [2023-11-10 11:40:24,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=706, PETRI_PLACES=145, PETRI_TRANSITIONS=142} [2023-11-10 11:40:24,819 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 23 predicate places. [2023-11-10 11:40:24,819 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 142 transitions, 706 flow [2023-11-10 11:40:24,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2023-11-10 11:40:24,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:24,820 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:24,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:40:24,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:24,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:24,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1249203903, now seen corresponding path program 1 times [2023-11-10 11:40:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:24,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180736026] [2023-11-10 11:40:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180736026] [2023-11-10 11:40:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180736026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:40:25,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981381760] [2023-11-10 11:40:25,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:25,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:40:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:25,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:40:25,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:40:25,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2023-11-10 11:40:25,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 142 transitions, 706 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 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) [2023-11-10 11:40:25,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:25,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2023-11-10 11:40:25,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:26,049 INFO L124 PetriNetUnfolderBase]: 2491/5152 cut-off events. [2023-11-10 11:40:26,050 INFO L125 PetriNetUnfolderBase]: For 11874/13972 co-relation queries the response was YES. [2023-11-10 11:40:26,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17505 conditions, 5152 events. 2491/5152 cut-off events. For 11874/13972 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 43604 event pairs, 165 based on Foata normal form. 79/5024 useless extension candidates. Maximal degree in co-relation 17427. Up to 796 conditions per place. [2023-11-10 11:40:26,093 INFO L140 encePairwiseOnDemand]: 108/118 looper letters, 73 selfloop transitions, 36 changer transitions 32/224 dead transitions. [2023-11-10 11:40:26,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 224 transitions, 1412 flow [2023-11-10 11:40:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-10 11:40:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-10 11:40:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1566 transitions. [2023-11-10 11:40:26,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8294491525423728 [2023-11-10 11:40:26,098 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1566 transitions. [2023-11-10 11:40:26,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1566 transitions. [2023-11-10 11:40:26,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:26,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1566 transitions. [2023-11-10 11:40:26,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 97.875) internal successors, (1566), 16 states have internal predecessors, (1566), 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) [2023-11-10 11:40:26,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 118.0) internal successors, (2006), 17 states have internal predecessors, (2006), 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) [2023-11-10 11:40:26,106 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 118.0) internal successors, (2006), 17 states have internal predecessors, (2006), 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) [2023-11-10 11:40:26,106 INFO L175 Difference]: Start difference. First operand has 145 places, 142 transitions, 706 flow. Second operand 16 states and 1566 transitions. [2023-11-10 11:40:26,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 224 transitions, 1412 flow [2023-11-10 11:40:26,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 224 transitions, 1249 flow, removed 65 selfloop flow, removed 8 redundant places. [2023-11-10 11:40:26,335 INFO L231 Difference]: Finished difference. Result has 159 places, 142 transitions, 693 flow [2023-11-10 11:40:26,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=693, PETRI_PLACES=159, PETRI_TRANSITIONS=142} [2023-11-10 11:40:26,336 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 37 predicate places. [2023-11-10 11:40:26,336 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 142 transitions, 693 flow [2023-11-10 11:40:26,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 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) [2023-11-10 11:40:26,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:26,336 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:26,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:40:26,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:26,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1160680159, now seen corresponding path program 1 times [2023-11-10 11:40:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457942273] [2023-11-10 11:40:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457942273] [2023-11-10 11:40:26,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457942273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:26,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:26,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:40:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716936440] [2023-11-10 11:40:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:26,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:40:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:40:26,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:40:26,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 118 [2023-11-10 11:40:26,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 142 transitions, 693 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 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) [2023-11-10 11:40:26,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:26,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 118 [2023-11-10 11:40:26,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:27,180 INFO L124 PetriNetUnfolderBase]: 801/3018 cut-off events. [2023-11-10 11:40:27,180 INFO L125 PetriNetUnfolderBase]: For 6143/6276 co-relation queries the response was YES. [2023-11-10 11:40:27,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9222 conditions, 3018 events. 801/3018 cut-off events. For 6143/6276 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 33264 event pairs, 22 based on Foata normal form. 1/2875 useless extension candidates. Maximal degree in co-relation 9135. Up to 351 conditions per place. [2023-11-10 11:40:27,207 INFO L140 encePairwiseOnDemand]: 102/118 looper letters, 48 selfloop transitions, 18 changer transitions 8/179 dead transitions. [2023-11-10 11:40:27,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 179 transitions, 1025 flow [2023-11-10 11:40:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:40:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:40:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 815 transitions. [2023-11-10 11:40:27,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7674199623352166 [2023-11-10 11:40:27,209 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 815 transitions. [2023-11-10 11:40:27,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 815 transitions. [2023-11-10 11:40:27,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:27,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 815 transitions. [2023-11-10 11:40:27,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 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) [2023-11-10 11:40:27,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 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) [2023-11-10 11:40:27,214 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 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) [2023-11-10 11:40:27,214 INFO L175 Difference]: Start difference. First operand has 159 places, 142 transitions, 693 flow. Second operand 9 states and 815 transitions. [2023-11-10 11:40:27,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 179 transitions, 1025 flow [2023-11-10 11:40:27,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 179 transitions, 890 flow, removed 43 selfloop flow, removed 14 redundant places. [2023-11-10 11:40:27,320 INFO L231 Difference]: Finished difference. Result has 156 places, 148 transitions, 718 flow [2023-11-10 11:40:27,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=718, PETRI_PLACES=156, PETRI_TRANSITIONS=148} [2023-11-10 11:40:27,321 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 34 predicate places. [2023-11-10 11:40:27,321 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 718 flow [2023-11-10 11:40:27,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 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) [2023-11-10 11:40:27,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:27,322 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:27,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:40:27,322 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:27,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 2 times [2023-11-10 11:40:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:27,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855672107] [2023-11-10 11:40:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:27,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855672107] [2023-11-10 11:40:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855672107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:27,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:27,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:40:27,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199605108] [2023-11-10 11:40:27,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:27,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:40:27,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:27,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:40:27,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:40:27,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 118 [2023-11-10 11:40:27,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 718 flow. Second operand has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 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) [2023-11-10 11:40:27,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:27,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 118 [2023-11-10 11:40:27,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:28,162 INFO L124 PetriNetUnfolderBase]: 928/3570 cut-off events. [2023-11-10 11:40:28,162 INFO L125 PetriNetUnfolderBase]: For 4908/4990 co-relation queries the response was YES. [2023-11-10 11:40:28,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10114 conditions, 3570 events. 928/3570 cut-off events. For 4908/4990 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 40994 event pairs, 65 based on Foata normal form. 13/3391 useless extension candidates. Maximal degree in co-relation 10087. Up to 392 conditions per place. [2023-11-10 11:40:28,195 INFO L140 encePairwiseOnDemand]: 106/118 looper letters, 37 selfloop transitions, 13 changer transitions 9/167 dead transitions. [2023-11-10 11:40:28,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 167 transitions, 916 flow [2023-11-10 11:40:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 11:40:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 11:40:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 642 transitions. [2023-11-10 11:40:28,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7772397094430993 [2023-11-10 11:40:28,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 642 transitions. [2023-11-10 11:40:28,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 642 transitions. [2023-11-10 11:40:28,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:28,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 642 transitions. [2023-11-10 11:40:28,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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) [2023-11-10 11:40:28,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 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) [2023-11-10 11:40:28,202 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 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) [2023-11-10 11:40:28,202 INFO L175 Difference]: Start difference. First operand has 156 places, 148 transitions, 718 flow. Second operand 7 states and 642 transitions. [2023-11-10 11:40:28,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 167 transitions, 916 flow [2023-11-10 11:40:28,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 167 transitions, 904 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-10 11:40:28,310 INFO L231 Difference]: Finished difference. Result has 161 places, 147 transitions, 757 flow [2023-11-10 11:40:28,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=757, PETRI_PLACES=161, PETRI_TRANSITIONS=147} [2023-11-10 11:40:28,311 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 39 predicate places. [2023-11-10 11:40:28,311 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 147 transitions, 757 flow [2023-11-10 11:40:28,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 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) [2023-11-10 11:40:28,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:28,312 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:28,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:40:28,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:28,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash 414558961, now seen corresponding path program 3 times [2023-11-10 11:40:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861521333] [2023-11-10 11:40:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:40:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:40:29,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:40:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861521333] [2023-11-10 11:40:29,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861521333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:40:29,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:40:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:40:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075088421] [2023-11-10 11:40:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:40:29,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:40:29,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:40:29,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:40:29,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:40:29,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 118 [2023-11-10 11:40:29,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 147 transitions, 757 flow. Second operand has 12 states, 12 states have (on average 79.75) internal successors, (957), 12 states have internal predecessors, (957), 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) [2023-11-10 11:40:29,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:40:29,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 118 [2023-11-10 11:40:29,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:40:30,351 INFO L124 PetriNetUnfolderBase]: 1804/7219 cut-off events. [2023-11-10 11:40:30,352 INFO L125 PetriNetUnfolderBase]: For 11098/11161 co-relation queries the response was YES. [2023-11-10 11:40:30,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20359 conditions, 7219 events. 1804/7219 cut-off events. For 11098/11161 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 97287 event pairs, 25 based on Foata normal form. 15/6889 useless extension candidates. Maximal degree in co-relation 20329. Up to 895 conditions per place. [2023-11-10 11:40:30,417 INFO L140 encePairwiseOnDemand]: 96/118 looper letters, 37 selfloop transitions, 22 changer transitions 43/200 dead transitions. [2023-11-10 11:40:30,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 200 transitions, 1282 flow [2023-11-10 11:40:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-10 11:40:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-10 11:40:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1240 transitions. [2023-11-10 11:40:30,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7005649717514124 [2023-11-10 11:40:30,421 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1240 transitions. [2023-11-10 11:40:30,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1240 transitions. [2023-11-10 11:40:30,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:40:30,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1240 transitions. [2023-11-10 11:40:30,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 82.66666666666667) internal successors, (1240), 15 states have internal predecessors, (1240), 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) [2023-11-10 11:40:30,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 118.0) internal successors, (1888), 16 states have internal predecessors, (1888), 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) [2023-11-10 11:40:30,430 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 118.0) internal successors, (1888), 16 states have internal predecessors, (1888), 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) [2023-11-10 11:40:30,430 INFO L175 Difference]: Start difference. First operand has 161 places, 147 transitions, 757 flow. Second operand 15 states and 1240 transitions. [2023-11-10 11:40:30,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 200 transitions, 1282 flow [2023-11-10 11:40:30,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 200 transitions, 1199 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-10 11:40:30,853 INFO L231 Difference]: Finished difference. Result has 172 places, 141 transitions, 718 flow [2023-11-10 11:40:30,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=718, PETRI_PLACES=172, PETRI_TRANSITIONS=141} [2023-11-10 11:40:30,854 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 50 predicate places. [2023-11-10 11:40:30,854 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 141 transitions, 718 flow [2023-11-10 11:40:30,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.75) internal successors, (957), 12 states have internal predecessors, (957), 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) [2023-11-10 11:40:30,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:40:30,855 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:30,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:40:30,855 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:40:30,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:40:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1364476715, now seen corresponding path program 4 times [2023-11-10 11:40:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:40:30,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614803880] [2023-11-10 11:40:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:40:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:40:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:40:30,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:40:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:40:31,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:40:31,022 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:40:31,023 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-10 11:40:31,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-10 11:40:31,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-10 11:40:31,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-10 11:40:31,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-10 11:40:31,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-10 11:40:31,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:40:31,026 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:40:31,032 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:40:31,032 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:40:31,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-10 11:40:31,123 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-10 11:40:31,124 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-10 11:40:31,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:40:31 BasicIcfg [2023-11-10 11:40:31,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:40:31,147 INFO L158 Benchmark]: Toolchain (without parser) took 15936.37ms. Allocated memory was 219.2MB in the beginning and 1.1GB in the end (delta: 879.8MB). Free memory was 185.0MB in the beginning and 569.7MB in the end (delta: -384.7MB). Peak memory consumption was 496.0MB. Max. memory is 8.0GB. [2023-11-10 11:40:31,147 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 219.2MB. Free memory is still 173.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:40:31,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.17ms. Allocated memory is still 219.2MB. Free memory was 184.6MB in the beginning and 161.4MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-10 11:40:31,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.32ms. Allocated memory is still 219.2MB. Free memory was 161.4MB in the beginning and 158.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-10 11:40:31,148 INFO L158 Benchmark]: Boogie Preprocessor took 38.63ms. Allocated memory is still 219.2MB. Free memory was 158.8MB in the beginning and 156.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 11:40:31,148 INFO L158 Benchmark]: RCFGBuilder took 757.39ms. Allocated memory is still 219.2MB. Free memory was 156.7MB in the beginning and 120.7MB in the end (delta: 36.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-11-10 11:40:31,149 INFO L158 Benchmark]: TraceAbstraction took 14567.50ms. Allocated memory was 219.2MB in the beginning and 1.1GB in the end (delta: 879.8MB). Free memory was 119.6MB in the beginning and 569.7MB in the end (delta: -450.1MB). Peak memory consumption was 431.0MB. Max. memory is 8.0GB. [2023-11-10 11:40:31,150 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.15ms. Allocated memory is still 219.2MB. Free memory is still 173.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.17ms. Allocated memory is still 219.2MB. Free memory was 184.6MB in the beginning and 161.4MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.32ms. Allocated memory is still 219.2MB. Free memory was 161.4MB in the beginning and 158.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.63ms. Allocated memory is still 219.2MB. Free memory was 158.8MB in the beginning and 156.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 757.39ms. Allocated memory is still 219.2MB. Free memory was 156.7MB in the beginning and 120.7MB in the end (delta: 36.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14567.50ms. Allocated memory was 219.2MB in the beginning and 1.1GB in the end (delta: 879.8MB). Free memory was 119.6MB in the beginning and 569.7MB in the end (delta: -450.1MB). Peak memory consumption was 431.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a=0] [L721] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a=0] [L722] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a=0] [L723] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a=0] [L724] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a=0] [L725] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a=0] [L726] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a=0] [L727] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a=0] [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a=0] [L729] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a=0] [L730] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a=0] [L731] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a=0] [L732] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a=0] [L733] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a=0] [L734] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a=0] [L735] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0] [L736] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0] [L737] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L739] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L848] 0 pthread_t t633; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t634; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 851]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 694 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 694 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 590 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1412 IncrementalHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 171 mSDtfsCounter, 1412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=757occurred in iteration=9, InterpolantAutomatonStates: 104, 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.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 772 ConstructedInterpolants, 0 QuantifiedInterpolants, 4068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-10 11:40:31,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...