/usr/lib/jvm/java-1.11.0-openjdk-amd64/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-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:28:59,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:28:59,817 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-SemanticLbe.epf [2023-11-17 11:28:59,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:28:59,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:28:59,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:28:59,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:28:59,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:28:59,840 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:28:59,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:28:59,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:28:59,841 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:28:59,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:28:59,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:28:59,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:28:59,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:28:59,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:28:59,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:28:59,843 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:28:59,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:28:59,844 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:28:59,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:28:59,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:28:59,845 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:28:59,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:28:59,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:28:59,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:28:59,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:28:59,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:28:59,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:28:59,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:28:59,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:28:59,848 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:29:00,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:29:00,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:29:00,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:29:00,061 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:29:00,062 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:29:00,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i [2023-11-17 11:29:01,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:29:01,605 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:29:01,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i [2023-11-17 11:29:01,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f8ca1d8/1f413525fee5476aa955eaa1855ba9b3/FLAG2c479c3aa [2023-11-17 11:29:01,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f8ca1d8/1f413525fee5476aa955eaa1855ba9b3 [2023-11-17 11:29:01,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:29:01,641 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:29:01,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:01,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:29:01,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:29:01,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:01" (1/1) ... [2023-11-17 11:29:01,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1571cb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:01, skipping insertion in model container [2023-11-17 11:29:01,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:01" (1/1) ... [2023-11-17 11:29:01,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:29:01,855 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/safe016_power.opt.i[951,964] [2023-11-17 11:29:02,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:02,094 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:29:02,107 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/safe016_power.opt.i[951,964] [2023-11-17 11:29:02,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:02,188 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:02,188 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:02,195 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:29:02,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02 WrapperNode [2023-11-17 11:29:02,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:02,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:02,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:29:02,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:29:02,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,267 INFO L138 Inliner]: procedures = 177, calls = 91, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 183 [2023-11-17 11:29:02,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:02,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:29:02,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:29:02,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:29:02,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:29:02,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:29:02,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:29:02,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:29:02,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:02,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:29:02,386 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-17 11:29:02,415 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-17 11:29:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:29:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:29:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:29:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:29:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:29:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:29:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:29:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:29:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:29:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:29:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:29:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:29:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:29:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:29:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:29:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:29:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:29:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:29:02,429 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:29:02,607 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:29:02,609 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:29:03,167 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:29:03,559 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:29:03,559 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:29:03,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:03 BoogieIcfgContainer [2023-11-17 11:29:03,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:29:03,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:29:03,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:29:03,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:29:03,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:29:01" (1/3) ... [2023-11-17 11:29:03,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cbc91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:03, skipping insertion in model container [2023-11-17 11:29:03,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (2/3) ... [2023-11-17 11:29:03,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cbc91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:03, skipping insertion in model container [2023-11-17 11:29:03,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:03" (3/3) ... [2023-11-17 11:29:03,572 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.opt.i [2023-11-17 11:29:03,588 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:29:03,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:29:03,588 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:29:03,670 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:29:03,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2023-11-17 11:29:03,755 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-17 11:29:03,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:03,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-11-17 11:29:03,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2023-11-17 11:29:03,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:03,768 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:29:03,790 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:03,792 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:03,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:03,808 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2023-11-17 11:29:03,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:03,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2023-11-17 11:29:03,810 INFO L119 LiptonReduction]: Number of co-enabled transitions 850 [2023-11-17 11:29:09,450 INFO L134 LiptonReduction]: Checked pairs total: 2292 [2023-11-17 11:29:09,451 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-11-17 11:29:09,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:29:09,480 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;@4afcfd2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:29:09,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:29:09,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:29:09,495 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-17 11:29:09,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:09,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:09,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:09,497 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:09,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 422943999, now seen corresponding path program 1 times [2023-11-17 11:29:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:09,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684300921] [2023-11-17 11:29:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:10,257 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-17 11:29:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684300921] [2023-11-17 11:29:10,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684300921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:10,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:10,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010022813] [2023-11-17 11:29:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:10,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:10,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:10,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:10,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:29:10,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-17 11:29:10,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:10,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:29:10,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:11,636 INFO L124 PetriNetUnfolderBase]: 3815/5248 cut-off events. [2023-11-17 11:29:11,636 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-17 11:29:11,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10708 conditions, 5248 events. 3815/5248 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24109 event pairs, 1079 based on Foata normal form. 64/5307 useless extension candidates. Maximal degree in co-relation 10696. Up to 4585 conditions per place. [2023-11-17 11:29:11,685 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 39 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-17 11:29:11,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 187 flow [2023-11-17 11:29:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-17 11:29:11,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2023-11-17 11:29:11,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-17 11:29:11,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-17 11:29:11,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:11,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-17 11:29:11,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-17 11:29:11,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-17 11:29:11,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-17 11:29:11,715 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 62 flow. Second operand 3 states and 96 transitions. [2023-11-17 11:29:11,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 187 flow [2023-11-17 11:29:11,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:11,724 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2023-11-17 11:29:11,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-17 11:29:11,731 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2023-11-17 11:29:11,732 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2023-11-17 11:29:11,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-17 11:29:11,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:11,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:11,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:29:11,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:11,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash 226362737, now seen corresponding path program 1 times [2023-11-17 11:29:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25212441] [2023-11-17 11:29:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:12,031 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-17 11:29:12,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25212441] [2023-11-17 11:29:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25212441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:12,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:12,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648062739] [2023-11-17 11:29:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:12,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:12,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:12,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2023-11-17 11:29:12,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-17 11:29:12,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:12,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2023-11-17 11:29:12,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:13,867 INFO L124 PetriNetUnfolderBase]: 7237/9936 cut-off events. [2023-11-17 11:29:13,868 INFO L125 PetriNetUnfolderBase]: For 793/793 co-relation queries the response was YES. [2023-11-17 11:29:13,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21093 conditions, 9936 events. 7237/9936 cut-off events. For 793/793 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 47518 event pairs, 1017 based on Foata normal form. 320/10256 useless extension candidates. Maximal degree in co-relation 21082. Up to 4865 conditions per place. [2023-11-17 11:29:13,919 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 45 selfloop transitions, 4 changer transitions 7/56 dead transitions. [2023-11-17 11:29:13,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 247 flow [2023-11-17 11:29:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2023-11-17 11:29:13,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2023-11-17 11:29:13,925 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 122 transitions. [2023-11-17 11:29:13,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 122 transitions. [2023-11-17 11:29:13,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:13,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 122 transitions. [2023-11-17 11:29:13,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-17 11:29:13,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 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-17 11:29:13,930 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 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-17 11:29:13,930 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 4 states and 122 transitions. [2023-11-17 11:29:13,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 247 flow [2023-11-17 11:29:13,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:13,937 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 88 flow [2023-11-17 11:29:13,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-17 11:29:13,939 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2023-11-17 11:29:13,939 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 88 flow [2023-11-17 11:29:13,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-17 11:29:13,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:13,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:13,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:29:13,949 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:13,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1572691972, now seen corresponding path program 1 times [2023-11-17 11:29:13,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:13,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32560922] [2023-11-17 11:29:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:13,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:14,223 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-17 11:29:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:14,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32560922] [2023-11-17 11:29:14,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32560922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:14,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:14,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:14,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180513107] [2023-11-17 11:29:14,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:14,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:14,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:14,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:14,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2023-11-17 11:29:14,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:14,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:14,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2023-11-17 11:29:14,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:15,229 INFO L124 PetriNetUnfolderBase]: 3830/5321 cut-off events. [2023-11-17 11:29:15,229 INFO L125 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2023-11-17 11:29:15,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12525 conditions, 5321 events. 3830/5321 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 23263 event pairs, 1773 based on Foata normal form. 48/5369 useless extension candidates. Maximal degree in co-relation 12512. Up to 4638 conditions per place. [2023-11-17 11:29:15,273 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-17 11:29:15,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 204 flow [2023-11-17 11:29:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-17 11:29:15,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2023-11-17 11:29:15,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-17 11:29:15,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-17 11:29:15,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:15,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-17 11:29:15,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-17 11:29:15,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-17 11:29:15,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-17 11:29:15,282 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 88 flow. Second operand 3 states and 96 transitions. [2023-11-17 11:29:15,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 204 flow [2023-11-17 11:29:15,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 191 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:15,288 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 87 flow [2023-11-17 11:29:15,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-17 11:29:15,290 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2023-11-17 11:29:15,290 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 87 flow [2023-11-17 11:29:15,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:15,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:15,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:15,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:29:15,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:15,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1508713159, now seen corresponding path program 1 times [2023-11-17 11:29:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:15,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097162197] [2023-11-17 11:29:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:15,518 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-17 11:29:15,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:15,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097162197] [2023-11-17 11:29:15,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097162197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:15,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:15,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37446176] [2023-11-17 11:29:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:15,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:15,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:15,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2023-11-17 11:29:15,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-17 11:29:15,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:15,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2023-11-17 11:29:15,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:16,855 INFO L124 PetriNetUnfolderBase]: 5494/7621 cut-off events. [2023-11-17 11:29:16,856 INFO L125 PetriNetUnfolderBase]: For 2611/2611 co-relation queries the response was YES. [2023-11-17 11:29:16,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17217 conditions, 7621 events. 5494/7621 cut-off events. For 2611/2611 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 36353 event pairs, 2524 based on Foata normal form. 192/7813 useless extension candidates. Maximal degree in co-relation 17204. Up to 4144 conditions per place. [2023-11-17 11:29:16,892 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-11-17 11:29:16,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 204 flow [2023-11-17 11:29:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-17 11:29:16,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2023-11-17 11:29:16,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-17 11:29:16,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-17 11:29:16,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:16,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-17 11:29:16,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-17 11:29:16,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-17 11:29:16,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-17 11:29:16,898 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 87 flow. Second operand 3 states and 90 transitions. [2023-11-17 11:29:16,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 204 flow [2023-11-17 11:29:16,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:16,900 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 94 flow [2023-11-17 11:29:16,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-11-17 11:29:16,902 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-11-17 11:29:16,902 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 94 flow [2023-11-17 11:29:16,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-17 11:29:16,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:16,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:16,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:29:16,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:16,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1672108373, now seen corresponding path program 1 times [2023-11-17 11:29:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440796236] [2023-11-17 11:29:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:18,672 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-17 11:29:18,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:18,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440796236] [2023-11-17 11:29:18,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440796236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:18,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:18,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:18,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674897860] [2023-11-17 11:29:18,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:18,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:18,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:18,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:18,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:18,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2023-11-17 11:29:18,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-17 11:29:18,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:18,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2023-11-17 11:29:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:19,778 INFO L124 PetriNetUnfolderBase]: 4786/6696 cut-off events. [2023-11-17 11:29:19,779 INFO L125 PetriNetUnfolderBase]: For 2711/2761 co-relation queries the response was YES. [2023-11-17 11:29:19,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15410 conditions, 6696 events. 4786/6696 cut-off events. For 2711/2761 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 33288 event pairs, 1063 based on Foata normal form. 13/6702 useless extension candidates. Maximal degree in co-relation 15397. Up to 6229 conditions per place. [2023-11-17 11:29:19,807 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 38 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-11-17 11:29:19,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 222 flow [2023-11-17 11:29:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2023-11-17 11:29:19,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5574712643678161 [2023-11-17 11:29:19,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 97 transitions. [2023-11-17 11:29:19,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 97 transitions. [2023-11-17 11:29:19,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:19,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 97 transitions. [2023-11-17 11:29:19,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-17 11:29:19,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-17 11:29:19,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-17 11:29:19,811 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 94 flow. Second operand 3 states and 97 transitions. [2023-11-17 11:29:19,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 222 flow [2023-11-17 11:29:19,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 214 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:19,815 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 108 flow [2023-11-17 11:29:19,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-11-17 11:29:19,817 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-11-17 11:29:19,818 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 108 flow [2023-11-17 11:29:19,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-17 11:29:19,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:19,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:19,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:29:19,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:19,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -345468618, now seen corresponding path program 1 times [2023-11-17 11:29:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697698367] [2023-11-17 11:29:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:19,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:20,034 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-17 11:29:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:20,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697698367] [2023-11-17 11:29:20,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697698367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:20,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:20,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426445058] [2023-11-17 11:29:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:20,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:20,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:20,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:20,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:29:20,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:20,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:20,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:29:20,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:20,892 INFO L124 PetriNetUnfolderBase]: 4440/6452 cut-off events. [2023-11-17 11:29:20,892 INFO L125 PetriNetUnfolderBase]: For 2359/2392 co-relation queries the response was YES. [2023-11-17 11:29:20,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15602 conditions, 6452 events. 4440/6452 cut-off events. For 2359/2392 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 34140 event pairs, 728 based on Foata normal form. 485/6919 useless extension candidates. Maximal degree in co-relation 15587. Up to 2961 conditions per place. [2023-11-17 11:29:20,919 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 57 selfloop transitions, 6 changer transitions 1/66 dead transitions. [2023-11-17 11:29:20,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 348 flow [2023-11-17 11:29:20,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2023-11-17 11:29:20,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2023-11-17 11:29:20,921 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 113 transitions. [2023-11-17 11:29:20,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 113 transitions. [2023-11-17 11:29:20,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:20,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 113 transitions. [2023-11-17 11:29:20,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-17 11:29:20,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 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-17 11:29:20,923 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 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-17 11:29:20,924 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 108 flow. Second operand 4 states and 113 transitions. [2023-11-17 11:29:20,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 348 flow [2023-11-17 11:29:20,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:20,927 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 147 flow [2023-11-17 11:29:20,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-11-17 11:29:20,929 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2023-11-17 11:29:20,929 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 147 flow [2023-11-17 11:29:20,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:20,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:20,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:20,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:29:20,930 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:20,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:20,931 INFO L85 PathProgramCache]: Analyzing trace with hash -641180388, now seen corresponding path program 1 times [2023-11-17 11:29:20,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:20,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724511234] [2023-11-17 11:29:20,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:20,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:21,173 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-17 11:29:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724511234] [2023-11-17 11:29:21,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724511234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:21,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583017988] [2023-11-17 11:29:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:21,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:29:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:29:21,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:29:21,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:29:21,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-17 11:29:21,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:21,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:29:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:21,902 INFO L124 PetriNetUnfolderBase]: 2539/3855 cut-off events. [2023-11-17 11:29:21,902 INFO L125 PetriNetUnfolderBase]: For 2364/2377 co-relation queries the response was YES. [2023-11-17 11:29:21,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11448 conditions, 3855 events. 2539/3855 cut-off events. For 2364/2377 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19725 event pairs, 315 based on Foata normal form. 338/4181 useless extension candidates. Maximal degree in co-relation 11430. Up to 1398 conditions per place. [2023-11-17 11:29:21,921 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 69 selfloop transitions, 10 changer transitions 1/82 dead transitions. [2023-11-17 11:29:21,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 469 flow [2023-11-17 11:29:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2023-11-17 11:29:21,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896551724137931 [2023-11-17 11:29:21,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 142 transitions. [2023-11-17 11:29:21,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 142 transitions. [2023-11-17 11:29:21,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:21,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 142 transitions. [2023-11-17 11:29:21,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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-17 11:29:21,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 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-17 11:29:21,925 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 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-17 11:29:21,925 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 147 flow. Second operand 5 states and 142 transitions. [2023-11-17 11:29:21,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 469 flow [2023-11-17 11:29:21,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 458 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:21,930 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 199 flow [2023-11-17 11:29:21,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-17 11:29:21,931 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2023-11-17 11:29:21,931 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 199 flow [2023-11-17 11:29:21,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-17 11:29:21,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:21,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:21,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:29:21,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:21,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1976747077, now seen corresponding path program 1 times [2023-11-17 11:29:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:21,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306198366] [2023-11-17 11:29:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:22,189 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-17 11:29:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306198366] [2023-11-17 11:29:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306198366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:22,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544732515] [2023-11-17 11:29:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:22,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:22,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:22,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:22,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:29:22,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:22,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:22,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:29:22,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:22,748 INFO L124 PetriNetUnfolderBase]: 1510/2341 cut-off events. [2023-11-17 11:29:22,749 INFO L125 PetriNetUnfolderBase]: For 2620/2625 co-relation queries the response was YES. [2023-11-17 11:29:22,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7792 conditions, 2341 events. 1510/2341 cut-off events. For 2620/2625 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11168 event pairs, 311 based on Foata normal form. 133/2462 useless extension candidates. Maximal degree in co-relation 7772. Up to 790 conditions per place. [2023-11-17 11:29:22,762 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 78 selfloop transitions, 14 changer transitions 1/95 dead transitions. [2023-11-17 11:29:22,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 95 transitions, 588 flow [2023-11-17 11:29:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:29:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:29:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2023-11-17 11:29:22,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2023-11-17 11:29:22,764 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 171 transitions. [2023-11-17 11:29:22,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 171 transitions. [2023-11-17 11:29:22,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:22,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 171 transitions. [2023-11-17 11:29:22,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 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-17 11:29:22,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 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-17 11:29:22,766 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 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-17 11:29:22,766 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 199 flow. Second operand 6 states and 171 transitions. [2023-11-17 11:29:22,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 95 transitions, 588 flow [2023-11-17 11:29:22,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 558 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:22,788 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 249 flow [2023-11-17 11:29:22,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-11-17 11:29:22,788 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-11-17 11:29:22,789 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 249 flow [2023-11-17 11:29:22,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:22,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:22,789 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] [2023-11-17 11:29:22,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:29:22,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:22,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1587596920, now seen corresponding path program 1 times [2023-11-17 11:29:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2370165] [2023-11-17 11:29:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:22,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:23,071 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-17 11:29:23,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:23,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2370165] [2023-11-17 11:29:23,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2370165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:23,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:23,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:23,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996154465] [2023-11-17 11:29:23,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:23,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:23,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:23,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2023-11-17 11:29:23,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-17 11:29:23,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:23,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2023-11-17 11:29:23,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:23,635 INFO L124 PetriNetUnfolderBase]: 2020/3116 cut-off events. [2023-11-17 11:29:23,635 INFO L125 PetriNetUnfolderBase]: For 5532/5532 co-relation queries the response was YES. [2023-11-17 11:29:23,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10861 conditions, 3116 events. 2020/3116 cut-off events. For 5532/5532 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15392 event pairs, 389 based on Foata normal form. 11/3127 useless extension candidates. Maximal degree in co-relation 10840. Up to 1004 conditions per place. [2023-11-17 11:29:23,647 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 48 selfloop transitions, 3 changer transitions 74/125 dead transitions. [2023-11-17 11:29:23,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 1046 flow [2023-11-17 11:29:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2023-11-17 11:29:23,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137931034482759 [2023-11-17 11:29:23,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 149 transitions. [2023-11-17 11:29:23,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 149 transitions. [2023-11-17 11:29:23,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:23,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 149 transitions. [2023-11-17 11:29:23,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-17 11:29:23,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 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-17 11:29:23,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 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-17 11:29:23,656 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 249 flow. Second operand 5 states and 149 transitions. [2023-11-17 11:29:23,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 1046 flow [2023-11-17 11:29:23,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 125 transitions, 880 flow, removed 36 selfloop flow, removed 5 redundant places. [2023-11-17 11:29:23,682 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 219 flow [2023-11-17 11:29:23,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-11-17 11:29:23,683 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-11-17 11:29:23,683 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 219 flow [2023-11-17 11:29:23,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-17 11:29:23,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:23,685 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] [2023-11-17 11:29:23,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:29:23,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:23,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash 835167146, now seen corresponding path program 2 times [2023-11-17 11:29:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031342534] [2023-11-17 11:29:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:23,970 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-17 11:29:23,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:23,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031342534] [2023-11-17 11:29:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031342534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:23,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:23,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:29:23,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375437144] [2023-11-17 11:29:23,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:23,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:29:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:23,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:29:23,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:29:23,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:29:23,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-17 11:29:23,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:23,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:29:23,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:24,379 INFO L124 PetriNetUnfolderBase]: 890/1414 cut-off events. [2023-11-17 11:29:24,379 INFO L125 PetriNetUnfolderBase]: For 1169/1174 co-relation queries the response was YES. [2023-11-17 11:29:24,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 1414 events. 890/1414 cut-off events. For 1169/1174 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6430 event pairs, 200 based on Foata normal form. 27/1435 useless extension candidates. Maximal degree in co-relation 4350. Up to 560 conditions per place. [2023-11-17 11:29:24,385 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 54 selfloop transitions, 18 changer transitions 6/79 dead transitions. [2023-11-17 11:29:24,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 501 flow [2023-11-17 11:29:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:29:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:29:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2023-11-17 11:29:24,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41625615763546797 [2023-11-17 11:29:24,387 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 169 transitions. [2023-11-17 11:29:24,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 169 transitions. [2023-11-17 11:29:24,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:24,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 169 transitions. [2023-11-17 11:29:24,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-17 11:29:24,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 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-17 11:29:24,388 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 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-17 11:29:24,389 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 219 flow. Second operand 7 states and 169 transitions. [2023-11-17 11:29:24,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 501 flow [2023-11-17 11:29:24,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 466 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-17 11:29:24,400 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 238 flow [2023-11-17 11:29:24,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=238, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-11-17 11:29:24,401 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-11-17 11:29:24,401 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 238 flow [2023-11-17 11:29:24,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-17 11:29:24,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:24,402 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] [2023-11-17 11:29:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:29:24,403 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:24,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash 696302456, now seen corresponding path program 1 times [2023-11-17 11:29:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:24,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735336238] [2023-11-17 11:29:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:25,737 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-17 11:29:25,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:25,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735336238] [2023-11-17 11:29:25,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735336238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:25,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913744482] [2023-11-17 11:29:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:25,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:25,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:25,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2023-11-17 11:29:25,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-17 11:29:25,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:25,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2023-11-17 11:29:25,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:25,996 INFO L124 PetriNetUnfolderBase]: 618/983 cut-off events. [2023-11-17 11:29:25,997 INFO L125 PetriNetUnfolderBase]: For 1575/1580 co-relation queries the response was YES. [2023-11-17 11:29:25,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 983 events. 618/983 cut-off events. For 1575/1580 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3830 event pairs, 269 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 3298. Up to 572 conditions per place. [2023-11-17 11:29:26,002 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 48 selfloop transitions, 8 changer transitions 18/75 dead transitions. [2023-11-17 11:29:26,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 639 flow [2023-11-17 11:29:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2023-11-17 11:29:26,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793103448275862 [2023-11-17 11:29:26,004 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 139 transitions. [2023-11-17 11:29:26,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 139 transitions. [2023-11-17 11:29:26,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:26,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 139 transitions. [2023-11-17 11:29:26,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-17 11:29:26,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 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-17 11:29:26,006 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 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-17 11:29:26,007 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 238 flow. Second operand 5 states and 139 transitions. [2023-11-17 11:29:26,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 639 flow [2023-11-17 11:29:26,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 406 flow, removed 35 selfloop flow, removed 13 redundant places. [2023-11-17 11:29:26,014 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 173 flow [2023-11-17 11:29:26,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-11-17 11:29:26,014 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-11-17 11:29:26,015 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 173 flow [2023-11-17 11:29:26,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-17 11:29:26,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:26,015 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] [2023-11-17 11:29:26,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:29:26,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:26,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1428740414, now seen corresponding path program 2 times [2023-11-17 11:29:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125805702] [2023-11-17 11:29:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:29:26,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:29:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:29:26,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:29:26,286 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:29:26,287 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:29:26,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-17 11:29:26,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:29:26,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:29:26,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-17 11:29:26,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:29:26,294 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:26,298 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:29:26,298 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:29:26,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated [2023-11-17 11:29:26,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated [2023-11-17 11:29:26,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated [2023-11-17 11:29:26,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated [2023-11-17 11:29:26,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:29:26 BasicIcfg [2023-11-17 11:29:26,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:29:26,429 INFO L158 Benchmark]: Toolchain (without parser) took 24787.84ms. Allocated memory was 272.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 225.8MB in the beginning and 905.2MB in the end (delta: -679.4MB). Peak memory consumption was 930.0MB. Max. memory is 8.0GB. [2023-11-17 11:29:26,429 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:29:26,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.72ms. Allocated memory is still 272.6MB. Free memory was 225.4MB in the beginning and 199.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-11-17 11:29:26,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.52ms. Allocated memory is still 272.6MB. Free memory was 199.2MB in the beginning and 196.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:26,431 INFO L158 Benchmark]: Boogie Preprocessor took 73.75ms. Allocated memory is still 272.6MB. Free memory was 196.4MB in the beginning and 193.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:26,431 INFO L158 Benchmark]: RCFGBuilder took 1218.29ms. Allocated memory is still 272.6MB. Free memory was 193.7MB in the beginning and 140.7MB in the end (delta: 53.0MB). Peak memory consumption was 54.0MB. Max. memory is 8.0GB. [2023-11-17 11:29:26,432 INFO L158 Benchmark]: TraceAbstraction took 22862.74ms. Allocated memory was 272.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 140.2MB in the beginning and 905.2MB in the end (delta: -765.0MB). Peak memory consumption was 843.5MB. Max. memory is 8.0GB. [2023-11-17 11:29:26,433 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.14ms. Allocated memory is still 194.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 553.72ms. Allocated memory is still 272.6MB. Free memory was 225.4MB in the beginning and 199.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.52ms. Allocated memory is still 272.6MB. Free memory was 199.2MB in the beginning and 196.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.75ms. Allocated memory is still 272.6MB. Free memory was 196.4MB in the beginning and 193.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1218.29ms. Allocated memory is still 272.6MB. Free memory was 193.7MB in the beginning and 140.7MB in the end (delta: 53.0MB). Peak memory consumption was 54.0MB. Max. memory is 8.0GB. * TraceAbstraction took 22862.74ms. Allocated memory was 272.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 140.2MB in the beginning and 905.2MB in the end (delta: -765.0MB). Peak memory consumption was 843.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre37 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: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 51 PlacesBefore, 38 PlacesAfterwards, 38 TransitionsBefore, 25 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 2292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 777, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 465, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 465, independent: 407, independent conditional: 0, independent unconditional: 407, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 934, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 861, dependent conditional: 0, dependent unconditional: 861, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 777, independent: 256, independent conditional: 0, independent unconditional: 256, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 465, unknown conditional: 0, unknown unconditional: 465] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff0_thd4; [L744] 0 _Bool x$r_buff1_thd0; [L745] 0 _Bool x$r_buff1_thd1; [L746] 0 _Bool x$r_buff1_thd2; [L747] 0 _Bool x$r_buff1_thd3; [L748] 0 _Bool x$r_buff1_thd4; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2149; [L862] FCALL, FORK 0 pthread_create(&t2149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2150; [L864] FCALL, FORK 0 pthread_create(&t2150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={9:0}, t2150={10:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L865] 0 pthread_t t2151; [L866] FCALL, FORK 0 pthread_create(&t2151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={9:0}, t2150={10:0}, t2151={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L867] 0 pthread_t t2152; [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] EXPR 3 \read(x) [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L806] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L807] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L808] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L809] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L810] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L811] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L812] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L813] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L814] EXPR 3 \read(x) [L814] 3 __unbuffered_p2_EAX = x [L815] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L815] 3 x = x$flush_delayed ? x$mem_tmp : x [L816] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L819] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 \read(x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L823] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L824] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L825] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L826] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L868] FCALL, FORK 0 pthread_create(&t2152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={9:0}, t2150={10:0}, t2151={7:0}, t2152={11:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L836] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, 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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 \read(x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, 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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, 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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, 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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L783] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 \read(x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 \read(x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2149={9:0}, t2150={10:0}, t2151={7:0}, t2152={11:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 \read(x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L877] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2149={9:0}, t2150={10:0}, t2151={7:0}, t2152={11:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L881] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L882] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L883] 0 x$flush_delayed = weak$$choice2 [L884] EXPR 0 \read(x) [L884] 0 x$mem_tmp = x [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] EXPR 0 \read(x) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L886] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L887] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L888] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L889] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L890] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L891] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L892] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L894] EXPR 0 \read(x) [L894] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] 0 x = x$flush_delayed ? x$mem_tmp : x [L896] 0 x$flush_delayed = (_Bool)0 [L898] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 862]: 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: 868]: 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: 866]: 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: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 75 locations, 5 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: 22.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 782 IncrementalHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 3 mSDtfsCounter, 782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=8, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 1366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-17 11:29:26,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...