/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/mix029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:14:36,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:14:36,680 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:14:36,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:14:36,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:14:36,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:14:36,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:14:36,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:14:36,719 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:14:36,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:14:36,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:14:36,724 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:14:36,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:14:36,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:14:36,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:14:36,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:14:36,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:14:36,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:14:36,726 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:14:36,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:14:36,727 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:14:36,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:14:36,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:14:36,728 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:14:36,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:14:36,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:14:36,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:14:36,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:14:36,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:14:36,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:14:36,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:14:36,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:14:36,732 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:14:37,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:14:37,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:14:37,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:14:37,083 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:14:37,084 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:14:37,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-17 15:14:38,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:14:39,004 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:14:39,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-17 15:14:39,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc91ca55/2dc10dd6c964487ea2dc8dcaeb455f9f/FLAG0aa351041 [2023-11-17 15:14:39,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc91ca55/2dc10dd6c964487ea2dc8dcaeb455f9f [2023-11-17 15:14:39,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:14:39,032 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:14:39,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:14:39,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:14:39,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:14:39,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31dc98ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39, skipping insertion in model container [2023-11-17 15:14:39,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,096 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:14:39,239 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-17 15:14:39,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:14:39,460 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:14:39,472 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-17 15:14:39,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:14:39,552 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:14:39,552 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:14:39,558 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:14:39,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39 WrapperNode [2023-11-17 15:14:39,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:14:39,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:14:39,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:14:39,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:14:39,566 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:14:39" (1/1) ... [2023-11-17 15:14:39,583 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:14:39" (1/1) ... [2023-11-17 15:14:39,609 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-11-17 15:14:39,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:14:39,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:14:39,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:14:39,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:14:39,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:14:39,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:14:39,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:14:39,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:14:39,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (1/1) ... [2023-11-17 15:14:39,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:14:39,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:14:39,878 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:14:39,880 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:14:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:14:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:14:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:14:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:14:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:14:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:14:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:14:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:14:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:14:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:14:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:14:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:14:39,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:14:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:14:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:14:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:14:39,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:14:39,905 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:14:40,040 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:14:40,042 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:14:40,392 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:14:40,543 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:14:40,543 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:14:40,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:14:40 BoogieIcfgContainer [2023-11-17 15:14:40,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:14:40,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:14:40,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:14:40,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:14:40,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:14:39" (1/3) ... [2023-11-17 15:14:40,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5954f5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:14:40, skipping insertion in model container [2023-11-17 15:14:40,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:39" (2/3) ... [2023-11-17 15:14:40,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5954f5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:14:40, skipping insertion in model container [2023-11-17 15:14:40,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:14:40" (3/3) ... [2023-11-17 15:14:40,553 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-11-17 15:14:40,565 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:14:40,565 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:14:40,565 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:14:40,624 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:14:40,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 282 flow [2023-11-17 15:14:40,730 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-11-17 15:14:40,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:40,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-17 15:14:40,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 282 flow [2023-11-17 15:14:40,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-11-17 15:14:40,745 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:14:40,757 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-11-17 15:14:40,760 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-11-17 15:14:40,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-11-17 15:14:40,788 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-11-17 15:14:40,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:40,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-17 15:14:40,791 INFO L119 LiptonReduction]: Number of co-enabled transitions 3376 [2023-11-17 15:14:45,838 INFO L134 LiptonReduction]: Checked pairs total: 8427 [2023-11-17 15:14:45,838 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-17 15:14:45,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:14:45,863 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;@69bfc769, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:14:45,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:14:45,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:14:45,867 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-17 15:14:45,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:45,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:45,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:45,869 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:45,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -786611899, now seen corresponding path program 1 times [2023-11-17 15:14:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:45,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451885078] [2023-11-17 15:14:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:46,340 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:14:46,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:46,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451885078] [2023-11-17 15:14:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451885078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:14:46,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994488314] [2023-11-17 15:14:46,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:46,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:14:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:46,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:14:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:14:46,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 246 [2023-11-17 15:14:46,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:14:46,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:46,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 246 [2023-11-17 15:14:46,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:47,345 INFO L124 PetriNetUnfolderBase]: 4695/6691 cut-off events. [2023-11-17 15:14:47,345 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-17 15:14:47,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13267 conditions, 6691 events. 4695/6691 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 35044 event pairs, 1287 based on Foata normal form. 0/6383 useless extension candidates. Maximal degree in co-relation 13255. Up to 5041 conditions per place. [2023-11-17 15:14:47,394 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-17 15:14:47,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 187 flow [2023-11-17 15:14:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:14:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:14:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-11-17 15:14:47,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392953929539296 [2023-11-17 15:14:47,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-11-17 15:14:47,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-11-17 15:14:47,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:47,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-11-17 15:14:47,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 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:14:47,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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:14:47,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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:14:47,437 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 398 transitions. [2023-11-17 15:14:47,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 187 flow [2023-11-17 15:14:47,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:14:47,445 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-17 15:14:47,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, 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=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-17 15:14:47,450 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-17 15:14:47,450 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-17 15:14:47,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:14:47,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:47,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:47,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:14:47,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:47,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash 390774999, now seen corresponding path program 1 times [2023-11-17 15:14:47,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293429575] [2023-11-17 15:14:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:47,988 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:14:47,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:47,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293429575] [2023-11-17 15:14:47,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293429575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:47,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:47,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829128101] [2023-11-17 15:14:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:47,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:47,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-11-17 15:14:47,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:47,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:47,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-11-17 15:14:47,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:49,030 INFO L124 PetriNetUnfolderBase]: 5461/7774 cut-off events. [2023-11-17 15:14:49,031 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2023-11-17 15:14:49,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15970 conditions, 7774 events. 5461/7774 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 40719 event pairs, 1959 based on Foata normal form. 320/8050 useless extension candidates. Maximal degree in co-relation 15960. Up to 6175 conditions per place. [2023-11-17 15:14:49,079 INFO L140 encePairwiseOnDemand]: 241/246 looper letters, 37 selfloop transitions, 3 changer transitions 23/66 dead transitions. [2023-11-17 15:14:49,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 66 transitions, 280 flow [2023-11-17 15:14:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:14:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:14:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2023-11-17 15:14:49,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2023-11-17 15:14:49,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 620 transitions. [2023-11-17 15:14:49,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 620 transitions. [2023-11-17 15:14:49,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:49,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 620 transitions. [2023-11-17 15:14:49,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:49,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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:14:49,089 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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:14:49,089 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 5 states and 620 transitions. [2023-11-17 15:14:49,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 66 transitions, 280 flow [2023-11-17 15:14:49,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:49,093 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 91 flow [2023-11-17 15:14:49,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-11-17 15:14:49,094 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-11-17 15:14:49,094 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 91 flow [2023-11-17 15:14:49,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:49,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:49,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:49,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:14:49,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:49,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash -770893614, now seen corresponding path program 1 times [2023-11-17 15:14:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:49,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939253510] [2023-11-17 15:14:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939253510] [2023-11-17 15:14:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939253510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:49,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:49,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:49,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23651415] [2023-11-17 15:14:49,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:49,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:14:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:49,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:14:49,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:14:49,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 246 [2023-11-17 15:14:49,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 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:14:49,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:49,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 246 [2023-11-17 15:14:49,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:51,466 INFO L124 PetriNetUnfolderBase]: 10519/14260 cut-off events. [2023-11-17 15:14:51,466 INFO L125 PetriNetUnfolderBase]: For 5287/5287 co-relation queries the response was YES. [2023-11-17 15:14:51,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33069 conditions, 14260 events. 10519/14260 cut-off events. For 5287/5287 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 67492 event pairs, 3675 based on Foata normal form. 504/14764 useless extension candidates. Maximal degree in co-relation 33056. Up to 12017 conditions per place. [2023-11-17 15:14:51,570 INFO L140 encePairwiseOnDemand]: 236/246 looper letters, 48 selfloop transitions, 12 changer transitions 25/85 dead transitions. [2023-11-17 15:14:51,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 403 flow [2023-11-17 15:14:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:14:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:14:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2023-11-17 15:14:51,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2023-11-17 15:14:51,573 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2023-11-17 15:14:51,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2023-11-17 15:14:51,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:51,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2023-11-17 15:14:51,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 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:14:51,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:14:51,579 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:14:51,579 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 91 flow. Second operand 6 states and 696 transitions. [2023-11-17 15:14:51,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 403 flow [2023-11-17 15:14:51,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 85 transitions, 394 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:51,665 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 184 flow [2023-11-17 15:14:51,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-11-17 15:14:51,667 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-11-17 15:14:51,667 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 184 flow [2023-11-17 15:14:51,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 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:14:51,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:51,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:51,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:14:51,668 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:51,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1656853871, now seen corresponding path program 1 times [2023-11-17 15:14:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100568320] [2023-11-17 15:14:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:52,458 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:14:52,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100568320] [2023-11-17 15:14:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100568320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:52,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:52,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:52,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112442252] [2023-11-17 15:14:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:52,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:14:52,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:52,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:14:52,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:14:52,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 246 [2023-11-17 15:14:52,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 0 states have call successors, (0), 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:14:52,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:52,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 246 [2023-11-17 15:14:52,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:54,454 INFO L124 PetriNetUnfolderBase]: 14063/19020 cut-off events. [2023-11-17 15:14:54,454 INFO L125 PetriNetUnfolderBase]: For 20812/20812 co-relation queries the response was YES. [2023-11-17 15:14:54,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55134 conditions, 19020 events. 14063/19020 cut-off events. For 20812/20812 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 95211 event pairs, 1764 based on Foata normal form. 690/19710 useless extension candidates. Maximal degree in co-relation 55118. Up to 11254 conditions per place. [2023-11-17 15:14:54,573 INFO L140 encePairwiseOnDemand]: 233/246 looper letters, 74 selfloop transitions, 30 changer transitions 53/157 dead transitions. [2023-11-17 15:14:54,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 157 transitions, 924 flow [2023-11-17 15:14:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:14:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:14:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1143 transitions. [2023-11-17 15:14:54,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46463414634146344 [2023-11-17 15:14:54,576 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1143 transitions. [2023-11-17 15:14:54,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1143 transitions. [2023-11-17 15:14:54,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:54,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1143 transitions. [2023-11-17 15:14:54,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.3) internal successors, (1143), 10 states have internal predecessors, (1143), 0 states have call successors, (0), 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:14:54,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 246.0) internal successors, (2706), 11 states have internal predecessors, (2706), 0 states have call successors, (0), 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:14:54,586 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 246.0) internal successors, (2706), 11 states have internal predecessors, (2706), 0 states have call successors, (0), 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:14:54,586 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 184 flow. Second operand 10 states and 1143 transitions. [2023-11-17 15:14:54,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 157 transitions, 924 flow [2023-11-17 15:14:54,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 157 transitions, 914 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-17 15:14:54,727 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 488 flow [2023-11-17 15:14:54,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=488, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2023-11-17 15:14:54,730 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-11-17 15:14:54,730 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 488 flow [2023-11-17 15:14:54,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 0 states have call successors, (0), 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:14:54,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:54,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:54,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:14:54,731 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:54,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1872068710, now seen corresponding path program 1 times [2023-11-17 15:14:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480981786] [2023-11-17 15:14:54,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:55,646 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:14:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480981786] [2023-11-17 15:14:55,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480981786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:55,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:55,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289299897] [2023-11-17 15:14:55,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:55,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:55,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:55,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:55,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:55,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 246 [2023-11-17 15:14:55,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 488 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 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:14:55,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:55,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 246 [2023-11-17 15:14:55,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:57,726 INFO L124 PetriNetUnfolderBase]: 13097/17794 cut-off events. [2023-11-17 15:14:57,727 INFO L125 PetriNetUnfolderBase]: For 61196/61196 co-relation queries the response was YES. [2023-11-17 15:14:57,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77781 conditions, 17794 events. 13097/17794 cut-off events. For 61196/61196 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 87687 event pairs, 2752 based on Foata normal form. 738/18532 useless extension candidates. Maximal degree in co-relation 77756. Up to 10039 conditions per place. [2023-11-17 15:14:57,899 INFO L140 encePairwiseOnDemand]: 235/246 looper letters, 84 selfloop transitions, 15 changer transitions 52/151 dead transitions. [2023-11-17 15:14:57,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 151 transitions, 1411 flow [2023-11-17 15:14:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 790 transitions. [2023-11-17 15:14:57,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45876887340301975 [2023-11-17 15:14:57,903 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 790 transitions. [2023-11-17 15:14:57,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 790 transitions. [2023-11-17 15:14:57,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:57,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 790 transitions. [2023-11-17 15:14:57,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:57,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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:14:57,909 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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:14:57,909 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 488 flow. Second operand 7 states and 790 transitions. [2023-11-17 15:14:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 151 transitions, 1411 flow [2023-11-17 15:14:58,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 151 transitions, 1352 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-11-17 15:14:58,130 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 611 flow [2023-11-17 15:14:58,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-11-17 15:14:58,132 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-11-17 15:14:58,132 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 611 flow [2023-11-17 15:14:58,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 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:14:58,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:58,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:14:58,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:58,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1530269714, now seen corresponding path program 1 times [2023-11-17 15:14:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707418773] [2023-11-17 15:14:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:58,636 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:14:58,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707418773] [2023-11-17 15:14:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707418773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:58,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:58,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052229147] [2023-11-17 15:14:58,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:58,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:14:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:58,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:14:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:14:58,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 246 [2023-11-17 15:14:58,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 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:14:58,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:58,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 246 [2023-11-17 15:14:58,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:00,874 INFO L124 PetriNetUnfolderBase]: 10862/15169 cut-off events. [2023-11-17 15:15:00,875 INFO L125 PetriNetUnfolderBase]: For 79786/81063 co-relation queries the response was YES. [2023-11-17 15:15:00,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73611 conditions, 15169 events. 10862/15169 cut-off events. For 79786/81063 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 81579 event pairs, 2220 based on Foata normal form. 1147/15888 useless extension candidates. Maximal degree in co-relation 73581. Up to 11541 conditions per place. [2023-11-17 15:15:01,120 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 85 selfloop transitions, 22 changer transitions 32/154 dead transitions. [2023-11-17 15:15:01,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 154 transitions, 1575 flow [2023-11-17 15:15:01,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2023-11-17 15:15:01,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491869918699187 [2023-11-17 15:15:01,123 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2023-11-17 15:15:01,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2023-11-17 15:15:01,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:01,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2023-11-17 15:15:01,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 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:15:01,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:01,130 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:01,130 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 611 flow. Second operand 6 states and 726 transitions. [2023-11-17 15:15:01,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 154 transitions, 1575 flow [2023-11-17 15:15:01,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 154 transitions, 1564 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:01,224 INFO L231 Difference]: Finished difference. Result has 71 places, 92 transitions, 943 flow [2023-11-17 15:15:01,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=71, PETRI_TRANSITIONS=92} [2023-11-17 15:15:01,227 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-11-17 15:15:01,228 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 92 transitions, 943 flow [2023-11-17 15:15:01,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 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:15:01,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:01,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:01,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:15:01,229 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:01,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1571216486, now seen corresponding path program 2 times [2023-11-17 15:15:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179486306] [2023-11-17 15:15:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:01,713 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:15:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179486306] [2023-11-17 15:15:01,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179486306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:01,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:01,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200688945] [2023-11-17 15:15:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:01,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:01,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:01,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-11-17 15:15:01,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 92 transitions, 943 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 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:15:01,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:01,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-11-17 15:15:01,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:03,541 INFO L124 PetriNetUnfolderBase]: 10806/15161 cut-off events. [2023-11-17 15:15:03,542 INFO L125 PetriNetUnfolderBase]: For 107729/108869 co-relation queries the response was YES. [2023-11-17 15:15:03,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80183 conditions, 15161 events. 10806/15161 cut-off events. For 107729/108869 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 82368 event pairs, 2248 based on Foata normal form. 1038/15767 useless extension candidates. Maximal degree in co-relation 80149. Up to 10870 conditions per place. [2023-11-17 15:15:03,653 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 76 selfloop transitions, 38 changer transitions 33/162 dead transitions. [2023-11-17 15:15:03,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 162 transitions, 1856 flow [2023-11-17 15:15:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-11-17 15:15:03,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020325203252033 [2023-11-17 15:15:03,655 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-11-17 15:15:03,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-11-17 15:15:03,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:03,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-11-17 15:15:03,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 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:15:03,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:03,660 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:03,661 INFO L175 Difference]: Start difference. First operand has 71 places, 92 transitions, 943 flow. Second operand 6 states and 741 transitions. [2023-11-17 15:15:03,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 162 transitions, 1856 flow [2023-11-17 15:15:03,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 162 transitions, 1836 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:03,883 INFO L231 Difference]: Finished difference. Result has 75 places, 99 transitions, 1168 flow [2023-11-17 15:15:03,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1168, PETRI_PLACES=75, PETRI_TRANSITIONS=99} [2023-11-17 15:15:03,884 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2023-11-17 15:15:03,884 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 99 transitions, 1168 flow [2023-11-17 15:15:03,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 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:15:03,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:03,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:03,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:15:03,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:03,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1011421893, now seen corresponding path program 1 times [2023-11-17 15:15:03,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:03,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247630947] [2023-11-17 15:15:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:04,444 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:15:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247630947] [2023-11-17 15:15:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247630947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067123012] [2023-11-17 15:15:04,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:04,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:04,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:04,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:04,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 246 [2023-11-17 15:15:04,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 99 transitions, 1168 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 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:15:04,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:04,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 246 [2023-11-17 15:15:04,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:06,919 INFO L124 PetriNetUnfolderBase]: 12129/16498 cut-off events. [2023-11-17 15:15:06,920 INFO L125 PetriNetUnfolderBase]: For 111043/111043 co-relation queries the response was YES. [2023-11-17 15:15:07,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88081 conditions, 16498 events. 12129/16498 cut-off events. For 111043/111043 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 80470 event pairs, 2157 based on Foata normal form. 290/16788 useless extension candidates. Maximal degree in co-relation 88044. Up to 13755 conditions per place. [2023-11-17 15:15:07,304 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 119 selfloop transitions, 26 changer transitions 34/179 dead transitions. [2023-11-17 15:15:07,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 179 transitions, 2102 flow [2023-11-17 15:15:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:15:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:15:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 916 transitions. [2023-11-17 15:15:07,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654471544715447 [2023-11-17 15:15:07,308 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 916 transitions. [2023-11-17 15:15:07,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 916 transitions. [2023-11-17 15:15:07,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:07,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 916 transitions. [2023-11-17 15:15:07,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.5) internal successors, (916), 8 states have internal predecessors, (916), 0 states have call successors, (0), 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:15:07,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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:15:07,323 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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:15:07,323 INFO L175 Difference]: Start difference. First operand has 75 places, 99 transitions, 1168 flow. Second operand 8 states and 916 transitions. [2023-11-17 15:15:07,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 179 transitions, 2102 flow [2023-11-17 15:15:07,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 179 transitions, 2029 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:07,514 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 1234 flow [2023-11-17 15:15:07,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1234, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2023-11-17 15:15:07,515 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-11-17 15:15:07,515 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 1234 flow [2023-11-17 15:15:07,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 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:15:07,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:07,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:07,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:15:07,516 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:07,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash -787523741, now seen corresponding path program 1 times [2023-11-17 15:15:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156638481] [2023-11-17 15:15:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:08,200 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:15:08,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156638481] [2023-11-17 15:15:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156638481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:08,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983049666] [2023-11-17 15:15:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:08,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:15:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:08,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:15:08,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:15:08,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 246 [2023-11-17 15:15:08,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 1234 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 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:15:08,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:08,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 246 [2023-11-17 15:15:08,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:10,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L864-->L18: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd0~0_102 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd0~0_104 256) 0))) (let ((.cse11 (not .cse10)) (.cse8 (and .cse10 (= (mod v_~y$w_buff1_used~0_198 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0)) (.cse9 (and .cse10 .cse4))) (let ((.cse1 (or .cse8 .cse12 .cse9)) (.cse2 (and .cse11 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~y~0_154 (ite .cse2 v_~y$w_buff0~0_120 v_~y$w_buff1~0_112))) (.cse0 (not (= (mod v_~weak$$choice2~0_50 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_197 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_225 256) 0))) (and (= v_~y$w_buff0_used~0_225 (ite .cse0 v_~y$w_buff0_used~0_226 (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse2 0 v_~y$w_buff0_used~0_226)))) (= v_~y~0_153 (ite .cse0 v_~y$mem_tmp~0_34 .cse3)) (= v_~main$tmp_guard1~0_28 (ite (= (ite (not (and (= .cse3 2) (= v_~z~0_45 2) (= 2 v_~__unbuffered_p3_EAX~0_30) (= v_~__unbuffered_p0_EAX~0_30 0) (= 0 v_~__unbuffered_p3_EBX~0_32))) 1 0) 0) 0 1)) (= v_~y$r_buff1_thd0~0_101 (ite .cse0 v_~y$r_buff1_thd0~0_102 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_103 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) v_~y$r_buff1_thd0~0_102 0))) (= (mod v_~main$tmp_guard1~0_28 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= 0 v_~y$flush_delayed~0_39) (= (ite .cse0 v_~y$w_buff1_used~0_198 (ite (or .cse6 .cse8 .cse9) v_~y$w_buff1_used~0_198 0)) v_~y$w_buff1_used~0_197) (= v_~y~0_154 v_~y$mem_tmp~0_34) (= v_~y$r_buff0_thd0~0_103 (ite .cse0 v_~y$r_buff0_thd0~0_104 (ite (or .cse6 .cse9 (and .cse10 .cse7)) v_~y$r_buff0_thd0~0_104 (ite (and (not .cse6) .cse11) 0 v_~y$r_buff0_thd0~0_104)))) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= v_~y$w_buff0~0_119 v_~y$w_buff0~0_120)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ~z~0=v_~z~0_45, ~y~0=v_~y~0_154, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_198} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_36|, ~weak$$choice0~0=v_~weak$$choice0~0_23, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_103, ~y$w_buff0~0=v_~y$w_buff0~0_119, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~z~0=v_~z~0_45, ~y~0=v_~y~0_153, ~weak$$choice2~0=v_~weak$$choice2~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_101, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][150], [Black: 247#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 251#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0)), 201#true, Black: 249#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0)), Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 181#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 191#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 176#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 260#true, P3Thread1of1ForFork0InUse, 177#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 209#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 203#(= ~__unbuffered_p3_EAX~0 0), 242#true, 45#L822true, Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 153#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 120#L769true, Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 224#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 219#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 162#true, 100#L18true, 53#P2EXITtrue, Black: 169#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0)), 217#true, Black: 234#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~y$w_buff0_used~0 1)), 115#L756true, Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$w_buff0_used~0 1)), Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-11-17 15:15:10,371 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:15:10,371 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:15:10,371 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:15:10,371 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:15:10,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L822-->L829: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_119 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_118 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_118 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_119)) (= v_~y~0_77 (ite .cse4 v_~y$w_buff0~0_51 (ite .cse3 v_~y$w_buff1~0_56 v_~y~0_78))) (= v_~y$w_buff0_used~0_135 (ite .cse4 0 v_~y$w_buff0_used~0_136)) (= v_~y$r_buff0_thd4~0_29 (ite .cse2 0 v_~y$r_buff0_thd4~0_30))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][136], [Black: 247#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0)), Black: 251#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 201#true, Black: 249#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0)), Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 181#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 191#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 176#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 260#true, P3Thread1of1ForFork0InUse, 177#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 209#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 203#(= ~__unbuffered_p3_EAX~0 0), 242#true, Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 120#L769true, Black: 153#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 224#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 219#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 162#true, 53#P2EXITtrue, 117#L864true, Black: 169#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0)), 217#true, Black: 234#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~y$w_buff0_used~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$w_buff0_used~0 1)), 115#L756true, 12#L829true, Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-11-17 15:15:10,371 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:15:10,371 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:15:10,371 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:15:10,371 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:15:10,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L864-->L18: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd0~0_102 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd0~0_104 256) 0))) (let ((.cse11 (not .cse10)) (.cse8 (and .cse10 (= (mod v_~y$w_buff1_used~0_198 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0)) (.cse9 (and .cse10 .cse4))) (let ((.cse1 (or .cse8 .cse12 .cse9)) (.cse2 (and .cse11 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~y~0_154 (ite .cse2 v_~y$w_buff0~0_120 v_~y$w_buff1~0_112))) (.cse0 (not (= (mod v_~weak$$choice2~0_50 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_197 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_225 256) 0))) (and (= v_~y$w_buff0_used~0_225 (ite .cse0 v_~y$w_buff0_used~0_226 (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse2 0 v_~y$w_buff0_used~0_226)))) (= v_~y~0_153 (ite .cse0 v_~y$mem_tmp~0_34 .cse3)) (= v_~main$tmp_guard1~0_28 (ite (= (ite (not (and (= .cse3 2) (= v_~z~0_45 2) (= 2 v_~__unbuffered_p3_EAX~0_30) (= v_~__unbuffered_p0_EAX~0_30 0) (= 0 v_~__unbuffered_p3_EBX~0_32))) 1 0) 0) 0 1)) (= v_~y$r_buff1_thd0~0_101 (ite .cse0 v_~y$r_buff1_thd0~0_102 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_103 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) v_~y$r_buff1_thd0~0_102 0))) (= (mod v_~main$tmp_guard1~0_28 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= 0 v_~y$flush_delayed~0_39) (= (ite .cse0 v_~y$w_buff1_used~0_198 (ite (or .cse6 .cse8 .cse9) v_~y$w_buff1_used~0_198 0)) v_~y$w_buff1_used~0_197) (= v_~y~0_154 v_~y$mem_tmp~0_34) (= v_~y$r_buff0_thd0~0_103 (ite .cse0 v_~y$r_buff0_thd0~0_104 (ite (or .cse6 .cse9 (and .cse10 .cse7)) v_~y$r_buff0_thd0~0_104 (ite (and (not .cse6) .cse11) 0 v_~y$r_buff0_thd0~0_104)))) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= v_~y$w_buff0~0_119 v_~y$w_buff0~0_120)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ~z~0=v_~z~0_45, ~y~0=v_~y~0_154, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_198} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_36|, ~weak$$choice0~0=v_~weak$$choice0~0_23, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_103, ~y$w_buff0~0=v_~y$w_buff0~0_119, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~z~0=v_~z~0_45, ~y~0=v_~y~0_153, ~weak$$choice2~0=v_~weak$$choice2~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_101, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][150], [Black: 247#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 251#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0)), 201#true, Black: 249#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0)), Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), 114#P0EXITtrue, Black: 181#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 191#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 176#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 260#true, P3Thread1of1ForFork0InUse, 177#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 209#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 203#(= ~__unbuffered_p3_EAX~0 0), 242#true, 45#L822true, Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 153#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 120#L769true, Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 224#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 219#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 162#true, 100#L18true, 53#P2EXITtrue, Black: 169#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0)), 217#true, Black: 234#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~y$w_buff0_used~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$w_buff0_used~0 1)), Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-11-17 15:15:10,463 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-17 15:15:10,463 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:15:10,463 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:15:10,463 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:15:10,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L822-->L829: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_119 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_118 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_118 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_119)) (= v_~y~0_77 (ite .cse4 v_~y$w_buff0~0_51 (ite .cse3 v_~y$w_buff1~0_56 v_~y~0_78))) (= v_~y$w_buff0_used~0_135 (ite .cse4 0 v_~y$w_buff0_used~0_136)) (= v_~y$r_buff0_thd4~0_29 (ite .cse2 0 v_~y$r_buff0_thd4~0_30))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][136], [Black: 247#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0)), Black: 251#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 201#true, Black: 249#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0)), Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), 114#P0EXITtrue, Black: 181#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 191#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 176#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 260#true, P3Thread1of1ForFork0InUse, 177#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 209#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 203#(= ~__unbuffered_p3_EAX~0 0), 242#true, Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 120#L769true, Black: 153#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 224#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 219#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 162#true, 53#P2EXITtrue, 117#L864true, Black: 169#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0)), 217#true, Black: 234#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~y$w_buff0_used~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$w_buff0_used~0 1)), 12#L829true, Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-11-17 15:15:10,463 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-17 15:15:10,463 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:15:10,463 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:15:10,463 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:15:10,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L769-->L776: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_32 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_30 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_103 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~y~0_61 (ite .cse0 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_46 v_~y~0_62))) (= v_~y$w_buff1_used~0_102 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_103)) (= (ite .cse0 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$r_buff0_thd2~0_31 (ite .cse2 0 v_~y$r_buff0_thd2~0_32)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_31 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_30) v_~y$r_buff1_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_30, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_32, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][79], [Black: 247#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 201#true, 113#L776true, Black: 183#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0)), Black: 251#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 249#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0)), Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 181#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 191#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 176#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 260#true, P3Thread1of1ForFork0InUse, 177#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 209#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 203#(= ~__unbuffered_p3_EAX~0 0), 242#true, 45#L822true, Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 153#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 224#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 219#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 162#true, 53#P2EXITtrue, Black: 169#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 117#L864true, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0)), 217#true, Black: 234#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~y$w_buff0_used~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$w_buff0_used~0 1)), 115#L756true, Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-11-17 15:15:10,488 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-17 15:15:10,488 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-17 15:15:10,488 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-17 15:15:10,488 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-17 15:15:10,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L769-->L776: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_32 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_30 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_103 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~y~0_61 (ite .cse0 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_46 v_~y~0_62))) (= v_~y$w_buff1_used~0_102 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_103)) (= (ite .cse0 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$r_buff0_thd2~0_31 (ite .cse2 0 v_~y$r_buff0_thd2~0_32)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_31 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_30) v_~y$r_buff1_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_30, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_32, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][79], [Black: 247#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 201#true, 113#L776true, Black: 251#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0)), Black: 249#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0)), Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), 114#P0EXITtrue, Black: 181#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 191#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 176#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 260#true, P3Thread1of1ForFork0InUse, 177#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 209#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 203#(= ~__unbuffered_p3_EAX~0 0), 242#true, 45#L822true, Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 153#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 224#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0) (= ~y$w_buff0_used~0 1)), Black: 219#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 162#true, 53#P2EXITtrue, 117#L864true, Black: 169#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 ~y$w_buff1~0)), 217#true, Black: 234#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~y$w_buff0_used~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$w_buff0_used~0 1)), Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-11-17 15:15:10,549 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-11-17 15:15:10,549 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-17 15:15:10,549 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-17 15:15:10,549 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-17 15:15:10,751 INFO L124 PetriNetUnfolderBase]: 12223/17246 cut-off events. [2023-11-17 15:15:10,751 INFO L125 PetriNetUnfolderBase]: For 169249/170259 co-relation queries the response was YES. [2023-11-17 15:15:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102313 conditions, 17246 events. 12223/17246 cut-off events. For 169249/170259 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 96788 event pairs, 1777 based on Foata normal form. 836/17684 useless extension candidates. Maximal degree in co-relation 102272. Up to 10940 conditions per place. [2023-11-17 15:15:10,872 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 112 selfloop transitions, 30 changer transitions 39/196 dead transitions. [2023-11-17 15:15:10,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 196 transitions, 2397 flow [2023-11-17 15:15:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:15:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:15:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2023-11-17 15:15:10,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4905149051490515 [2023-11-17 15:15:10,875 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2023-11-17 15:15:10,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2023-11-17 15:15:10,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:10,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2023-11-17 15:15:10,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 0 states have call successors, (0), 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:15:10,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 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:15:10,882 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 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:15:10,882 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 1234 flow. Second operand 9 states and 1086 transitions. [2023-11-17 15:15:10,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 196 transitions, 2397 flow [2023-11-17 15:15:11,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 196 transitions, 2300 flow, removed 41 selfloop flow, removed 5 redundant places. [2023-11-17 15:15:11,376 INFO L231 Difference]: Finished difference. Result has 88 places, 112 transitions, 1428 flow [2023-11-17 15:15:11,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1428, PETRI_PLACES=88, PETRI_TRANSITIONS=112} [2023-11-17 15:15:11,377 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2023-11-17 15:15:11,377 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 112 transitions, 1428 flow [2023-11-17 15:15:11,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 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:15:11,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:11,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:11,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:15:11,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:11,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 48578284, now seen corresponding path program 1 times [2023-11-17 15:15:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218272646] [2023-11-17 15:15:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:11,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:11,925 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:15:11,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218272646] [2023-11-17 15:15:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218272646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775684648] [2023-11-17 15:15:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:11,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:15:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:15:11,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:15:11,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 246 [2023-11-17 15:15:11,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 112 transitions, 1428 flow. Second operand has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 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:15:11,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:11,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 246 [2023-11-17 15:15:11,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:14,464 INFO L124 PetriNetUnfolderBase]: 14893/20264 cut-off events. [2023-11-17 15:15:14,465 INFO L125 PetriNetUnfolderBase]: For 166859/166859 co-relation queries the response was YES. [2023-11-17 15:15:14,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114321 conditions, 20264 events. 14893/20264 cut-off events. For 166859/166859 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 103848 event pairs, 3294 based on Foata normal form. 276/20540 useless extension candidates. Maximal degree in co-relation 114277. Up to 13252 conditions per place. [2023-11-17 15:15:14,643 INFO L140 encePairwiseOnDemand]: 234/246 looper letters, 97 selfloop transitions, 70 changer transitions 36/203 dead transitions. [2023-11-17 15:15:14,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 203 transitions, 2747 flow [2023-11-17 15:15:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:15:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:15:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 906 transitions. [2023-11-17 15:15:14,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2023-11-17 15:15:14,646 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 906 transitions. [2023-11-17 15:15:14,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 906 transitions. [2023-11-17 15:15:14,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:14,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 906 transitions. [2023-11-17 15:15:14,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 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:15:14,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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:15:14,652 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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:15:14,653 INFO L175 Difference]: Start difference. First operand has 88 places, 112 transitions, 1428 flow. Second operand 8 states and 906 transitions. [2023-11-17 15:15:14,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 203 transitions, 2747 flow [2023-11-17 15:15:15,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 203 transitions, 2568 flow, removed 67 selfloop flow, removed 6 redundant places. [2023-11-17 15:15:15,316 INFO L231 Difference]: Finished difference. Result has 91 places, 135 transitions, 1969 flow [2023-11-17 15:15:15,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1969, PETRI_PLACES=91, PETRI_TRANSITIONS=135} [2023-11-17 15:15:15,317 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2023-11-17 15:15:15,318 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 135 transitions, 1969 flow [2023-11-17 15:15:15,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 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:15:15,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:15,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:15,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:15:15,318 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:15,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash -147957861, now seen corresponding path program 1 times [2023-11-17 15:15:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:15,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795390373] [2023-11-17 15:15:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:15,462 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:15:15,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:15,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795390373] [2023-11-17 15:15:15,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795390373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:15,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:15,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:15:15,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684865278] [2023-11-17 15:15:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:15,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:15,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:15,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:15,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:15,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-11-17 15:15:15,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 135 transitions, 1969 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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:15:15,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:15,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-11-17 15:15:15,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:16,942 INFO L124 PetriNetUnfolderBase]: 7361/10419 cut-off events. [2023-11-17 15:15:16,943 INFO L125 PetriNetUnfolderBase]: For 166204/171737 co-relation queries the response was YES. [2023-11-17 15:15:16,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68914 conditions, 10419 events. 7361/10419 cut-off events. For 166204/171737 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 56475 event pairs, 1291 based on Foata normal form. 1419/11222 useless extension candidates. Maximal degree in co-relation 68868. Up to 8085 conditions per place. [2023-11-17 15:15:17,020 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 164 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2023-11-17 15:15:17,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 206 transitions, 3309 flow [2023-11-17 15:15:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-17 15:15:17,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5176151761517616 [2023-11-17 15:15:17,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-17 15:15:17,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-17 15:15:17,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:17,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-17 15:15:17,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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:15:17,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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:15:17,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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:15:17,025 INFO L175 Difference]: Start difference. First operand has 91 places, 135 transitions, 1969 flow. Second operand 3 states and 382 transitions. [2023-11-17 15:15:17,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 206 transitions, 3309 flow [2023-11-17 15:15:17,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 206 transitions, 3250 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:17,204 INFO L231 Difference]: Finished difference. Result has 89 places, 137 transitions, 1934 flow [2023-11-17 15:15:17,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1934, PETRI_PLACES=89, PETRI_TRANSITIONS=137} [2023-11-17 15:15:17,205 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2023-11-17 15:15:17,205 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 137 transitions, 1934 flow [2023-11-17 15:15:17,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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:15:17,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:17,205 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:15:17,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:15:17,206 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:17,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash 956422178, now seen corresponding path program 1 times [2023-11-17 15:15:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:17,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288527224] [2023-11-17 15:15:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:17,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:17,342 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:15:17,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288527224] [2023-11-17 15:15:17,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288527224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:17,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686797257] [2023-11-17 15:15:17,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:17,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:17,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:17,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:17,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:17,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-11-17 15:15:17,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 137 transitions, 1934 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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:15:17,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:17,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-11-17 15:15:17,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:18,194 INFO L124 PetriNetUnfolderBase]: 3760/5617 cut-off events. [2023-11-17 15:15:18,195 INFO L125 PetriNetUnfolderBase]: For 74713/76525 co-relation queries the response was YES. [2023-11-17 15:15:18,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37276 conditions, 5617 events. 3760/5617 cut-off events. For 74713/76525 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 29718 event pairs, 434 based on Foata normal form. 778/6251 useless extension candidates. Maximal degree in co-relation 37229. Up to 2751 conditions per place. [2023-11-17 15:15:18,241 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 203 selfloop transitions, 9 changer transitions 0/245 dead transitions. [2023-11-17 15:15:18,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 245 transitions, 3870 flow [2023-11-17 15:15:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-11-17 15:15:18,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193089430894309 [2023-11-17 15:15:18,243 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-11-17 15:15:18,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-11-17 15:15:18,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:18,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-11-17 15:15:18,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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:15:18,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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:15:18,246 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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:15:18,246 INFO L175 Difference]: Start difference. First operand has 89 places, 137 transitions, 1934 flow. Second operand 4 states and 511 transitions. [2023-11-17 15:15:18,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 245 transitions, 3870 flow [2023-11-17 15:15:18,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 245 transitions, 3861 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:18,360 INFO L231 Difference]: Finished difference. Result has 92 places, 130 transitions, 1799 flow [2023-11-17 15:15:18,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1799, PETRI_PLACES=92, PETRI_TRANSITIONS=130} [2023-11-17 15:15:18,361 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2023-11-17 15:15:18,361 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 130 transitions, 1799 flow [2023-11-17 15:15:18,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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:15:18,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:18,362 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:15:18,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:15:18,362 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:18,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1192880836, now seen corresponding path program 1 times [2023-11-17 15:15:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604742381] [2023-11-17 15:15:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:18,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:18,519 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:15:18,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:18,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604742381] [2023-11-17 15:15:18,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604742381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:18,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976410085] [2023-11-17 15:15:18,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:18,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:18,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:18,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:18,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:18,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-11-17 15:15:18,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 130 transitions, 1799 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 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:15:18,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:18,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-11-17 15:15:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:19,124 INFO L124 PetriNetUnfolderBase]: 2802/4193 cut-off events. [2023-11-17 15:15:19,124 INFO L125 PetriNetUnfolderBase]: For 48796/49434 co-relation queries the response was YES. [2023-11-17 15:15:19,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28346 conditions, 4193 events. 2802/4193 cut-off events. For 48796/49434 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 21344 event pairs, 320 based on Foata normal form. 406/4512 useless extension candidates. Maximal degree in co-relation 28297. Up to 2130 conditions per place. [2023-11-17 15:15:19,152 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 215 selfloop transitions, 13 changer transitions 0/260 dead transitions. [2023-11-17 15:15:19,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 260 transitions, 4070 flow [2023-11-17 15:15:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-11-17 15:15:19,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186991869918699 [2023-11-17 15:15:19,155 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-11-17 15:15:19,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-11-17 15:15:19,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:19,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-11-17 15:15:19,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 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:15:19,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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:15:19,158 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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:15:19,159 INFO L175 Difference]: Start difference. First operand has 92 places, 130 transitions, 1799 flow. Second operand 5 states and 638 transitions. [2023-11-17 15:15:19,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 260 transitions, 4070 flow [2023-11-17 15:15:19,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 260 transitions, 4004 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:19,281 INFO L231 Difference]: Finished difference. Result has 93 places, 129 transitions, 1739 flow [2023-11-17 15:15:19,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1739, PETRI_PLACES=93, PETRI_TRANSITIONS=129} [2023-11-17 15:15:19,282 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2023-11-17 15:15:19,282 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 129 transitions, 1739 flow [2023-11-17 15:15:19,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 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:15:19,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:19,283 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] [2023-11-17 15:15:19,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:15:19,283 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:19,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:19,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1632501237, now seen corresponding path program 1 times [2023-11-17 15:15:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:19,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420678289] [2023-11-17 15:15:19,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:20,133 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:15:20,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:20,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420678289] [2023-11-17 15:15:20,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420678289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:20,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:20,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:15:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445842649] [2023-11-17 15:15:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:20,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:15:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:15:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:15:20,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 246 [2023-11-17 15:15:20,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 129 transitions, 1739 flow. Second operand has 9 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:20,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:20,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 246 [2023-11-17 15:15:20,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:21,486 INFO L124 PetriNetUnfolderBase]: 4862/7189 cut-off events. [2023-11-17 15:15:21,486 INFO L125 PetriNetUnfolderBase]: For 64174/64174 co-relation queries the response was YES. [2023-11-17 15:15:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47090 conditions, 7189 events. 4862/7189 cut-off events. For 64174/64174 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 37012 event pairs, 214 based on Foata normal form. 15/7204 useless extension candidates. Maximal degree in co-relation 47042. Up to 3191 conditions per place. [2023-11-17 15:15:21,537 INFO L140 encePairwiseOnDemand]: 231/246 looper letters, 239 selfloop transitions, 127 changer transitions 133/499 dead transitions. [2023-11-17 15:15:21,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 499 transitions, 7068 flow [2023-11-17 15:15:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 15:15:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 15:15:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1740 transitions. [2023-11-17 15:15:21,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2023-11-17 15:15:21,542 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1740 transitions. [2023-11-17 15:15:21,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1740 transitions. [2023-11-17 15:15:21,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:21,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1740 transitions. [2023-11-17 15:15:21,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 108.75) internal successors, (1740), 16 states have internal predecessors, (1740), 0 states have call successors, (0), 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:15:21,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 246.0) internal successors, (4182), 17 states have internal predecessors, (4182), 0 states have call successors, (0), 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:15:21,552 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 246.0) internal successors, (4182), 17 states have internal predecessors, (4182), 0 states have call successors, (0), 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:15:21,552 INFO L175 Difference]: Start difference. First operand has 93 places, 129 transitions, 1739 flow. Second operand 16 states and 1740 transitions. [2023-11-17 15:15:21,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 499 transitions, 7068 flow [2023-11-17 15:15:21,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 499 transitions, 6812 flow, removed 66 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:21,795 INFO L231 Difference]: Finished difference. Result has 117 places, 212 transitions, 3425 flow [2023-11-17 15:15:21,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3425, PETRI_PLACES=117, PETRI_TRANSITIONS=212} [2023-11-17 15:15:21,796 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2023-11-17 15:15:21,796 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 212 transitions, 3425 flow [2023-11-17 15:15:21,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:21,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:21,796 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] [2023-11-17 15:15:21,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:15:21,797 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:21,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2077389987, now seen corresponding path program 2 times [2023-11-17 15:15:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:21,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650348256] [2023-11-17 15:15:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:22,496 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:15:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:22,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650348256] [2023-11-17 15:15:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650348256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:22,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:22,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647741554] [2023-11-17 15:15:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:22,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 246 [2023-11-17 15:15:22,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 212 transitions, 3425 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 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:15:22,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:22,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 246 [2023-11-17 15:15:22,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:23,953 INFO L124 PetriNetUnfolderBase]: 5725/8656 cut-off events. [2023-11-17 15:15:23,953 INFO L125 PetriNetUnfolderBase]: For 101355/101355 co-relation queries the response was YES. [2023-11-17 15:15:23,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61330 conditions, 8656 events. 5725/8656 cut-off events. For 101355/101355 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 47919 event pairs, 862 based on Foata normal form. 17/8673 useless extension candidates. Maximal degree in co-relation 61270. Up to 4015 conditions per place. [2023-11-17 15:15:24,023 INFO L140 encePairwiseOnDemand]: 232/246 looper letters, 185 selfloop transitions, 110 changer transitions 156/451 dead transitions. [2023-11-17 15:15:24,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 451 transitions, 7741 flow [2023-11-17 15:15:24,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 797 transitions. [2023-11-17 15:15:24,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4628339140534262 [2023-11-17 15:15:24,026 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 797 transitions. [2023-11-17 15:15:24,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 797 transitions. [2023-11-17 15:15:24,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:24,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 797 transitions. [2023-11-17 15:15:24,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 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:15:24,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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:15:24,031 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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:15:24,031 INFO L175 Difference]: Start difference. First operand has 117 places, 212 transitions, 3425 flow. Second operand 7 states and 797 transitions. [2023-11-17 15:15:24,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 451 transitions, 7741 flow [2023-11-17 15:15:24,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 451 transitions, 7635 flow, removed 53 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:24,549 INFO L231 Difference]: Finished difference. Result has 119 places, 225 transitions, 4077 flow [2023-11-17 15:15:24,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4077, PETRI_PLACES=119, PETRI_TRANSITIONS=225} [2023-11-17 15:15:24,550 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2023-11-17 15:15:24,550 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 225 transitions, 4077 flow [2023-11-17 15:15:24,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 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:15:24,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:24,551 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] [2023-11-17 15:15:24,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:15:24,551 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:24,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash 862234897, now seen corresponding path program 3 times [2023-11-17 15:15:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:24,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486029567] [2023-11-17 15:15:24,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:24,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:25,362 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:15:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486029567] [2023-11-17 15:15:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486029567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:25,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:25,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115463674] [2023-11-17 15:15:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:25,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:15:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:25,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:15:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:15:25,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 246 [2023-11-17 15:15:25,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 225 transitions, 4077 flow. Second operand has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 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:15:25,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:25,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 246 [2023-11-17 15:15:25,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:26,492 INFO L124 PetriNetUnfolderBase]: 4177/6651 cut-off events. [2023-11-17 15:15:26,492 INFO L125 PetriNetUnfolderBase]: For 98682/98988 co-relation queries the response was YES. [2023-11-17 15:15:26,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49491 conditions, 6651 events. 4177/6651 cut-off events. For 98682/98988 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39117 event pairs, 600 based on Foata normal form. 128/6648 useless extension candidates. Maximal degree in co-relation 49429. Up to 5376 conditions per place. [2023-11-17 15:15:26,544 INFO L140 encePairwiseOnDemand]: 241/246 looper letters, 179 selfloop transitions, 34 changer transitions 7/261 dead transitions. [2023-11-17 15:15:26,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 261 transitions, 4838 flow [2023-11-17 15:15:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-11-17 15:15:26,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2023-11-17 15:15:26,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-11-17 15:15:26,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-11-17 15:15:26,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:26,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-11-17 15:15:26,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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:15:26,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:26,551 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:26,551 INFO L175 Difference]: Start difference. First operand has 119 places, 225 transitions, 4077 flow. Second operand 6 states and 692 transitions. [2023-11-17 15:15:26,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 261 transitions, 4838 flow [2023-11-17 15:15:27,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 261 transitions, 4780 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:27,068 INFO L231 Difference]: Finished difference. Result has 123 places, 225 transitions, 4127 flow [2023-11-17 15:15:27,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=4031, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4127, PETRI_PLACES=123, PETRI_TRANSITIONS=225} [2023-11-17 15:15:27,068 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places. [2023-11-17 15:15:27,069 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 225 transitions, 4127 flow [2023-11-17 15:15:27,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 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:15:27,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:27,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:27,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 15:15:27,069 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:27,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 351001823, now seen corresponding path program 1 times [2023-11-17 15:15:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499966622] [2023-11-17 15:15:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:27,741 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:15:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499966622] [2023-11-17 15:15:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499966622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:27,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067908818] [2023-11-17 15:15:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:27,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:27,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:27,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:27,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 246 [2023-11-17 15:15:27,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 225 transitions, 4127 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 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:15:27,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:27,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 246 [2023-11-17 15:15:27,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:29,385 INFO L124 PetriNetUnfolderBase]: 6355/9855 cut-off events. [2023-11-17 15:15:29,385 INFO L125 PetriNetUnfolderBase]: For 117931/117931 co-relation queries the response was YES. [2023-11-17 15:15:29,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70555 conditions, 9855 events. 6355/9855 cut-off events. For 117931/117931 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 58590 event pairs, 1425 based on Foata normal form. 19/9874 useless extension candidates. Maximal degree in co-relation 70490. Up to 5043 conditions per place. [2023-11-17 15:15:29,475 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 137 selfloop transitions, 27 changer transitions 134/298 dead transitions. [2023-11-17 15:15:29,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 298 transitions, 5555 flow [2023-11-17 15:15:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2023-11-17 15:15:29,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46260162601626015 [2023-11-17 15:15:29,476 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2023-11-17 15:15:29,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2023-11-17 15:15:29,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:29,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2023-11-17 15:15:29,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 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:15:29,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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:15:29,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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:15:29,480 INFO L175 Difference]: Start difference. First operand has 123 places, 225 transitions, 4127 flow. Second operand 5 states and 569 transitions. [2023-11-17 15:15:29,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 298 transitions, 5555 flow [2023-11-17 15:15:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 298 transitions, 5483 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-11-17 15:15:30,299 INFO L231 Difference]: Finished difference. Result has 122 places, 130 transitions, 2138 flow [2023-11-17 15:15:30,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=4065, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2138, PETRI_PLACES=122, PETRI_TRANSITIONS=130} [2023-11-17 15:15:30,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2023-11-17 15:15:30,300 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 130 transitions, 2138 flow [2023-11-17 15:15:30,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 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:15:30,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:30,300 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] [2023-11-17 15:15:30,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 15:15:30,300 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:30,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash 872914029, now seen corresponding path program 2 times [2023-11-17 15:15:30,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:30,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553466436] [2023-11-17 15:15:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:30,779 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:15:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:30,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553466436] [2023-11-17 15:15:30,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553466436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:30,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:30,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539680538] [2023-11-17 15:15:30,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:30,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:30,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-11-17 15:15:30,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 130 transitions, 2138 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 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:15:30,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:30,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-11-17 15:15:30,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:31,589 INFO L124 PetriNetUnfolderBase]: 3910/6175 cut-off events. [2023-11-17 15:15:31,590 INFO L125 PetriNetUnfolderBase]: For 90572/91291 co-relation queries the response was YES. [2023-11-17 15:15:31,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43894 conditions, 6175 events. 3910/6175 cut-off events. For 90572/91291 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 38626 event pairs, 351 based on Foata normal form. 369/6338 useless extension candidates. Maximal degree in co-relation 43841. Up to 2977 conditions per place. [2023-11-17 15:15:31,630 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 54 selfloop transitions, 17 changer transitions 156/232 dead transitions. [2023-11-17 15:15:31,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 232 transitions, 4219 flow [2023-11-17 15:15:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-11-17 15:15:31,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088075880758808 [2023-11-17 15:15:31,632 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-11-17 15:15:31,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-11-17 15:15:31,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:31,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-11-17 15:15:31,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 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:15:31,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:31,635 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:31,635 INFO L175 Difference]: Start difference. First operand has 122 places, 130 transitions, 2138 flow. Second operand 6 states and 751 transitions. [2023-11-17 15:15:31,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 232 transitions, 4219 flow [2023-11-17 15:15:32,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 232 transitions, 3751 flow, removed 109 selfloop flow, removed 12 redundant places. [2023-11-17 15:15:32,023 INFO L231 Difference]: Finished difference. Result has 115 places, 48 transitions, 512 flow [2023-11-17 15:15:32,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=512, PETRI_PLACES=115, PETRI_TRANSITIONS=48} [2023-11-17 15:15:32,023 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2023-11-17 15:15:32,023 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 48 transitions, 512 flow [2023-11-17 15:15:32,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 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:15:32,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:32,023 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] [2023-11-17 15:15:32,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 15:15:32,024 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:32,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1127892978, now seen corresponding path program 1 times [2023-11-17 15:15:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363655556] [2023-11-17 15:15:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:32,823 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:15:32,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:32,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363655556] [2023-11-17 15:15:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363655556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:32,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:15:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285965706] [2023-11-17 15:15:32,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:32,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:15:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:15:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:15:32,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 246 [2023-11-17 15:15:32,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 48 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 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:15:32,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:32,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 246 [2023-11-17 15:15:32,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:33,147 INFO L124 PetriNetUnfolderBase]: 814/1377 cut-off events. [2023-11-17 15:15:33,148 INFO L125 PetriNetUnfolderBase]: For 12805/12833 co-relation queries the response was YES. [2023-11-17 15:15:33,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8416 conditions, 1377 events. 814/1377 cut-off events. For 12805/12833 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6751 event pairs, 180 based on Foata normal form. 1/1339 useless extension candidates. Maximal degree in co-relation 8377. Up to 623 conditions per place. [2023-11-17 15:15:33,154 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 51 selfloop transitions, 4 changer transitions 34/92 dead transitions. [2023-11-17 15:15:33,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 92 transitions, 1081 flow [2023-11-17 15:15:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-11-17 15:15:33,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654471544715447 [2023-11-17 15:15:33,155 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-11-17 15:15:33,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-11-17 15:15:33,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:33,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-11-17 15:15:33,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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:15:33,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:33,157 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:15:33,157 INFO L175 Difference]: Start difference. First operand has 115 places, 48 transitions, 512 flow. Second operand 6 states and 687 transitions. [2023-11-17 15:15:33,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 92 transitions, 1081 flow [2023-11-17 15:15:33,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 698 flow, removed 111 selfloop flow, removed 40 redundant places. [2023-11-17 15:15:33,185 INFO L231 Difference]: Finished difference. Result has 69 places, 45 transitions, 267 flow [2023-11-17 15:15:33,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=69, PETRI_TRANSITIONS=45} [2023-11-17 15:15:33,186 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-11-17 15:15:33,186 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 267 flow [2023-11-17 15:15:33,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 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:15:33,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:33,186 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] [2023-11-17 15:15:33,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-17 15:15:33,187 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:33,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:33,187 INFO L85 PathProgramCache]: Analyzing trace with hash -93848534, now seen corresponding path program 2 times [2023-11-17 15:15:33,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:33,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153826214] [2023-11-17 15:15:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:33,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:33,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:15:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:33,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:15:33,337 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:15:33,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:15:33,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:15:33,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:15:33,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:15:33,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:15:33,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:15:33,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:15:33,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 15:15:33,342 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:33,349 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:15:33,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:33,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 15:15:33,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:15:33,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:15:33,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:15:33,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:33 BasicIcfg [2023-11-17 15:15:33,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:33,435 INFO L158 Benchmark]: Toolchain (without parser) took 54402.63ms. Allocated memory was 264.2MB in the beginning and 5.4GB in the end (delta: 5.1GB). Free memory was 213.5MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2023-11-17 15:15:33,435 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 185.6MB. Free memory was 133.8MB in the beginning and 133.7MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:33,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.80ms. Allocated memory is still 264.2MB. Free memory was 212.9MB in the beginning and 189.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:33,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.27ms. Allocated memory is still 264.2MB. Free memory was 189.4MB in the beginning and 186.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:33,436 INFO L158 Benchmark]: Boogie Preprocessor took 27.89ms. Allocated memory is still 264.2MB. Free memory was 186.7MB in the beginning and 184.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:33,436 INFO L158 Benchmark]: RCFGBuilder took 906.70ms. Allocated memory is still 264.2MB. Free memory was 184.6MB in the beginning and 145.8MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-11-17 15:15:33,437 INFO L158 Benchmark]: TraceAbstraction took 52887.46ms. Allocated memory was 264.2MB in the beginning and 5.4GB in the end (delta: 5.1GB). Free memory was 144.8MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2023-11-17 15:15:33,438 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 185.6MB. Free memory was 133.8MB in the beginning and 133.7MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.80ms. Allocated memory is still 264.2MB. Free memory was 212.9MB in the beginning and 189.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.27ms. Allocated memory is still 264.2MB. Free memory was 189.4MB in the beginning and 186.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.89ms. Allocated memory is still 264.2MB. Free memory was 186.7MB in the beginning and 184.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 906.70ms. Allocated memory is still 264.2MB. Free memory was 184.6MB in the beginning and 145.8MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 52887.46ms. Allocated memory was 264.2MB in the beginning and 5.4GB in the end (delta: 5.1GB). Free memory was 144.8MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 140 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 31 TransitionsAfterwards, 3376 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 8427 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3946, independent: 3736, independent conditional: 0, independent unconditional: 3736, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2310, independent: 2261, independent conditional: 0, independent unconditional: 2261, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2310, independent: 2230, independent conditional: 0, independent unconditional: 2230, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 350, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3946, independent: 1475, independent conditional: 0, independent unconditional: 1475, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 2310, unknown conditional: 0, unknown unconditional: 2310] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, weak$$choice0=0, weak$$choice2=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] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=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] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=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] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L824] 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) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 52.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1017 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1017 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2925 IncrementalHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 93 mSDtfsCounter, 2925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4127occurred in iteration=16, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 3825 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:15:33,463 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...