/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:19:26,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:19:26,608 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 15:19:26,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:19:26,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:19:26,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:19:26,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:19:26,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:19:26,650 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:19:26,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:19:26,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:19:26,654 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:19:26,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:19:26,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:19:26,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:19:26,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:19:26,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:19:26,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:19:26,655 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:19:26,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:19:26,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:19:26,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:19:26,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:19:26,656 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:19:26,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:19:26,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:19:26,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:19:26,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:19:26,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:19:26,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:19:26,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:19:26,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:19:26,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:19:26,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:19:26,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:19:26,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:19:26,966 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:19:26,967 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:19:26,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2023-11-17 15:19:28,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:19:28,415 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:19:28,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2023-11-17 15:19:28,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09f67866/c6e78b14aaf949b1be8ebf40f21a3458/FLAG22b682f37 [2023-11-17 15:19:28,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09f67866/c6e78b14aaf949b1be8ebf40f21a3458 [2023-11-17 15:19:28,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:19:28,454 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:19:28,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:19:28,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:19:28,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:19:28,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:19:28" (1/1) ... [2023-11-17 15:19:28,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762d80ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28, skipping insertion in model container [2023-11-17 15:19:28,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:19:28" (1/1) ... [2023-11-17 15:19:28,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:19:28,669 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/safe027_power.opt.i[994,1007] [2023-11-17 15:19:28,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:19:28,927 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:19:28,947 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/safe027_power.opt.i[994,1007] [2023-11-17 15:19:29,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:19:29,029 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:19:29,029 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:19:29,035 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:19:29,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29 WrapperNode [2023-11-17 15:19:29,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:19:29,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:19:29,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:19:29,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:19:29,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,096 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2023-11-17 15:19:29,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:19:29,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:19:29,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:19:29,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:19:29,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:19:29,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:19:29,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:19:29,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:19:29,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (1/1) ... [2023-11-17 15:19:29,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:19:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:19:29,209 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 15:19:29,236 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 15:19:29,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:19:29,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:19:29,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:19:29,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:19:29,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:19:29,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:19:29,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:19:29,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:19:29,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:19:29,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:19:29,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:19:29,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:19:29,246 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:19:29,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:19:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:19:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:19:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:19:29,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:19:29,250 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 15:19:29,396 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:19:29,398 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:19:29,881 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:19:30,241 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:19:30,241 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:19:30,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:19:30 BoogieIcfgContainer [2023-11-17 15:19:30,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:19:30,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:19:30,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:19:30,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:19:30,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:19:28" (1/3) ... [2023-11-17 15:19:30,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7007074f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:30, skipping insertion in model container [2023-11-17 15:19:30,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:29" (2/3) ... [2023-11-17 15:19:30,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7007074f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:30, skipping insertion in model container [2023-11-17 15:19:30,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:19:30" (3/3) ... [2023-11-17 15:19:30,254 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2023-11-17 15:19:30,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:19:30,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:19:30,272 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:19:30,363 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:19:30,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-17 15:19:30,495 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-17 15:19:30,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:30,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-11-17 15:19:30,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-17 15:19:30,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-17 15:19:30,513 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:19:30,532 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-17 15:19:30,536 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-17 15:19:30,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-17 15:19:30,590 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-17 15:19:30,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:30,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-11-17 15:19:30,595 INFO L119 LiptonReduction]: Number of co-enabled transitions 3162 [2023-11-17 15:19:40,071 INFO L134 LiptonReduction]: Checked pairs total: 7061 [2023-11-17 15:19:40,071 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-11-17 15:19:40,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:19:40,090 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;@6600d505, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:19:40,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:19:40,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:19:40,093 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-17 15:19:40,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:40,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:40,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:19:40,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:40,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash 952107609, now seen corresponding path program 1 times [2023-11-17 15:19:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904246987] [2023-11-17 15:19:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:40,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:40,578 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 15:19:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904246987] [2023-11-17 15:19:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904246987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:40,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:40,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:19:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100016315] [2023-11-17 15:19:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:40,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:19:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:19:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:19:40,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 286 [2023-11-17 15:19:40,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 15:19:40,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:40,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 286 [2023-11-17 15:19:40,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:42,045 INFO L124 PetriNetUnfolderBase]: 4695/6408 cut-off events. [2023-11-17 15:19:42,046 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-17 15:19:42,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12984 conditions, 6408 events. 4695/6408 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 29916 event pairs, 1277 based on Foata normal form. 0/6148 useless extension candidates. Maximal degree in co-relation 12972. Up to 5107 conditions per place. [2023-11-17 15:19:42,096 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 39 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-17 15:19:42,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 192 flow [2023-11-17 15:19:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:19:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:19:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-17 15:19:42,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198135198135199 [2023-11-17 15:19:42,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-17 15:19:42,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-17 15:19:42,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:42,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-17 15:19:42,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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 15:19:42,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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 15:19:42,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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 15:19:42,131 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 446 transitions. [2023-11-17 15:19:42,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 192 flow [2023-11-17 15:19:42,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:19:42,137 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-11-17 15:19:42,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-17 15:19:42,142 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-17 15:19:42,142 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-11-17 15:19:42,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 15:19:42,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:42,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:42,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:19:42,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:42,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2056117208, now seen corresponding path program 1 times [2023-11-17 15:19:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:42,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263520690] [2023-11-17 15:19:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:42,451 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 15:19:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263520690] [2023-11-17 15:19:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263520690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:42,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:42,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:19:42,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506683569] [2023-11-17 15:19:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:42,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:19:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:42,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:19:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:19:42,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2023-11-17 15:19:42,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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 15:19:42,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:42,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2023-11-17 15:19:42,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:43,613 INFO L124 PetriNetUnfolderBase]: 4087/5672 cut-off events. [2023-11-17 15:19:43,614 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2023-11-17 15:19:43,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11902 conditions, 5672 events. 4087/5672 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 27799 event pairs, 679 based on Foata normal form. 256/5924 useless extension candidates. Maximal degree in co-relation 11892. Up to 4175 conditions per place. [2023-11-17 15:19:43,645 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 39 selfloop transitions, 2 changer transitions 22/64 dead transitions. [2023-11-17 15:19:43,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 64 transitions, 278 flow [2023-11-17 15:19:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:19:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:19:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2023-11-17 15:19:43,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965034965034965 [2023-11-17 15:19:43,650 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2023-11-17 15:19:43,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2023-11-17 15:19:43,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:43,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2023-11-17 15:19:43,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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 15:19:43,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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 15:19:43,658 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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 15:19:43,658 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 5 states and 710 transitions. [2023-11-17 15:19:43,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 64 transitions, 278 flow [2023-11-17 15:19:43,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:19:43,661 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 70 flow [2023-11-17 15:19:43,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, 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=5, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2023-11-17 15:19:43,662 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-17 15:19:43,663 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 70 flow [2023-11-17 15:19:43,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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 15:19:43,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:43,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:43,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:19:43,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:43,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash -684903462, now seen corresponding path program 1 times [2023-11-17 15:19:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:43,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036676981] [2023-11-17 15:19:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:43,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:43,941 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 15:19:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036676981] [2023-11-17 15:19:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036676981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:43,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:19:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900808285] [2023-11-17 15:19:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:43,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:19:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:43,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:19:43,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:19:43,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2023-11-17 15:19:43,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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 15:19:43,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:43,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2023-11-17 15:19:43,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:45,495 INFO L124 PetriNetUnfolderBase]: 6158/8459 cut-off events. [2023-11-17 15:19:45,495 INFO L125 PetriNetUnfolderBase]: For 1021/1021 co-relation queries the response was YES. [2023-11-17 15:19:45,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18487 conditions, 8459 events. 6158/8459 cut-off events. For 1021/1021 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 39198 event pairs, 1135 based on Foata normal form. 240/8699 useless extension candidates. Maximal degree in co-relation 18474. Up to 3496 conditions per place. [2023-11-17 15:19:45,545 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 42 selfloop transitions, 3 changer transitions 28/73 dead transitions. [2023-11-17 15:19:45,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 319 flow [2023-11-17 15:19:45,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:19:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:19:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 831 transitions. [2023-11-17 15:19:45,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48426573426573427 [2023-11-17 15:19:45,548 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 831 transitions. [2023-11-17 15:19:45,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 831 transitions. [2023-11-17 15:19:45,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:45,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 831 transitions. [2023-11-17 15:19:45,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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 15:19:45,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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 15:19:45,555 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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 15:19:45,555 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 70 flow. Second operand 6 states and 831 transitions. [2023-11-17 15:19:45,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 319 flow [2023-11-17 15:19:45,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 309 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 15:19:45,594 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 80 flow [2023-11-17 15:19:45,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-11-17 15:19:45,595 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-11-17 15:19:45,595 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 80 flow [2023-11-17 15:19:45,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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 15:19:45,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:45,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:45,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:19:45,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:45,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash 243278344, now seen corresponding path program 1 times [2023-11-17 15:19:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:45,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864729883] [2023-11-17 15:19:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:45,852 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 15:19:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864729883] [2023-11-17 15:19:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864729883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:19:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773486021] [2023-11-17 15:19:45,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:45,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:19:45,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:45,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:19:45,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:19:45,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2023-11-17 15:19:45,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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 15:19:45,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:45,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2023-11-17 15:19:45,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:46,572 INFO L124 PetriNetUnfolderBase]: 2541/3768 cut-off events. [2023-11-17 15:19:46,572 INFO L125 PetriNetUnfolderBase]: For 1584/1584 co-relation queries the response was YES. [2023-11-17 15:19:46,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8565 conditions, 3768 events. 2541/3768 cut-off events. For 1584/1584 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 18637 event pairs, 438 based on Foata normal form. 144/3912 useless extension candidates. Maximal degree in co-relation 8550. Up to 2656 conditions per place. [2023-11-17 15:19:46,594 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 35 selfloop transitions, 2 changer transitions 18/56 dead transitions. [2023-11-17 15:19:46,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 268 flow [2023-11-17 15:19:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:19:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:19:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-11-17 15:19:46,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2023-11-17 15:19:46,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-11-17 15:19:46,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-11-17 15:19:46,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:46,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-11-17 15:19:46,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 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 15:19:46,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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 15:19:46,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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 15:19:46,603 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 80 flow. Second operand 5 states and 702 transitions. [2023-11-17 15:19:46,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 268 flow [2023-11-17 15:19:46,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 240 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-11-17 15:19:46,609 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 74 flow [2023-11-17 15:19:46,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-11-17 15:19:46,609 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-11-17 15:19:46,610 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 74 flow [2023-11-17 15:19:46,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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 15:19:46,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:46,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:46,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:19:46,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:46,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1740973187, now seen corresponding path program 1 times [2023-11-17 15:19:46,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:46,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785569160] [2023-11-17 15:19:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:47,767 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 15:19:47,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:47,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785569160] [2023-11-17 15:19:47,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785569160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:47,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:47,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:19:47,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583070720] [2023-11-17 15:19:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:47,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:19:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:47,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:19:47,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:19:47,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 286 [2023-11-17 15:19:47,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 74 flow. Second operand has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 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 15:19:47,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:47,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 286 [2023-11-17 15:19:47,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:48,787 INFO L124 PetriNetUnfolderBase]: 3186/4490 cut-off events. [2023-11-17 15:19:48,787 INFO L125 PetriNetUnfolderBase]: For 1183/1183 co-relation queries the response was YES. [2023-11-17 15:19:48,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10131 conditions, 4490 events. 3186/4490 cut-off events. For 1183/1183 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22785 event pairs, 246 based on Foata normal form. 134/4624 useless extension candidates. Maximal degree in co-relation 10118. Up to 2772 conditions per place. [2023-11-17 15:19:48,808 INFO L140 encePairwiseOnDemand]: 275/286 looper letters, 56 selfloop transitions, 11 changer transitions 24/92 dead transitions. [2023-11-17 15:19:48,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 92 transitions, 423 flow [2023-11-17 15:19:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:19:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:19:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 934 transitions. [2023-11-17 15:19:48,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40821678321678323 [2023-11-17 15:19:48,812 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 934 transitions. [2023-11-17 15:19:48,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 934 transitions. [2023-11-17 15:19:48,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:48,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 934 transitions. [2023-11-17 15:19:48,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 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 15:19:48,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 15:19:48,821 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 15:19:48,821 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 74 flow. Second operand 8 states and 934 transitions. [2023-11-17 15:19:48,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 92 transitions, 423 flow [2023-11-17 15:19:48,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 92 transitions, 409 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-17 15:19:48,828 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 155 flow [2023-11-17 15:19:48,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-11-17 15:19:48,829 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-11-17 15:19:48,829 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 155 flow [2023-11-17 15:19:48,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 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 15:19:48,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:48,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:48,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:19:48,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:48,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2061103681, now seen corresponding path program 2 times [2023-11-17 15:19:48,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:48,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211543529] [2023-11-17 15:19:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:49,762 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 15:19:49,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:49,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211543529] [2023-11-17 15:19:49,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211543529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:49,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:49,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:19:49,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883461224] [2023-11-17 15:19:49,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:49,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:19:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:49,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:19:49,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:19:49,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 286 [2023-11-17 15:19:49,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 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 15:19:49,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:49,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 286 [2023-11-17 15:19:49,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:50,679 INFO L124 PetriNetUnfolderBase]: 3121/4435 cut-off events. [2023-11-17 15:19:50,680 INFO L125 PetriNetUnfolderBase]: For 4651/4651 co-relation queries the response was YES. [2023-11-17 15:19:50,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14239 conditions, 4435 events. 3121/4435 cut-off events. For 4651/4651 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21189 event pairs, 1239 based on Foata normal form. 110/4545 useless extension candidates. Maximal degree in co-relation 14222. Up to 3890 conditions per place. [2023-11-17 15:19:50,708 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 58 selfloop transitions, 16 changer transitions 21/96 dead transitions. [2023-11-17 15:19:50,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 632 flow [2023-11-17 15:19:50,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:19:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:19:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 923 transitions. [2023-11-17 15:19:50,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2023-11-17 15:19:50,712 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 923 transitions. [2023-11-17 15:19:50,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 923 transitions. [2023-11-17 15:19:50,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:50,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 923 transitions. [2023-11-17 15:19:50,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.375) internal successors, (923), 8 states have internal predecessors, (923), 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 15:19:50,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 15:19:50,720 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 15:19:50,720 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 155 flow. Second operand 8 states and 923 transitions. [2023-11-17 15:19:50,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 632 flow [2023-11-17 15:19:50,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 96 transitions, 610 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-17 15:19:50,729 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 309 flow [2023-11-17 15:19:50,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=309, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-11-17 15:19:50,730 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-11-17 15:19:50,730 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 309 flow [2023-11-17 15:19:50,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 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 15:19:50,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:50,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:50,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:19:50,731 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:50,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1768304163, now seen corresponding path program 1 times [2023-11-17 15:19:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:50,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087477271] [2023-11-17 15:19:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:50,924 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 15:19:50,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:50,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087477271] [2023-11-17 15:19:50,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087477271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:50,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:19:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367672616] [2023-11-17 15:19:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:50,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:19:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:19:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:19:50,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-11-17 15:19:50,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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 15:19:50,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:50,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-11-17 15:19:50,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:51,461 INFO L124 PetriNetUnfolderBase]: 2013/2921 cut-off events. [2023-11-17 15:19:51,461 INFO L125 PetriNetUnfolderBase]: For 7690/7690 co-relation queries the response was YES. [2023-11-17 15:19:51,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11129 conditions, 2921 events. 2013/2921 cut-off events. For 7690/7690 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13093 event pairs, 405 based on Foata normal form. 95/3016 useless extension candidates. Maximal degree in co-relation 11107. Up to 2598 conditions per place. [2023-11-17 15:19:51,482 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 80 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2023-11-17 15:19:51,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 718 flow [2023-11-17 15:19:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:19:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:19:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-11-17 15:19:51,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49533799533799533 [2023-11-17 15:19:51,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-11-17 15:19:51,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-11-17 15:19:51,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:51,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-11-17 15:19:51,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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 15:19:51,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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 15:19:51,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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 15:19:51,488 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 309 flow. Second operand 3 states and 425 transitions. [2023-11-17 15:19:51,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 718 flow [2023-11-17 15:19:51,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 690 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-17 15:19:51,498 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 324 flow [2023-11-17 15:19:51,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2023-11-17 15:19:51,499 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-11-17 15:19:51,499 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 324 flow [2023-11-17 15:19:51,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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 15:19:51,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:51,499 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 15:19:51,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:19:51,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:51,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 148823348, now seen corresponding path program 1 times [2023-11-17 15:19:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710321941] [2023-11-17 15:19:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:52,670 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 15:19:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710321941] [2023-11-17 15:19:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710321941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:19:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854025908] [2023-11-17 15:19:52,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:52,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:19:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:52,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:19:52,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:19:52,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 286 [2023-11-17 15:19:52,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 324 flow. Second operand has 9 states, 9 states have (on average 105.88888888888889) internal successors, (953), 9 states have internal predecessors, (953), 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 15:19:52,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:52,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 286 [2023-11-17 15:19:52,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:53,476 INFO L124 PetriNetUnfolderBase]: 2275/3344 cut-off events. [2023-11-17 15:19:53,476 INFO L125 PetriNetUnfolderBase]: For 6963/6963 co-relation queries the response was YES. [2023-11-17 15:19:53,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13412 conditions, 3344 events. 2275/3344 cut-off events. For 6963/6963 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15917 event pairs, 823 based on Foata normal form. 86/3430 useless extension candidates. Maximal degree in co-relation 13390. Up to 2090 conditions per place. [2023-11-17 15:19:53,497 INFO L140 encePairwiseOnDemand]: 276/286 looper letters, 73 selfloop transitions, 26 changer transitions 24/124 dead transitions. [2023-11-17 15:19:53,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 124 transitions, 968 flow [2023-11-17 15:19:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:19:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:19:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 922 transitions. [2023-11-17 15:19:53,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40297202797202797 [2023-11-17 15:19:53,501 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 922 transitions. [2023-11-17 15:19:53,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 922 transitions. [2023-11-17 15:19:53,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:53,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 922 transitions. [2023-11-17 15:19:53,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 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 15:19:53,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 15:19:53,507 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 15:19:53,508 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 324 flow. Second operand 8 states and 922 transitions. [2023-11-17 15:19:53,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 124 transitions, 968 flow [2023-11-17 15:19:53,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 124 transitions, 955 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:19:53,516 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 498 flow [2023-11-17 15:19:53,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=498, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2023-11-17 15:19:53,517 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-11-17 15:19:53,517 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 498 flow [2023-11-17 15:19:53,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.88888888888889) internal successors, (953), 9 states have internal predecessors, (953), 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 15:19:53,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:53,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:53,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:19:53,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:53,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1612129877, now seen corresponding path program 1 times [2023-11-17 15:19:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:53,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162430317] [2023-11-17 15:19:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:53,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:53,700 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 15:19:53,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:53,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162430317] [2023-11-17 15:19:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162430317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:53,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:53,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:19:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881311904] [2023-11-17 15:19:53,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:53,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:19:53,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:53,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:19:53,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:19:53,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-11-17 15:19:53,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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 15:19:53,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:53,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-11-17 15:19:53,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:54,054 INFO L124 PetriNetUnfolderBase]: 1123/1743 cut-off events. [2023-11-17 15:19:54,054 INFO L125 PetriNetUnfolderBase]: For 8538/8538 co-relation queries the response was YES. [2023-11-17 15:19:54,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8583 conditions, 1743 events. 1123/1743 cut-off events. For 8538/8538 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7770 event pairs, 171 based on Foata normal form. 138/1878 useless extension candidates. Maximal degree in co-relation 8555. Up to 924 conditions per place. [2023-11-17 15:19:54,065 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 115 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2023-11-17 15:19:54,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 125 transitions, 1299 flow [2023-11-17 15:19:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:19:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:19:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 567 transitions. [2023-11-17 15:19:54,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956293706293706 [2023-11-17 15:19:54,068 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 567 transitions. [2023-11-17 15:19:54,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 567 transitions. [2023-11-17 15:19:54,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:54,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 567 transitions. [2023-11-17 15:19:54,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 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 15:19:54,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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 15:19:54,073 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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 15:19:54,073 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 498 flow. Second operand 4 states and 567 transitions. [2023-11-17 15:19:54,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 125 transitions, 1299 flow [2023-11-17 15:19:54,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 125 transitions, 1197 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-11-17 15:19:54,083 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 506 flow [2023-11-17 15:19:54,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=506, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2023-11-17 15:19:54,084 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2023-11-17 15:19:54,084 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 506 flow [2023-11-17 15:19:54,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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 15:19:54,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:54,086 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] [2023-11-17 15:19:54,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:19:54,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:54,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2061524062, now seen corresponding path program 1 times [2023-11-17 15:19:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219526957] [2023-11-17 15:19:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:54,364 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 15:19:54,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219526957] [2023-11-17 15:19:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219526957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:54,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:19:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059152822] [2023-11-17 15:19:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:54,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:19:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:19:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:19:54,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-11-17 15:19:54,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 506 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 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 15:19:54,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:54,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-11-17 15:19:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:54,707 INFO L124 PetriNetUnfolderBase]: 761/1199 cut-off events. [2023-11-17 15:19:54,708 INFO L125 PetriNetUnfolderBase]: For 5246/5246 co-relation queries the response was YES. [2023-11-17 15:19:54,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5935 conditions, 1199 events. 761/1199 cut-off events. For 5246/5246 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5084 event pairs, 122 based on Foata normal form. 67/1263 useless extension candidates. Maximal degree in co-relation 5908. Up to 499 conditions per place. [2023-11-17 15:19:54,714 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 125 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2023-11-17 15:19:54,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 139 transitions, 1371 flow [2023-11-17 15:19:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:19:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:19:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2023-11-17 15:19:54,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4937062937062937 [2023-11-17 15:19:54,716 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2023-11-17 15:19:54,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2023-11-17 15:19:54,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:54,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2023-11-17 15:19:54,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 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 15:19:54,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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 15:19:54,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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 15:19:54,721 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 506 flow. Second operand 5 states and 706 transitions. [2023-11-17 15:19:54,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 139 transitions, 1371 flow [2023-11-17 15:19:54,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 139 transitions, 1353 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:19:54,731 INFO L231 Difference]: Finished difference. Result has 64 places, 70 transitions, 556 flow [2023-11-17 15:19:54,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=556, PETRI_PLACES=64, PETRI_TRANSITIONS=70} [2023-11-17 15:19:54,733 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-11-17 15:19:54,733 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 70 transitions, 556 flow [2023-11-17 15:19:54,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 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 15:19:54,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:54,734 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 15:19:54,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:19:54,734 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:54,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1796828533, now seen corresponding path program 1 times [2023-11-17 15:19:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826381387] [2023-11-17 15:19:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:56,814 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 15:19:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:56,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826381387] [2023-11-17 15:19:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826381387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:56,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:56,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:19:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955680528] [2023-11-17 15:19:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:56,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:19:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:56,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:19:56,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:19:56,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 286 [2023-11-17 15:19:56,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 70 transitions, 556 flow. Second operand has 10 states, 10 states have (on average 111.2) internal successors, (1112), 10 states have internal predecessors, (1112), 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 15:19:56,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:56,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 286 [2023-11-17 15:19:56,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:57,705 INFO L124 PetriNetUnfolderBase]: 1236/2068 cut-off events. [2023-11-17 15:19:57,705 INFO L125 PetriNetUnfolderBase]: For 8520/8520 co-relation queries the response was YES. [2023-11-17 15:19:57,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10295 conditions, 2068 events. 1236/2068 cut-off events. For 8520/8520 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10999 event pairs, 237 based on Foata normal form. 7/2074 useless extension candidates. Maximal degree in co-relation 10267. Up to 829 conditions per place. [2023-11-17 15:19:57,720 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 146 selfloop transitions, 23 changer transitions 26/196 dead transitions. [2023-11-17 15:19:57,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 196 transitions, 1897 flow [2023-11-17 15:19:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:19:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:19:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions. [2023-11-17 15:19:57,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42657342657342656 [2023-11-17 15:19:57,724 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 976 transitions. [2023-11-17 15:19:57,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 976 transitions. [2023-11-17 15:19:57,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:57,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 976 transitions. [2023-11-17 15:19:57,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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 15:19:57,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 15:19:57,730 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 15:19:57,730 INFO L175 Difference]: Start difference. First operand has 64 places, 70 transitions, 556 flow. Second operand 8 states and 976 transitions. [2023-11-17 15:19:57,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 196 transitions, 1897 flow [2023-11-17 15:19:57,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 196 transitions, 1719 flow, removed 44 selfloop flow, removed 3 redundant places. [2023-11-17 15:19:57,750 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 644 flow [2023-11-17 15:19:57,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2023-11-17 15:19:57,750 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-11-17 15:19:57,751 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 644 flow [2023-11-17 15:19:57,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.2) internal successors, (1112), 10 states have internal predecessors, (1112), 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 15:19:57,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:57,751 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 15:19:57,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:19:57,752 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:57,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 243945105, now seen corresponding path program 2 times [2023-11-17 15:19:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166930703] [2023-11-17 15:19:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:58,045 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 15:19:58,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166930703] [2023-11-17 15:19:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166930703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:58,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:58,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:19:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340262109] [2023-11-17 15:19:58,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:58,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:19:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:19:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:19:58,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-11-17 15:19:58,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 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 15:19:58,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:58,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-11-17 15:19:58,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:58,486 INFO L124 PetriNetUnfolderBase]: 1110/1771 cut-off events. [2023-11-17 15:19:58,486 INFO L125 PetriNetUnfolderBase]: For 10442/10442 co-relation queries the response was YES. [2023-11-17 15:19:58,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9219 conditions, 1771 events. 1110/1771 cut-off events. For 10442/10442 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8886 event pairs, 143 based on Foata normal form. 37/1806 useless extension candidates. Maximal degree in co-relation 9187. Up to 709 conditions per place. [2023-11-17 15:19:58,498 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 133 selfloop transitions, 17 changer transitions 4/155 dead transitions. [2023-11-17 15:19:58,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 155 transitions, 1760 flow [2023-11-17 15:19:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:19:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:19:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2023-11-17 15:19:58,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486013986013986 [2023-11-17 15:19:58,501 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 834 transitions. [2023-11-17 15:19:58,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 834 transitions. [2023-11-17 15:19:58,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:58,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 834 transitions. [2023-11-17 15:19:58,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 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 15:19:58,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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 15:19:58,506 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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 15:19:58,506 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 644 flow. Second operand 6 states and 834 transitions. [2023-11-17 15:19:58,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 155 transitions, 1760 flow [2023-11-17 15:19:58,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 155 transitions, 1636 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-11-17 15:19:58,533 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 610 flow [2023-11-17 15:19:58,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-11-17 15:19:58,534 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-11-17 15:19:58,534 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 610 flow [2023-11-17 15:19:58,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 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 15:19:58,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:58,534 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 15:19:58,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:19:58,535 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:19:58,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:58,535 INFO L85 PathProgramCache]: Analyzing trace with hash 545902803, now seen corresponding path program 1 times [2023-11-17 15:19:58,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:58,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772366669] [2023-11-17 15:19:58,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:58,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:58,954 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 15:19:58,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772366669] [2023-11-17 15:19:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772366669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:58,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:58,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:19:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698974266] [2023-11-17 15:19:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:58,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:19:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:19:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:19:58,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-11-17 15:19:58,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 610 flow. Second operand has 8 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 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 15:19:58,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:58,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-11-17 15:19:58,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:59,939 INFO L124 PetriNetUnfolderBase]: 3147/4938 cut-off events. [2023-11-17 15:19:59,940 INFO L125 PetriNetUnfolderBase]: For 24409/24409 co-relation queries the response was YES. [2023-11-17 15:19:59,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25482 conditions, 4938 events. 3147/4938 cut-off events. For 24409/24409 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 28342 event pairs, 361 based on Foata normal form. 6/4944 useless extension candidates. Maximal degree in co-relation 25454. Up to 1908 conditions per place. [2023-11-17 15:19:59,968 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 139 selfloop transitions, 12 changer transitions 111/262 dead transitions. [2023-11-17 15:19:59,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 262 transitions, 2798 flow [2023-11-17 15:19:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 15:19:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 15:19:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1575 transitions. [2023-11-17 15:19:59,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4589160839160839 [2023-11-17 15:19:59,972 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1575 transitions. [2023-11-17 15:19:59,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1575 transitions. [2023-11-17 15:19:59,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:59,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1575 transitions. [2023-11-17 15:19:59,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 131.25) internal successors, (1575), 12 states have internal predecessors, (1575), 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 15:19:59,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 286.0) internal successors, (3718), 13 states have internal predecessors, (3718), 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 15:19:59,982 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 286.0) internal successors, (3718), 13 states have internal predecessors, (3718), 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 15:19:59,982 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 610 flow. Second operand 12 states and 1575 transitions. [2023-11-17 15:19:59,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 262 transitions, 2798 flow [2023-11-17 15:20:00,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 262 transitions, 2476 flow, removed 92 selfloop flow, removed 6 redundant places. [2023-11-17 15:20:00,068 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 615 flow [2023-11-17 15:20:00,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=615, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2023-11-17 15:20:00,069 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2023-11-17 15:20:00,069 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 615 flow [2023-11-17 15:20:00,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 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 15:20:00,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:00,069 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 15:20:00,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:20:00,070 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:20:00,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 294065791, now seen corresponding path program 2 times [2023-11-17 15:20:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696424416] [2023-11-17 15:20:00,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:02,564 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 15:20:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696424416] [2023-11-17 15:20:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696424416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:02,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-17 15:20:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522577575] [2023-11-17 15:20:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:02,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 15:20:02,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 15:20:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-17 15:20:02,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 286 [2023-11-17 15:20:02,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 615 flow. Second operand has 12 states, 12 states have (on average 101.0) internal successors, (1212), 12 states have internal predecessors, (1212), 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 15:20:02,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:02,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 286 [2023-11-17 15:20:02,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:03,367 INFO L124 PetriNetUnfolderBase]: 1837/3064 cut-off events. [2023-11-17 15:20:03,367 INFO L125 PetriNetUnfolderBase]: For 11940/11956 co-relation queries the response was YES. [2023-11-17 15:20:03,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14427 conditions, 3064 events. 1837/3064 cut-off events. For 11940/11956 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 17629 event pairs, 405 based on Foata normal form. 20/3075 useless extension candidates. Maximal degree in co-relation 14394. Up to 1247 conditions per place. [2023-11-17 15:20:03,380 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 109 selfloop transitions, 17 changer transitions 32/159 dead transitions. [2023-11-17 15:20:03,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 159 transitions, 1430 flow [2023-11-17 15:20:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:20:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:20:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions. [2023-11-17 15:20:03,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2023-11-17 15:20:03,383 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 770 transitions. [2023-11-17 15:20:03,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions. [2023-11-17 15:20:03,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:03,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions. [2023-11-17 15:20:03,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 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 15:20:03,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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 15:20:03,388 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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 15:20:03,388 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 615 flow. Second operand 7 states and 770 transitions. [2023-11-17 15:20:03,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 159 transitions, 1430 flow [2023-11-17 15:20:03,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 159 transitions, 1403 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-17 15:20:03,436 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 650 flow [2023-11-17 15:20:03,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2023-11-17 15:20:03,437 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 39 predicate places. [2023-11-17 15:20:03,437 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 650 flow [2023-11-17 15:20:03,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 101.0) internal successors, (1212), 12 states have internal predecessors, (1212), 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 15:20:03,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:03,438 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 15:20:03,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:20:03,438 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:20:03,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1482535241, now seen corresponding path program 3 times [2023-11-17 15:20:03,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:03,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286616748] [2023-11-17 15:20:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:05,570 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 15:20:05,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:05,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286616748] [2023-11-17 15:20:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286616748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:05,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-17 15:20:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815900266] [2023-11-17 15:20:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:05,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 15:20:05,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:05,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 15:20:05,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-17 15:20:05,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 286 [2023-11-17 15:20:05,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 650 flow. Second operand has 11 states, 11 states have (on average 111.18181818181819) internal successors, (1223), 11 states have internal predecessors, (1223), 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 15:20:05,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:05,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 286 [2023-11-17 15:20:05,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:06,568 INFO L124 PetriNetUnfolderBase]: 2132/3621 cut-off events. [2023-11-17 15:20:06,568 INFO L125 PetriNetUnfolderBase]: For 17551/17567 co-relation queries the response was YES. [2023-11-17 15:20:06,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17866 conditions, 3621 events. 2132/3621 cut-off events. For 17551/17567 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 22157 event pairs, 261 based on Foata normal form. 17/3624 useless extension candidates. Maximal degree in co-relation 17834. Up to 1337 conditions per place. [2023-11-17 15:20:06,581 INFO L140 encePairwiseOnDemand]: 274/286 looper letters, 126 selfloop transitions, 43 changer transitions 14/184 dead transitions. [2023-11-17 15:20:06,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 184 transitions, 1726 flow [2023-11-17 15:20:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:20:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:20:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1185 transitions. [2023-11-17 15:20:06,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4143356643356643 [2023-11-17 15:20:06,584 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1185 transitions. [2023-11-17 15:20:06,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1185 transitions. [2023-11-17 15:20:06,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:06,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1185 transitions. [2023-11-17 15:20:06,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.5) internal successors, (1185), 10 states have internal predecessors, (1185), 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 15:20:06,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 286.0) internal successors, (3146), 11 states have internal predecessors, (3146), 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 15:20:06,591 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 286.0) internal successors, (3146), 11 states have internal predecessors, (3146), 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 15:20:06,591 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 650 flow. Second operand 10 states and 1185 transitions. [2023-11-17 15:20:06,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 184 transitions, 1726 flow [2023-11-17 15:20:06,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 184 transitions, 1683 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-17 15:20:06,651 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 972 flow [2023-11-17 15:20:06,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=972, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2023-11-17 15:20:06,651 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2023-11-17 15:20:06,651 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 972 flow [2023-11-17 15:20:06,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.18181818181819) internal successors, (1223), 11 states have internal predecessors, (1223), 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 15:20:06,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:06,652 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 15:20:06,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:20:06,652 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:20:06,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2062879289, now seen corresponding path program 4 times [2023-11-17 15:20:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173415591] [2023-11-17 15:20:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:09,105 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 15:20:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173415591] [2023-11-17 15:20:09,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173415591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:09,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:09,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-17 15:20:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369925489] [2023-11-17 15:20:09,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:09,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 15:20:09,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:09,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 15:20:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-17 15:20:09,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 286 [2023-11-17 15:20:09,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 972 flow. Second operand has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 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 15:20:09,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:09,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 286 [2023-11-17 15:20:09,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:10,506 INFO L124 PetriNetUnfolderBase]: 3430/5854 cut-off events. [2023-11-17 15:20:10,506 INFO L125 PetriNetUnfolderBase]: For 40917/40943 co-relation queries the response was YES. [2023-11-17 15:20:10,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32122 conditions, 5854 events. 3430/5854 cut-off events. For 40917/40943 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 39606 event pairs, 963 based on Foata normal form. 27/5861 useless extension candidates. Maximal degree in co-relation 32086. Up to 3384 conditions per place. [2023-11-17 15:20:10,533 INFO L140 encePairwiseOnDemand]: 275/286 looper letters, 179 selfloop transitions, 50 changer transitions 17/247 dead transitions. [2023-11-17 15:20:10,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 247 transitions, 2822 flow [2023-11-17 15:20:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 15:20:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 15:20:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1166 transitions. [2023-11-17 15:20:10,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3706293706293706 [2023-11-17 15:20:10,536 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1166 transitions. [2023-11-17 15:20:10,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1166 transitions. [2023-11-17 15:20:10,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:10,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1166 transitions. [2023-11-17 15:20:10,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 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 15:20:10,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 286.0) internal successors, (3432), 12 states have internal predecessors, (3432), 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 15:20:10,543 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 286.0) internal successors, (3432), 12 states have internal predecessors, (3432), 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 15:20:10,543 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 972 flow. Second operand 11 states and 1166 transitions. [2023-11-17 15:20:10,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 247 transitions, 2822 flow [2023-11-17 15:20:10,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 247 transitions, 2768 flow, removed 27 selfloop flow, removed 2 redundant places. [2023-11-17 15:20:10,752 INFO L231 Difference]: Finished difference. Result has 100 places, 127 transitions, 1640 flow [2023-11-17 15:20:10,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1640, PETRI_PLACES=100, PETRI_TRANSITIONS=127} [2023-11-17 15:20:10,752 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 60 predicate places. [2023-11-17 15:20:10,753 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 127 transitions, 1640 flow [2023-11-17 15:20:10,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 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 15:20:10,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:10,753 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 15:20:10,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 15:20:10,753 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:20:10,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash -801873609, now seen corresponding path program 5 times [2023-11-17 15:20:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653874192] [2023-11-17 15:20:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:20:10,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:20:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:20:10,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:20:10,908 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:20:10,908 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:20:10,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:20:10,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:20:10,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:20:10,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:20:10,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:20:10,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:20:10,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 15:20:10,911 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:10,917 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:20:10,917 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:20:10,992 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated [2023-11-17 15:20:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre38 could not be translated [2023-11-17 15:20:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre40 could not be translated [2023-11-17 15:20:10,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre42 could not be translated [2023-11-17 15:20:11,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:20:11 BasicIcfg [2023-11-17 15:20:11,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:20:11,022 INFO L158 Benchmark]: Toolchain (without parser) took 42567.73ms. Allocated memory was 338.7MB in the beginning and 1.2GB in the end (delta: 839.9MB). Free memory was 284.5MB in the beginning and 662.3MB in the end (delta: -377.9MB). Peak memory consumption was 462.6MB. Max. memory is 8.0GB. [2023-11-17 15:20:11,022 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 203.4MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:20:11,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.80ms. Allocated memory is still 338.7MB. Free memory was 284.5MB in the beginning and 258.2MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-11-17 15:20:11,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.12ms. Allocated memory is still 338.7MB. Free memory was 258.2MB in the beginning and 255.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:20:11,023 INFO L158 Benchmark]: Boogie Preprocessor took 63.54ms. Allocated memory is still 338.7MB. Free memory was 255.6MB in the beginning and 253.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:20:11,023 INFO L158 Benchmark]: RCFGBuilder took 1079.36ms. Allocated memory is still 338.7MB. Free memory was 252.5MB in the beginning and 154.4MB in the end (delta: 98.1MB). Peak memory consumption was 98.6MB. Max. memory is 8.0GB. [2023-11-17 15:20:11,023 INFO L158 Benchmark]: TraceAbstraction took 40774.27ms. Allocated memory was 338.7MB in the beginning and 1.2GB in the end (delta: 839.9MB). Free memory was 153.9MB in the beginning and 662.3MB in the end (delta: -508.4MB). Peak memory consumption was 332.5MB. Max. memory is 8.0GB. [2023-11-17 15:20:11,024 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 203.4MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 579.80ms. Allocated memory is still 338.7MB. Free memory was 284.5MB in the beginning and 258.2MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.12ms. Allocated memory is still 338.7MB. Free memory was 258.2MB in the beginning and 255.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.54ms. Allocated memory is still 338.7MB. Free memory was 255.6MB in the beginning and 253.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1079.36ms. Allocated memory is still 338.7MB. Free memory was 252.5MB in the beginning and 154.4MB in the end (delta: 98.1MB). Peak memory consumption was 98.6MB. Max. memory is 8.0GB. * TraceAbstraction took 40774.27ms. Allocated memory was 338.7MB in the beginning and 1.2GB in the end (delta: 839.9MB). Free memory was 153.9MB in the beginning and 662.3MB in the end (delta: -508.4MB). Peak memory consumption was 332.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre42 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: 9.5s, 157 PlacesBefore, 40 PlacesAfterwards, 147 TransitionsBefore, 29 TransitionsAfterwards, 3162 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 7061 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3501, independent: 3312, independent conditional: 0, independent unconditional: 3312, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2218, independent: 2150, independent conditional: 0, independent unconditional: 2150, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2218, independent: 2094, independent conditional: 0, independent unconditional: 2094, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 896, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 829, dependent conditional: 0, dependent unconditional: 829, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3501, independent: 1162, independent conditional: 0, independent unconditional: 1162, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 2218, unknown conditional: 0, unknown unconditional: 2218] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={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] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={7:0}, t2422={8: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] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={7:0}, t2422={8:0}, t2423={5: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] [L890] 0 pthread_t t2424; [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={7:0}, t2422={8:0}, t2423={5:0}, t2424={6: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] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=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=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] 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)))) [L828] EXPR 3 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))) [L828] EXPR 3 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)) [L828] EXPR 3 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) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 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) [L828] EXPR 3 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)) [L828] EXPR 3 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))) [L828] 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)))) [L828] 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)))) [L829] 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)))) [L830] 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)))) [L831] 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)))) [L832] 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)))) [L833] 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)))) [L834] 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)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L845] 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) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] 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) [L845] 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) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 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 [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 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_p0_EBX=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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=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=0, weak$$choice1=0, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L768] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=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=0, weak$$choice1=0, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L862] 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) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] 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) [L862] 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) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 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 [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 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=1, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=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=0, weak$$choice1=0, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 \read(x) [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=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$$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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L809] 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) [L809] 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) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 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=1, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=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$$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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 3 return 0; [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 1 return 0; [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L871] 4 return 0; [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] 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) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] 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) [L897] 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) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 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 [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 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}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, __unbuffered_p2_EBX=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, t2421={7:0}, t2422={8:0}, t2423={5:0}, t2424={6: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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, __unbuffered_p2_EBX=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=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 887]: 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: 885]: 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: 889]: 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: 891]: 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, 184 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 691 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 691 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3516 IncrementalHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 2 mSDtfsCounter, 3516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1640occurred in iteration=16, InterpolantAutomatonStates: 109, 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.8s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 4494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 15:20:11,046 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...