/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/mix014_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:12:57,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:12:57,576 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:12:57,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:12:57,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:12:57,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:12:57,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:12:57,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:12:57,615 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:12:57,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:12:57,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:12:57,616 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:12:57,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:12:57,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:12:57,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:12:57,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:12:57,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:12:57,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:12:57,618 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:12:57,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:12:57,618 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:12:57,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:12:57,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:12:57,622 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:12:57,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:12:57,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:57,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:12:57,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:12:57,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:12:57,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:12:57,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:12:57,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:12:57,626 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:12:57,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:12:57,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:12:57,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:12:57,813 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:12:57,813 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:12:57,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2023-11-17 15:12:58,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:12:59,012 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:12:59,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2023-11-17 15:12:59,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbf9b9b4/c6a50c25a4a542fb94dd51b5389a2cee/FLAGbf0edd9c9 [2023-11-17 15:12:59,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbf9b9b4/c6a50c25a4a542fb94dd51b5389a2cee [2023-11-17 15:12:59,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:12:59,050 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:12:59,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:59,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:12:59,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:12:59,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2ba2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59, skipping insertion in model container [2023-11-17 15:12:59,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,099 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:12:59,205 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/mix014_tso.oepc.i[949,962] [2023-11-17 15:12:59,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:59,454 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:12:59,465 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/mix014_tso.oepc.i[949,962] [2023-11-17 15:12:59,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:59,534 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:59,535 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:59,540 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:12:59,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59 WrapperNode [2023-11-17 15:12:59,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:59,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:59,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:12:59,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:12:59,545 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:12:59" (1/1) ... [2023-11-17 15:12:59,559 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:12:59" (1/1) ... [2023-11-17 15:12:59,586 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 262 [2023-11-17 15:12:59,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:59,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:12:59,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:12:59,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:12:59,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:12:59,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:12:59,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:12:59,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:12:59,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (1/1) ... [2023-11-17 15:12:59,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:12:59,642 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:12:59,655 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:12:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:12:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:12:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:12:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:12:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:12:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:12:59,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:12:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:12:59,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:12:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:12:59,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:12:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:12:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:12:59,675 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:12:59,785 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:12:59,787 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:13:00,164 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:13:00,325 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:13:00,325 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:13:00,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:13:00 BoogieIcfgContainer [2023-11-17 15:13:00,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:13:00,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:13:00,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:13:00,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:13:00,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:59" (1/3) ... [2023-11-17 15:13:00,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710ec5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:00, skipping insertion in model container [2023-11-17 15:13:00,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:59" (2/3) ... [2023-11-17 15:13:00,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710ec5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:00, skipping insertion in model container [2023-11-17 15:13:00,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:13:00" (3/3) ... [2023-11-17 15:13:00,333 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2023-11-17 15:13:00,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:13:00,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-17 15:13:00,345 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:13:00,395 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:13:00,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 156 transitions, 328 flow [2023-11-17 15:13:00,499 INFO L124 PetriNetUnfolderBase]: 3/152 cut-off events. [2023-11-17 15:13:00,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:00,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 152 events. 3/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-11-17 15:13:00,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 156 transitions, 328 flow [2023-11-17 15:13:00,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 152 transitions, 316 flow [2023-11-17 15:13:00,513 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:13:00,525 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 152 transitions, 316 flow [2023-11-17 15:13:00,528 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 152 transitions, 316 flow [2023-11-17 15:13:00,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 152 transitions, 316 flow [2023-11-17 15:13:00,569 INFO L124 PetriNetUnfolderBase]: 3/152 cut-off events. [2023-11-17 15:13:00,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:00,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 152 events. 3/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-11-17 15:13:00,573 INFO L119 LiptonReduction]: Number of co-enabled transitions 3808 [2023-11-17 15:13:06,480 INFO L134 LiptonReduction]: Checked pairs total: 10078 [2023-11-17 15:13:06,481 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-11-17 15:13:06,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:13:06,496 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;@1ca92f55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:13:06,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-17 15:13:06,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:13:06,498 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 15:13:06,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:06,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:06,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:13:06,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:06,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash 740313429, now seen corresponding path program 1 times [2023-11-17 15:13:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59179010] [2023-11-17 15:13:06,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:06,810 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:13:06,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59179010] [2023-11-17 15:13:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59179010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:06,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:06,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:13:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203682804] [2023-11-17 15:13:06,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:06,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:13:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:06,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:13:06,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:13:06,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 291 [2023-11-17 15:13:06,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:13:06,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:06,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 291 [2023-11-17 15:13:06,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:08,120 INFO L124 PetriNetUnfolderBase]: 7695/10465 cut-off events. [2023-11-17 15:13:08,120 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2023-11-17 15:13:08,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21161 conditions, 10465 events. 7695/10465 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 57703 event pairs, 915 based on Foata normal form. 0/9336 useless extension candidates. Maximal degree in co-relation 21149. Up to 9021 conditions per place. [2023-11-17 15:13:08,170 INFO L140 encePairwiseOnDemand]: 287/291 looper letters, 43 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-17 15:13:08,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 206 flow [2023-11-17 15:13:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:13:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:13:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-17 15:13:08,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189003436426117 [2023-11-17 15:13:08,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-17 15:13:08,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-17 15:13:08,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:08,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-17 15:13:08,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 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:13:08,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:13:08,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:13:08,194 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 453 transitions. [2023-11-17 15:13:08,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 206 flow [2023-11-17 15:13:08,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:13:08,199 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2023-11-17 15:13:08,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-11-17 15:13:08,204 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-17 15:13:08,204 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2023-11-17 15:13:08,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:13:08,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:08,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:08,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:13:08,206 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:08,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1523260658, now seen corresponding path program 1 times [2023-11-17 15:13:08,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:08,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735973421] [2023-11-17 15:13:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:08,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:08,315 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:13:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735973421] [2023-11-17 15:13:08,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735973421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:08,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:13:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549929699] [2023-11-17 15:13:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:08,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:13:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:08,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:13:08,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:13:08,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 291 [2023-11-17 15:13:08,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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:13:08,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:08,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 291 [2023-11-17 15:13:08,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:09,289 INFO L124 PetriNetUnfolderBase]: 6067/8861 cut-off events. [2023-11-17 15:13:09,289 INFO L125 PetriNetUnfolderBase]: For 357/357 co-relation queries the response was YES. [2023-11-17 15:13:09,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17711 conditions, 8861 events. 6067/8861 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 51540 event pairs, 1183 based on Foata normal form. 0/8380 useless extension candidates. Maximal degree in co-relation 17701. Up to 6469 conditions per place. [2023-11-17 15:13:09,325 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-11-17 15:13:09,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 196 flow [2023-11-17 15:13:09,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:13:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:13:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-11-17 15:13:09,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5143184421534936 [2023-11-17 15:13:09,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-11-17 15:13:09,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-11-17 15:13:09,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:09,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-11-17 15:13:09,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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:13:09,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:13:09,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:13:09,332 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 449 transitions. [2023-11-17 15:13:09,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 196 flow [2023-11-17 15:13:09,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:09,333 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-11-17 15:13:09,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-11-17 15:13:09,335 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-17 15:13:09,335 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-11-17 15:13:09,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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:13:09,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:09,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:09,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:13:09,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:09,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:09,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1852454545, now seen corresponding path program 1 times [2023-11-17 15:13:09,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:09,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166086283] [2023-11-17 15:13:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:09,678 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:13:09,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:09,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166086283] [2023-11-17 15:13:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166086283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:09,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:09,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:13:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569471830] [2023-11-17 15:13:09,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:09,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:13:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:13:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:13:09,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-11-17 15:13:09,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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:13:09,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:09,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-11-17 15:13:09,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:11,015 INFO L124 PetriNetUnfolderBase]: 10667/14338 cut-off events. [2023-11-17 15:13:11,015 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2023-11-17 15:13:11,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29772 conditions, 14338 events. 10667/14338 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 69220 event pairs, 3035 based on Foata normal form. 300/14638 useless extension candidates. Maximal degree in co-relation 29762. Up to 10723 conditions per place. [2023-11-17 15:13:11,074 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 46 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-17 15:13:11,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 210 flow [2023-11-17 15:13:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:13:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:13:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-11-17 15:13:11,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46849942726231386 [2023-11-17 15:13:11,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-11-17 15:13:11,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-11-17 15:13:11,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:11,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-11-17 15:13:11,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:13:11,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:13:11,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:13:11,078 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 409 transitions. [2023-11-17 15:13:11,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 210 flow [2023-11-17 15:13:11,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:11,083 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 74 flow [2023-11-17 15:13:11,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-11-17 15:13:11,084 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-17 15:13:11,084 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 74 flow [2023-11-17 15:13:11,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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:13:11,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:11,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:11,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:13:11,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:11,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2058172060, now seen corresponding path program 1 times [2023-11-17 15:13:11,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:11,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106915584] [2023-11-17 15:13:11,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:11,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:11,248 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:13:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106915584] [2023-11-17 15:13:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106915584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:11,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:11,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:13:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283444018] [2023-11-17 15:13:11,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:11,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:13:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:11,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:13:11,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:13:11,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 291 [2023-11-17 15:13:11,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:13:11,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:11,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 291 [2023-11-17 15:13:11,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:11,893 INFO L124 PetriNetUnfolderBase]: 5123/7317 cut-off events. [2023-11-17 15:13:11,893 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2023-11-17 15:13:11,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 7317 events. 5123/7317 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 37889 event pairs, 2099 based on Foata normal form. 128/7424 useless extension candidates. Maximal degree in co-relation 15317. Up to 4209 conditions per place. [2023-11-17 15:13:11,916 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 37 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-17 15:13:11,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 181 flow [2023-11-17 15:13:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:13:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:13:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-11-17 15:13:11,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063001145475372 [2023-11-17 15:13:11,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-11-17 15:13:11,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-11-17 15:13:11,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:11,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-11-17 15:13:11,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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:13:11,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:13:11,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:13:11,921 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 74 flow. Second operand 3 states and 442 transitions. [2023-11-17 15:13:11,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 181 flow [2023-11-17 15:13:11,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 175 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:11,923 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 78 flow [2023-11-17 15:13:11,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-17 15:13:11,923 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-17 15:13:11,924 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 78 flow [2023-11-17 15:13:11,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:13:11,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:11,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:11,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:13:11,924 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:11,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 381638251, now seen corresponding path program 1 times [2023-11-17 15:13:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:11,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526092375] [2023-11-17 15:13:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:12,126 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:13:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526092375] [2023-11-17 15:13:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526092375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:13:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346472349] [2023-11-17 15:13:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:12,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:13:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:12,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:13:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:13:12,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2023-11-17 15:13:12,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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:13:12,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:12,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2023-11-17 15:13:12,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:12,773 INFO L124 PetriNetUnfolderBase]: 3898/5660 cut-off events. [2023-11-17 15:13:12,774 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-17 15:13:12,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12075 conditions, 5660 events. 3898/5660 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30019 event pairs, 794 based on Foata normal form. 384/5973 useless extension candidates. Maximal degree in co-relation 12063. Up to 3487 conditions per place. [2023-11-17 15:13:12,793 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 40 selfloop transitions, 5 changer transitions 29/78 dead transitions. [2023-11-17 15:13:12,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 333 flow [2023-11-17 15:13:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:13:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:13:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2023-11-17 15:13:12,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488659793814433 [2023-11-17 15:13:12,796 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2023-11-17 15:13:12,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2023-11-17 15:13:12,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:12,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2023-11-17 15:13:12,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 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:13:12,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:13:12,800 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:13:12,800 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 78 flow. Second operand 5 states and 711 transitions. [2023-11-17 15:13:12,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 333 flow [2023-11-17 15:13:12,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:12,802 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 119 flow [2023-11-17 15:13:12,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-11-17 15:13:12,803 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-11-17 15:13:12,803 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 119 flow [2023-11-17 15:13:12,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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:13:12,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:12,804 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:13:12,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:13:12,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:12,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash 828239304, now seen corresponding path program 1 times [2023-11-17 15:13:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:12,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019102308] [2023-11-17 15:13:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:13,035 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:13:13,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:13,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019102308] [2023-11-17 15:13:13,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019102308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:13,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:13,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:13:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079170345] [2023-11-17 15:13:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:13,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:13:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:13,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:13:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:13:13,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2023-11-17 15:13:13,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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:13:13,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:13,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2023-11-17 15:13:13,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:13,616 INFO L124 PetriNetUnfolderBase]: 2305/3527 cut-off events. [2023-11-17 15:13:13,616 INFO L125 PetriNetUnfolderBase]: For 1100/1100 co-relation queries the response was YES. [2023-11-17 15:13:13,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9589 conditions, 3527 events. 2305/3527 cut-off events. For 1100/1100 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 18470 event pairs, 531 based on Foata normal form. 249/3745 useless extension candidates. Maximal degree in co-relation 9574. Up to 1071 conditions per place. [2023-11-17 15:13:13,631 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 54 selfloop transitions, 9 changer transitions 29/96 dead transitions. [2023-11-17 15:13:13,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 96 transitions, 493 flow [2023-11-17 15:13:13,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:13:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:13:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions. [2023-11-17 15:13:13,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49026345933562426 [2023-11-17 15:13:13,634 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 856 transitions. [2023-11-17 15:13:13,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 856 transitions. [2023-11-17 15:13:13,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:13,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 856 transitions. [2023-11-17 15:13:13,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 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:13:13,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:13:13,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:13:13,638 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 119 flow. Second operand 6 states and 856 transitions. [2023-11-17 15:13:13,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 96 transitions, 493 flow [2023-11-17 15:13:13,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 96 transitions, 486 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:13,648 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 184 flow [2023-11-17 15:13:13,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-17 15:13:13,649 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2023-11-17 15:13:13,649 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 184 flow [2023-11-17 15:13:13,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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:13:13,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:13,653 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] [2023-11-17 15:13:13,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:13:13,653 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:13,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1661765565, now seen corresponding path program 1 times [2023-11-17 15:13:13,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:13,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429449308] [2023-11-17 15:13:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:13,997 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:13:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429449308] [2023-11-17 15:13:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429449308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:13:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993736460] [2023-11-17 15:13:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:13:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:13:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:13:13,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2023-11-17 15:13:14,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 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:13:14,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:14,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2023-11-17 15:13:14,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:14,359 INFO L124 PetriNetUnfolderBase]: 1513/2384 cut-off events. [2023-11-17 15:13:14,359 INFO L125 PetriNetUnfolderBase]: For 1975/1975 co-relation queries the response was YES. [2023-11-17 15:13:14,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7049 conditions, 2384 events. 1513/2384 cut-off events. For 1975/1975 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11997 event pairs, 487 based on Foata normal form. 87/2443 useless extension candidates. Maximal degree in co-relation 7031. Up to 820 conditions per place. [2023-11-17 15:13:14,370 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 66 selfloop transitions, 13 changer transitions 29/112 dead transitions. [2023-11-17 15:13:14,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 112 transitions, 667 flow [2023-11-17 15:13:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:13:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:13:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 999 transitions. [2023-11-17 15:13:14,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49042709867452133 [2023-11-17 15:13:14,372 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 999 transitions. [2023-11-17 15:13:14,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 999 transitions. [2023-11-17 15:13:14,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:14,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 999 transitions. [2023-11-17 15:13:14,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.71428571428572) internal successors, (999), 7 states have internal predecessors, (999), 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:13:14,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 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:13:14,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 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:13:14,377 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 184 flow. Second operand 7 states and 999 transitions. [2023-11-17 15:13:14,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 112 transitions, 667 flow [2023-11-17 15:13:14,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 112 transitions, 605 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-17 15:13:14,390 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 234 flow [2023-11-17 15:13:14,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-11-17 15:13:14,390 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2023-11-17 15:13:14,390 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 234 flow [2023-11-17 15:13:14,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 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:13:14,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:14,391 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:13:14,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:13:14,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:14,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash -141329211, now seen corresponding path program 1 times [2023-11-17 15:13:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:14,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687564324] [2023-11-17 15:13:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:14,782 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:13:14,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:14,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687564324] [2023-11-17 15:13:14,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687564324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:14,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:14,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:13:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236757324] [2023-11-17 15:13:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:14,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:13:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:14,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:13:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:13:14,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 291 [2023-11-17 15:13:14,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 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:13:14,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:14,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 291 [2023-11-17 15:13:14,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:15,404 INFO L124 PetriNetUnfolderBase]: 3692/5409 cut-off events. [2023-11-17 15:13:15,404 INFO L125 PetriNetUnfolderBase]: For 5274/5274 co-relation queries the response was YES. [2023-11-17 15:13:15,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15336 conditions, 5409 events. 3692/5409 cut-off events. For 5274/5274 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 25732 event pairs, 672 based on Foata normal form. 13/5422 useless extension candidates. Maximal degree in co-relation 15317. Up to 3445 conditions per place. [2023-11-17 15:13:15,424 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 84 selfloop transitions, 11 changer transitions 26/121 dead transitions. [2023-11-17 15:13:15,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 121 transitions, 865 flow [2023-11-17 15:13:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:13:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:13:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-11-17 15:13:15,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581901489117984 [2023-11-17 15:13:15,427 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-11-17 15:13:15,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-11-17 15:13:15,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:15,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-11-17 15:13:15,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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:13:15,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:13:15,431 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:13:15,431 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 234 flow. Second operand 6 states and 800 transitions. [2023-11-17 15:13:15,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 121 transitions, 865 flow [2023-11-17 15:13:15,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 121 transitions, 725 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-11-17 15:13:15,485 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 257 flow [2023-11-17 15:13:15,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2023-11-17 15:13:15,487 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-11-17 15:13:15,487 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 257 flow [2023-11-17 15:13:15,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 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:13:15,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:15,490 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:13:15,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:13:15,490 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:15,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1051331637, now seen corresponding path program 2 times [2023-11-17 15:13:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184403144] [2023-11-17 15:13:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:16,948 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:13:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184403144] [2023-11-17 15:13:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184403144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:13:16,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366546624] [2023-11-17 15:13:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:16,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:13:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:13:16,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:13:16,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2023-11-17 15:13:16,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 257 flow. Second operand has 10 states, 10 states have (on average 127.3) internal successors, (1273), 10 states have internal predecessors, (1273), 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:13:16,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:16,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2023-11-17 15:13:16,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:18,067 INFO L124 PetriNetUnfolderBase]: 5182/8018 cut-off events. [2023-11-17 15:13:18,067 INFO L125 PetriNetUnfolderBase]: For 7231/7251 co-relation queries the response was YES. [2023-11-17 15:13:18,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23908 conditions, 8018 events. 5182/8018 cut-off events. For 7231/7251 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 48585 event pairs, 309 based on Foata normal form. 13/7806 useless extension candidates. Maximal degree in co-relation 23887. Up to 2887 conditions per place. [2023-11-17 15:13:18,096 INFO L140 encePairwiseOnDemand]: 282/291 looper letters, 150 selfloop transitions, 19 changer transitions 9/186 dead transitions. [2023-11-17 15:13:18,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 186 transitions, 1212 flow [2023-11-17 15:13:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:13:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:13:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1126 transitions. [2023-11-17 15:13:18,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4836769759450172 [2023-11-17 15:13:18,100 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1126 transitions. [2023-11-17 15:13:18,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1126 transitions. [2023-11-17 15:13:18,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:18,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1126 transitions. [2023-11-17 15:13:18,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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:13:18,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 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:13:18,105 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 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:13:18,105 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 257 flow. Second operand 8 states and 1126 transitions. [2023-11-17 15:13:18,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 186 transitions, 1212 flow [2023-11-17 15:13:18,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 186 transitions, 1212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:13:18,179 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 397 flow [2023-11-17 15:13:18,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-11-17 15:13:18,180 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2023-11-17 15:13:18,180 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 397 flow [2023-11-17 15:13:18,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.3) internal successors, (1273), 10 states have internal predecessors, (1273), 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:13:18,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:18,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:18,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:13:18,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:18,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1825357430, now seen corresponding path program 1 times [2023-11-17 15:13:18,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:18,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873736329] [2023-11-17 15:13:18,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:18,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:18,367 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:13:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873736329] [2023-11-17 15:13:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873736329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:13:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524690571] [2023-11-17 15:13:18,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:18,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:13:18,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:18,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:13:18,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:13:18,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 291 [2023-11-17 15:13:18,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 397 flow. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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:13:18,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:18,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 291 [2023-11-17 15:13:18,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:19,494 INFO L124 PetriNetUnfolderBase]: 7524/11756 cut-off events. [2023-11-17 15:13:19,494 INFO L125 PetriNetUnfolderBase]: For 25920/26062 co-relation queries the response was YES. [2023-11-17 15:13:19,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46101 conditions, 11756 events. 7524/11756 cut-off events. For 25920/26062 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 75704 event pairs, 1719 based on Foata normal form. 132/11760 useless extension candidates. Maximal degree in co-relation 46072. Up to 5444 conditions per place. [2023-11-17 15:13:19,548 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 99 selfloop transitions, 3 changer transitions 32/139 dead transitions. [2023-11-17 15:13:19,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 139 transitions, 1146 flow [2023-11-17 15:13:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:13:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:13:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-11-17 15:13:19,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991408934707904 [2023-11-17 15:13:19,550 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-11-17 15:13:19,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-11-17 15:13:19,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:19,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-11-17 15:13:19,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 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:13:19,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:13:19,553 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:13:19,553 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 397 flow. Second operand 4 states and 581 transitions. [2023-11-17 15:13:19,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 139 transitions, 1146 flow [2023-11-17 15:13:19,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 139 transitions, 1146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:13:19,713 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 420 flow [2023-11-17 15:13:19,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=420, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2023-11-17 15:13:19,713 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-11-17 15:13:19,713 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 420 flow [2023-11-17 15:13:19,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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:13:19,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:19,714 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:13:19,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:13:19,714 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:19,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash -286618459, now seen corresponding path program 3 times [2023-11-17 15:13:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:19,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701794325] [2023-11-17 15:13:19,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:19,939 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:13:19,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:19,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701794325] [2023-11-17 15:13:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701794325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:19,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:13:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658741325] [2023-11-17 15:13:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:19,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:13:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:19,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:13:19,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:13:19,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2023-11-17 15:13:19,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 420 flow. Second operand has 7 states, 7 states have (on average 130.14285714285714) internal successors, (911), 7 states have internal predecessors, (911), 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:13:19,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:19,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2023-11-17 15:13:19,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:21,162 INFO L124 PetriNetUnfolderBase]: 6647/10333 cut-off events. [2023-11-17 15:13:21,163 INFO L125 PetriNetUnfolderBase]: For 25400/25587 co-relation queries the response was YES. [2023-11-17 15:13:21,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40963 conditions, 10333 events. 6647/10333 cut-off events. For 25400/25587 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 67870 event pairs, 1129 based on Foata normal form. 255/10237 useless extension candidates. Maximal degree in co-relation 40931. Up to 4241 conditions per place. [2023-11-17 15:13:21,192 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 79 selfloop transitions, 17 changer transitions 42/144 dead transitions. [2023-11-17 15:13:21,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 144 transitions, 1132 flow [2023-11-17 15:13:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:13:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:13:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1112 transitions. [2023-11-17 15:13:21,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47766323024054985 [2023-11-17 15:13:21,195 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1112 transitions. [2023-11-17 15:13:21,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1112 transitions. [2023-11-17 15:13:21,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:21,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1112 transitions. [2023-11-17 15:13:21,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.0) internal successors, (1112), 8 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:13:21,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 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:13:21,200 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 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:13:21,200 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 420 flow. Second operand 8 states and 1112 transitions. [2023-11-17 15:13:21,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 144 transitions, 1132 flow [2023-11-17 15:13:21,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 144 transitions, 1088 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-17 15:13:21,473 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 376 flow [2023-11-17 15:13:21,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=81, PETRI_TRANSITIONS=56} [2023-11-17 15:13:21,474 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2023-11-17 15:13:21,474 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 376 flow [2023-11-17 15:13:21,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.14285714285714) internal successors, (911), 7 states have internal predecessors, (911), 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:13:21,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:21,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:21,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:13:21,475 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:21,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1795527001, now seen corresponding path program 1 times [2023-11-17 15:13:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:21,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387462264] [2023-11-17 15:13:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:21,859 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:13:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387462264] [2023-11-17 15:13:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387462264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:21,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:21,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:13:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018653953] [2023-11-17 15:13:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:21,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:13:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:13:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:13:21,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 291 [2023-11-17 15:13:21,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 56 transitions, 376 flow. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 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:13:21,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:21,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 291 [2023-11-17 15:13:21,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:22,574 INFO L124 PetriNetUnfolderBase]: 3580/5728 cut-off events. [2023-11-17 15:13:22,575 INFO L125 PetriNetUnfolderBase]: For 16027/16144 co-relation queries the response was YES. [2023-11-17 15:13:22,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23394 conditions, 5728 events. 3580/5728 cut-off events. For 16027/16144 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 35061 event pairs, 1110 based on Foata normal form. 15/5558 useless extension candidates. Maximal degree in co-relation 23360. Up to 2536 conditions per place. [2023-11-17 15:13:22,593 INFO L140 encePairwiseOnDemand]: 286/291 looper letters, 80 selfloop transitions, 9 changer transitions 45/140 dead transitions. [2023-11-17 15:13:22,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 140 transitions, 1218 flow [2023-11-17 15:13:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:13:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:13:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2023-11-17 15:13:22,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49140893470790376 [2023-11-17 15:13:22,597 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 858 transitions. [2023-11-17 15:13:22,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 858 transitions. [2023-11-17 15:13:22,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:22,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 858 transitions. [2023-11-17 15:13:22,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 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:13:22,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:13:22,601 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:13:22,601 INFO L175 Difference]: Start difference. First operand has 81 places, 56 transitions, 376 flow. Second operand 6 states and 858 transitions. [2023-11-17 15:13:22,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 140 transitions, 1218 flow [2023-11-17 15:13:22,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 140 transitions, 1057 flow, removed 33 selfloop flow, removed 9 redundant places. [2023-11-17 15:13:22,666 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 384 flow [2023-11-17 15:13:22,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2023-11-17 15:13:22,667 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-11-17 15:13:22,667 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 384 flow [2023-11-17 15:13:22,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 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:13:22,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:22,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:22,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:13:22,667 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:22,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:22,668 INFO L85 PathProgramCache]: Analyzing trace with hash -408090895, now seen corresponding path program 2 times [2023-11-17 15:13:22,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:22,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638831791] [2023-11-17 15:13:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:22,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:13:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:22,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:13:22,880 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:13:22,881 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-11-17 15:13:22,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-11-17 15:13:22,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-11-17 15:13:22,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-11-17 15:13:22,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-11-17 15:13:22,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-11-17 15:13:22,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-11-17 15:13:22,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-11-17 15:13:22,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-11-17 15:13:22,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:13:22,883 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:22,887 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:13:22,887 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:13:22,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:13:22,945 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:13:22,951 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:13:22,959 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-17 15:13:22,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:13:22 BasicIcfg [2023-11-17 15:13:22,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:13:22,982 INFO L158 Benchmark]: Toolchain (without parser) took 23931.66ms. Allocated memory was 291.5MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 237.0MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 346.9MB. Max. memory is 8.0GB. [2023-11-17 15:13:22,982 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 223.3MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:13:22,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.36ms. Allocated memory is still 291.5MB. Free memory was 237.0MB in the beginning and 208.9MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-11-17 15:13:22,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.19ms. Allocated memory is still 291.5MB. Free memory was 208.6MB in the beginning and 204.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-11-17 15:13:22,982 INFO L158 Benchmark]: Boogie Preprocessor took 32.14ms. Allocated memory is still 291.5MB. Free memory was 204.8MB in the beginning and 202.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:22,982 INFO L158 Benchmark]: RCFGBuilder took 706.73ms. Allocated memory is still 291.5MB. Free memory was 202.3MB in the beginning and 193.3MB in the end (delta: 9.0MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2023-11-17 15:13:22,983 INFO L158 Benchmark]: TraceAbstraction took 22652.48ms. Allocated memory was 291.5MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 192.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 300.7MB. Max. memory is 8.0GB. [2023-11-17 15:13:22,983 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.12ms. Allocated memory is still 223.3MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.36ms. Allocated memory is still 291.5MB. Free memory was 237.0MB in the beginning and 208.9MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.19ms. Allocated memory is still 291.5MB. Free memory was 208.6MB in the beginning and 204.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.14ms. Allocated memory is still 291.5MB. Free memory was 204.8MB in the beginning and 202.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 706.73ms. Allocated memory is still 291.5MB. Free memory was 202.3MB in the beginning and 193.3MB in the end (delta: 9.0MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * TraceAbstraction took 22652.48ms. Allocated memory was 291.5MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 192.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 300.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 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: 6.0s, 162 PlacesBefore, 45 PlacesAfterwards, 152 TransitionsBefore, 33 TransitionsAfterwards, 3808 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 10078 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3998, independent: 3760, independent conditional: 0, independent unconditional: 3760, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2510, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2510, independent: 2416, independent conditional: 0, independent unconditional: 2416, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 583, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 546, dependent conditional: 0, dependent unconditional: 546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3998, independent: 1320, independent conditional: 0, independent unconditional: 1320, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 2510, unknown conditional: 0, unknown unconditional: 2510] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool y$flush_delayed; [L748] 0 int y$mem_tmp; [L749] 0 _Bool y$r_buff0_thd0; [L750] 0 _Bool y$r_buff0_thd1; [L751] 0 _Bool y$r_buff0_thd2; [L752] 0 _Bool y$r_buff0_thd3; [L753] 0 _Bool y$r_buff0_thd4; [L754] 0 _Bool y$r_buff1_thd0; [L755] 0 _Bool y$r_buff1_thd1; [L756] 0 _Bool y$r_buff1_thd2; [L757] 0 _Bool y$r_buff1_thd3; [L758] 0 _Bool y$r_buff1_thd4; [L759] 0 _Bool y$read_delayed; [L760] 0 int *y$read_delayed_var; [L761] 0 int y$w_buff0; [L762] 0 _Bool y$w_buff0_used; [L763] 0 int y$w_buff1; [L764] 0 _Bool y$w_buff1_used; [L766] 0 int z = 0; [L767] 0 _Bool weak$$choice0; [L768] 0 _Bool weak$$choice2; [L922] 0 pthread_t t377; [L923] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t377={6:0}, weak$$choice0=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L924] 0 pthread_t t378; [L925] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t377={6:0}, t378={7:0}, weak$$choice0=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L926] 0 pthread_t t379; [L792] 2 x$w_buff1 = x$w_buff0 [L793] 2 x$w_buff0 = 2 [L794] 2 x$w_buff1_used = x$w_buff0_used [L795] 2 x$w_buff0_used = (_Bool)1 [L796] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L796] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L797] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L798] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L799] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L800] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L801] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L802] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L927] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t377={6:0}, t378={7:0}, t379={8:0}, weak$$choice0=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L805] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 2 x$flush_delayed = weak$$choice2 [L808] 2 x$mem_tmp = x [L809] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L810] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L811] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L812] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L813] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L815] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L816] 2 __unbuffered_p1_EAX = x [L817] 2 x = x$flush_delayed ? x$mem_tmp : x [L818] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L928] 0 pthread_t t380; [L821] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 2 y$flush_delayed = weak$$choice2 [L824] 2 y$mem_tmp = y [L825] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L826] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L827] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L828] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L829] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L830] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L831] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L832] 2 __unbuffered_p1_EBX = y [L833] 2 y = y$flush_delayed ? y$mem_tmp : y [L834] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L929] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t377={6:0}, t378={7:0}, t379={8:0}, t380={5: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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L851] 3 y$w_buff1 = y$w_buff0 [L852] 3 y$w_buff0 = 1 [L853] 3 y$w_buff1_used = y$w_buff0_used [L854] 3 y$w_buff0_used = (_Bool)1 [L855] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L855] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L856] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L857] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L858] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L859] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L860] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L861] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L886] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L867] 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) [L868] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L869] 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 [L870] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L871] 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 [L872] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L873] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L874] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L875] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L876] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L889] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L892] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L895] 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) [L896] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L897] 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 [L898] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L899] 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 [L900] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L901] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L902] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L903] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L904] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L772] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L775] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L837] 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) [L838] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L841] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L778] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L779] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L780] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L781] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L782] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L844] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 2 return 0; [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L879] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L881] 3 return 0; [L907] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L909] 4 return 0; [L931] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L933] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L933] RET 0 assume_abort_if_not(main$tmp_guard0) [L935] 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) [L936] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L937] 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 [L938] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L939] 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 [L940] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L941] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L942] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L943] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L944] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t377={6:0}, t378={7:0}, t379={8:0}, t380={5: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L947] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L948] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L949] 0 x$flush_delayed = weak$$choice2 [L950] 0 x$mem_tmp = x [L951] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L952] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L953] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L954] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L955] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L957] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L958] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L962] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 925]: 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: 927]: 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: 929]: 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: 923]: 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, 194 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1535 IncrementalHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 16 mSDtfsCounter, 1535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=10, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:13:23,008 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...