/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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:16:46,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:16:46,686 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:16:46,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:16:46,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:16:46,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:16:46,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:16:46,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:16:46,708 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:16:46,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:16:46,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:16:46,708 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:16:46,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:16:46,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:16:46,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:16:46,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:16:46,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:16:46,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:16:46,716 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:16:46,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:16:46,716 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:16:46,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:16:46,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:16:46,721 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:16:46,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:16:46,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:16:46,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:16:46,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:16:46,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:16:46,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:16:46,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:16:46,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:16:46,724 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:16:46,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:16:46,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:16:46,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:16:46,939 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:16:46,939 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:16:46,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-17 15:16:47,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:16:48,100 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:16:48,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-17 15:16:48,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594882aca/40925d7d94894ca288855072a7f255f9/FLAGc6e985e81 [2023-11-17 15:16:48,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594882aca/40925d7d94894ca288855072a7f255f9 [2023-11-17 15:16:48,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:16:48,123 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:16:48,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:16:48,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:16:48,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:16:48,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292f5388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48, skipping insertion in model container [2023-11-17 15:16:48,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,160 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:16:48,264 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-17 15:16:48,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:16:48,433 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:16:48,441 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-17 15:16:48,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:16:48,515 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:16:48,515 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:16:48,520 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:16:48,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48 WrapperNode [2023-11-17 15:16:48,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:16:48,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:16:48,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:16:48,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:16:48,528 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:16:48" (1/1) ... [2023-11-17 15:16:48,554 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:16:48" (1/1) ... [2023-11-17 15:16:48,581 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2023-11-17 15:16:48,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:16:48,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:16:48,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:16:48,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:16:48,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:16:48,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:16:48,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:16:48,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:16:48,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2023-11-17 15:16:48,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:16:48,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:16:48,650 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:16:48,668 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:16:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:16:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:16:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:16:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:16:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:16:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:16:48,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:16:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:16:48,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:16:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:16:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:16:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:16:48,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:16:48,677 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:16:48,812 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:16:48,813 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:16:49,085 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:16:49,204 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:16:49,205 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:16:49,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:16:49 BoogieIcfgContainer [2023-11-17 15:16:49,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:16:49,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:16:49,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:16:49,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:16:49,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:16:48" (1/3) ... [2023-11-17 15:16:49,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f602c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:16:49, skipping insertion in model container [2023-11-17 15:16:49,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (2/3) ... [2023-11-17 15:16:49,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f602c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:16:49, skipping insertion in model container [2023-11-17 15:16:49,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:16:49" (3/3) ... [2023-11-17 15:16:49,212 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-17 15:16:49,223 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:16:49,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:16:49,224 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:16:49,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:16:49,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 198 flow [2023-11-17 15:16:49,338 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-11-17 15:16:49,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:49,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-17 15:16:49,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 198 flow [2023-11-17 15:16:49,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 93 transitions, 192 flow [2023-11-17 15:16:49,350 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:16:49,364 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 93 transitions, 192 flow [2023-11-17 15:16:49,367 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 93 transitions, 192 flow [2023-11-17 15:16:49,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 93 transitions, 192 flow [2023-11-17 15:16:49,394 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-11-17 15:16:49,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:49,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-17 15:16:49,397 INFO L119 LiptonReduction]: Number of co-enabled transitions 1368 [2023-11-17 15:16:52,045 INFO L134 LiptonReduction]: Checked pairs total: 3093 [2023-11-17 15:16:52,046 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-11-17 15:16:52,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:16:52,063 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;@26acc61f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:16:52,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:16:52,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:16:52,066 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 15:16:52,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:52,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:52,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:16:52,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:52,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash 409617159, now seen corresponding path program 1 times [2023-11-17 15:16:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774557035] [2023-11-17 15:16:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:52,382 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:16:52,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:52,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774557035] [2023-11-17 15:16:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774557035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:52,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:16:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125041435] [2023-11-17 15:16:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:52,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:16:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:16:52,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:16:52,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 181 [2023-11-17 15:16:52,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have 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:16:52,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:52,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 181 [2023-11-17 15:16:52,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:52,502 INFO L124 PetriNetUnfolderBase]: 173/328 cut-off events. [2023-11-17 15:16:52,502 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 15:16:52,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 328 events. 173/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1392 event pairs, 21 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 634. Up to 249 conditions per place. [2023-11-17 15:16:52,505 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 20 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-11-17 15:16:52,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 106 flow [2023-11-17 15:16:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:16:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:16:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-11-17 15:16:52,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027624309392266 [2023-11-17 15:16:52,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-11-17 15:16:52,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-11-17 15:16:52,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:52,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-11-17 15:16:52,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:16:52,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have 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:16:52,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have 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:16:52,523 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 273 transitions. [2023-11-17 15:16:52,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 106 flow [2023-11-17 15:16:52,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:52,526 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-11-17 15:16:52,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-17 15:16:52,529 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-17 15:16:52,529 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-11-17 15:16:52,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have 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:16:52,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:52,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:52,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:16:52,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:52,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 904676337, now seen corresponding path program 1 times [2023-11-17 15:16:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:52,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867633323] [2023-11-17 15:16:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:53,081 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:16:53,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:53,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867633323] [2023-11-17 15:16:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867633323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:53,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:53,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:53,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723032815] [2023-11-17 15:16:53,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:53,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:53,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:53,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:53,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:53,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 181 [2023-11-17 15:16:53,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:53,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 181 [2023-11-17 15:16:53,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:53,194 INFO L124 PetriNetUnfolderBase]: 217/388 cut-off events. [2023-11-17 15:16:53,194 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-17 15:16:53,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 388 events. 217/388 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1410 event pairs, 68 based on Foata normal form. 30/418 useless extension candidates. Maximal degree in co-relation 802. Up to 251 conditions per place. [2023-11-17 15:16:53,196 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 21 selfloop transitions, 2 changer transitions 14/37 dead transitions. [2023-11-17 15:16:53,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 158 flow [2023-11-17 15:16:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:16:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:16:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 379 transitions. [2023-11-17 15:16:53,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41878453038674035 [2023-11-17 15:16:53,198 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 379 transitions. [2023-11-17 15:16:53,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 379 transitions. [2023-11-17 15:16:53,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:53,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 379 transitions. [2023-11-17 15:16:53,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:16:53,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 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:16:53,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 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:16:53,202 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 5 states and 379 transitions. [2023-11-17 15:16:53,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 158 flow [2023-11-17 15:16:53,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:53,203 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 50 flow [2023-11-17 15:16:53,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2023-11-17 15:16:53,204 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2023-11-17 15:16:53,204 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 50 flow [2023-11-17 15:16:53,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:53,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:53,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:16:53,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:53,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash 906077553, now seen corresponding path program 1 times [2023-11-17 15:16:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78106939] [2023-11-17 15:16:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:53,790 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:16:53,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:53,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78106939] [2023-11-17 15:16:53,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78106939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:53,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:53,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:53,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690712738] [2023-11-17 15:16:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:53,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:53,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:53,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 181 [2023-11-17 15:16:53,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 70.42857142857143) internal successors, (493), 7 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have 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:16:53,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:53,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 181 [2023-11-17 15:16:53,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:53,997 INFO L124 PetriNetUnfolderBase]: 205/368 cut-off events. [2023-11-17 15:16:53,998 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-11-17 15:16:54,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 368 events. 205/368 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1312 event pairs, 51 based on Foata normal form. 21/389 useless extension candidates. Maximal degree in co-relation 832. Up to 252 conditions per place. [2023-11-17 15:16:54,002 INFO L140 encePairwiseOnDemand]: 172/181 looper letters, 30 selfloop transitions, 10 changer transitions 16/56 dead transitions. [2023-11-17 15:16:54,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 56 transitions, 254 flow [2023-11-17 15:16:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:16:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:16:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 611 transitions. [2023-11-17 15:16:54,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219613259668508 [2023-11-17 15:16:54,005 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 611 transitions. [2023-11-17 15:16:54,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 611 transitions. [2023-11-17 15:16:54,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:54,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 611 transitions. [2023-11-17 15:16:54,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:54,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have 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:16:54,011 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have 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:16:54,011 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 50 flow. Second operand 8 states and 611 transitions. [2023-11-17 15:16:54,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 56 transitions, 254 flow [2023-11-17 15:16:54,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 56 transitions, 242 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:54,014 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 117 flow [2023-11-17 15:16:54,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=117, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-11-17 15:16:54,015 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2023-11-17 15:16:54,015 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 117 flow [2023-11-17 15:16:54,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.42857142857143) internal successors, (493), 7 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have 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:16:54,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:54,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:54,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:16:54,016 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:54,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1772854720, now seen corresponding path program 1 times [2023-11-17 15:16:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:54,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519232089] [2023-11-17 15:16:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:54,920 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:16:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519232089] [2023-11-17 15:16:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519232089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:54,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852008581] [2023-11-17 15:16:54,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:54,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:54,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:54,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:54,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 181 [2023-11-17 15:16:54,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have 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:16:54,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:54,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 181 [2023-11-17 15:16:54,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:55,224 INFO L124 PetriNetUnfolderBase]: 226/403 cut-off events. [2023-11-17 15:16:55,225 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2023-11-17 15:16:55,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 403 events. 226/403 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1468 event pairs, 71 based on Foata normal form. 12/415 useless extension candidates. Maximal degree in co-relation 1263. Up to 302 conditions per place. [2023-11-17 15:16:55,227 INFO L140 encePairwiseOnDemand]: 172/181 looper letters, 39 selfloop transitions, 22 changer transitions 9/70 dead transitions. [2023-11-17 15:16:55,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 70 transitions, 449 flow [2023-11-17 15:16:55,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:16:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:16:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 671 transitions. [2023-11-17 15:16:55,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41190914671577655 [2023-11-17 15:16:55,229 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 671 transitions. [2023-11-17 15:16:55,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 671 transitions. [2023-11-17 15:16:55,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:55,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 671 transitions. [2023-11-17 15:16:55,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 74.55555555555556) internal successors, (671), 9 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have 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:16:55,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have 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:16:55,233 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have 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:16:55,233 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 117 flow. Second operand 9 states and 671 transitions. [2023-11-17 15:16:55,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 70 transitions, 449 flow [2023-11-17 15:16:55,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 70 transitions, 441 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:55,238 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 291 flow [2023-11-17 15:16:55,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=291, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2023-11-17 15:16:55,240 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2023-11-17 15:16:55,240 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 291 flow [2023-11-17 15:16:55,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have 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:16:55,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:55,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:55,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:16:55,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:55,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash 342852876, now seen corresponding path program 2 times [2023-11-17 15:16:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074457193] [2023-11-17 15:16:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:55,552 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:16:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074457193] [2023-11-17 15:16:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074457193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:55,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:16:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980547729] [2023-11-17 15:16:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:55,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:16:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:55,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:16:55,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:16:55,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 181 [2023-11-17 15:16:55,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 71.5) internal successors, (572), 8 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have 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:16:55,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:55,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 181 [2023-11-17 15:16:55,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:55,714 INFO L124 PetriNetUnfolderBase]: 188/348 cut-off events. [2023-11-17 15:16:55,714 INFO L125 PetriNetUnfolderBase]: For 754/759 co-relation queries the response was YES. [2023-11-17 15:16:55,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 348 events. 188/348 cut-off events. For 754/759 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1301 event pairs, 65 based on Foata normal form. 17/358 useless extension candidates. Maximal degree in co-relation 1351. Up to 276 conditions per place. [2023-11-17 15:16:55,719 INFO L140 encePairwiseOnDemand]: 172/181 looper letters, 41 selfloop transitions, 12 changer transitions 7/62 dead transitions. [2023-11-17 15:16:55,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 488 flow [2023-11-17 15:16:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:16:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:16:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 604 transitions. [2023-11-17 15:16:55,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171270718232044 [2023-11-17 15:16:55,725 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 604 transitions. [2023-11-17 15:16:55,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 604 transitions. [2023-11-17 15:16:55,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:55,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 604 transitions. [2023-11-17 15:16:55,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 75.5) internal successors, (604), 8 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have 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:16:55,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have 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:16:55,730 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have 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:16:55,730 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 291 flow. Second operand 8 states and 604 transitions. [2023-11-17 15:16:55,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 488 flow [2023-11-17 15:16:55,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 469 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:55,735 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 338 flow [2023-11-17 15:16:55,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-11-17 15:16:55,736 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2023-11-17 15:16:55,736 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 338 flow [2023-11-17 15:16:55,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.5) internal successors, (572), 8 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have 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:16:55,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:55,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:55,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:16:55,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:55,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash 235598232, now seen corresponding path program 3 times [2023-11-17 15:16:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:55,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523499921] [2023-11-17 15:16:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:56,037 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:16:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523499921] [2023-11-17 15:16:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523499921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:56,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:56,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688586812] [2023-11-17 15:16:56,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:56,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:56,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 181 [2023-11-17 15:16:56,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 338 flow. Second operand has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:56,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 181 [2023-11-17 15:16:56,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:56,201 INFO L124 PetriNetUnfolderBase]: 205/383 cut-off events. [2023-11-17 15:16:56,201 INFO L125 PetriNetUnfolderBase]: For 1195/1200 co-relation queries the response was YES. [2023-11-17 15:16:56,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 383 events. 205/383 cut-off events. For 1195/1200 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1547 event pairs, 51 based on Foata normal form. 19/394 useless extension candidates. Maximal degree in co-relation 1687. Up to 230 conditions per place. [2023-11-17 15:16:56,204 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 34 selfloop transitions, 22 changer transitions 10/68 dead transitions. [2023-11-17 15:16:56,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 609 flow [2023-11-17 15:16:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:16:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:16:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 636 transitions. [2023-11-17 15:16:56,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43922651933701656 [2023-11-17 15:16:56,206 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 636 transitions. [2023-11-17 15:16:56,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 636 transitions. [2023-11-17 15:16:56,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:56,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 636 transitions. [2023-11-17 15:16:56,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 79.5) internal successors, (636), 8 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have 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:16:56,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have 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:16:56,209 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have 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:16:56,209 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 338 flow. Second operand 8 states and 636 transitions. [2023-11-17 15:16:56,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 609 flow [2023-11-17 15:16:56,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 593 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:56,212 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 414 flow [2023-11-17 15:16:56,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=414, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-17 15:16:56,213 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2023-11-17 15:16:56,213 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 414 flow [2023-11-17 15:16:56,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:56,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:56,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:16:56,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:56,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1364790618, now seen corresponding path program 1 times [2023-11-17 15:16:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290068206] [2023-11-17 15:16:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:56,641 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:16:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290068206] [2023-11-17 15:16:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290068206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:56,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:16:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218603742] [2023-11-17 15:16:56,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:56,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:56,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:56,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 181 [2023-11-17 15:16:56,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have 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:16:56,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:56,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 181 [2023-11-17 15:16:56,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:56,719 INFO L124 PetriNetUnfolderBase]: 102/219 cut-off events. [2023-11-17 15:16:56,719 INFO L125 PetriNetUnfolderBase]: For 999/999 co-relation queries the response was YES. [2023-11-17 15:16:56,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 219 events. 102/219 cut-off events. For 999/999 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 760 event pairs, 37 based on Foata normal form. 16/235 useless extension candidates. Maximal degree in co-relation 1039. Up to 167 conditions per place. [2023-11-17 15:16:56,721 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 31 selfloop transitions, 19 changer transitions 0/52 dead transitions. [2023-11-17 15:16:56,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 530 flow [2023-11-17 15:16:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:16:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:16:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 391 transitions. [2023-11-17 15:16:56,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4320441988950276 [2023-11-17 15:16:56,722 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 391 transitions. [2023-11-17 15:16:56,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 391 transitions. [2023-11-17 15:16:56,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:56,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 391 transitions. [2023-11-17 15:16:56,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.2) internal successors, (391), 5 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have 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:16:56,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 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:16:56,725 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 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:16:56,725 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 414 flow. Second operand 5 states and 391 transitions. [2023-11-17 15:16:56,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 530 flow [2023-11-17 15:16:56,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 481 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-11-17 15:16:56,728 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 438 flow [2023-11-17 15:16:56,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=438, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-11-17 15:16:56,728 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2023-11-17 15:16:56,728 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 438 flow [2023-11-17 15:16:56,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have 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:16:56,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:56,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:56,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:16:56,729 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:56,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -90617224, now seen corresponding path program 1 times [2023-11-17 15:16:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637927744] [2023-11-17 15:16:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:57,147 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:16:57,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:57,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637927744] [2023-11-17 15:16:57,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637927744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:57,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:57,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:16:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490081681] [2023-11-17 15:16:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:57,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:16:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:57,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:16:57,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:16:57,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 181 [2023-11-17 15:16:57,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 438 flow. Second operand has 9 states, 9 states have (on average 70.44444444444444) internal successors, (634), 9 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have 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:16:57,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:57,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 181 [2023-11-17 15:16:57,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:57,317 INFO L124 PetriNetUnfolderBase]: 113/253 cut-off events. [2023-11-17 15:16:57,317 INFO L125 PetriNetUnfolderBase]: For 958/958 co-relation queries the response was YES. [2023-11-17 15:16:57,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 253 events. 113/253 cut-off events. For 958/958 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1004 event pairs, 25 based on Foata normal form. 7/260 useless extension candidates. Maximal degree in co-relation 1239. Up to 159 conditions per place. [2023-11-17 15:16:57,319 INFO L140 encePairwiseOnDemand]: 172/181 looper letters, 39 selfloop transitions, 23 changer transitions 3/67 dead transitions. [2023-11-17 15:16:57,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 703 flow [2023-11-17 15:16:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:16:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:16:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 739 transitions. [2023-11-17 15:16:57,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40828729281767956 [2023-11-17 15:16:57,321 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 739 transitions. [2023-11-17 15:16:57,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 739 transitions. [2023-11-17 15:16:57,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:57,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 739 transitions. [2023-11-17 15:16:57,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 73.9) internal successors, (739), 10 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have 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:16:57,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have 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:16:57,327 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have 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:16:57,328 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 438 flow. Second operand 10 states and 739 transitions. [2023-11-17 15:16:57,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 703 flow [2023-11-17 15:16:57,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 667 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:57,332 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 520 flow [2023-11-17 15:16:57,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=520, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-11-17 15:16:57,334 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2023-11-17 15:16:57,334 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 520 flow [2023-11-17 15:16:57,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 70.44444444444444) internal successors, (634), 9 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have 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:16:57,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:57,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:57,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:16:57,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:57,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1171294712, now seen corresponding path program 2 times [2023-11-17 15:16:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:57,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981571496] [2023-11-17 15:16:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:57,686 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:16:57,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981571496] [2023-11-17 15:16:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981571496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:16:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770736891] [2023-11-17 15:16:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:57,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:16:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:16:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:16:57,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 181 [2023-11-17 15:16:57,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 520 flow. Second operand has 8 states, 8 states have (on average 75.625) internal successors, (605), 8 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have 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:16:57,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:57,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 181 [2023-11-17 15:16:57,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:57,800 INFO L124 PetriNetUnfolderBase]: 118/269 cut-off events. [2023-11-17 15:16:57,800 INFO L125 PetriNetUnfolderBase]: For 1383/1383 co-relation queries the response was YES. [2023-11-17 15:16:57,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 269 events. 118/269 cut-off events. For 1383/1383 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1079 event pairs, 39 based on Foata normal form. 12/281 useless extension candidates. Maximal degree in co-relation 1444. Up to 136 conditions per place. [2023-11-17 15:16:57,802 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 37 selfloop transitions, 14 changer transitions 10/63 dead transitions. [2023-11-17 15:16:57,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 732 flow [2023-11-17 15:16:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:16:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:16:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 479 transitions. [2023-11-17 15:16:57,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44106813996316757 [2023-11-17 15:16:57,803 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 479 transitions. [2023-11-17 15:16:57,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 479 transitions. [2023-11-17 15:16:57,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:57,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 479 transitions. [2023-11-17 15:16:57,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have 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:16:57,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have 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:16:57,806 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have 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:16:57,806 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 520 flow. Second operand 6 states and 479 transitions. [2023-11-17 15:16:57,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 732 flow [2023-11-17 15:16:57,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 692 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-11-17 15:16:57,810 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 506 flow [2023-11-17 15:16:57,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2023-11-17 15:16:57,810 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 38 predicate places. [2023-11-17 15:16:57,810 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 506 flow [2023-11-17 15:16:57,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.625) internal successors, (605), 8 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have 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:16:57,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:57,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:57,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:16:57,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:57,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -658335284, now seen corresponding path program 1 times [2023-11-17 15:16:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:57,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280314726] [2023-11-17 15:16:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:57,916 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:16:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280314726] [2023-11-17 15:16:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280314726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222763453] [2023-11-17 15:16:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:57,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:16:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:57,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:16:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:16:57,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 181 [2023-11-17 15:16:57,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:16:57,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:57,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 181 [2023-11-17 15:16:57,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:57,958 INFO L124 PetriNetUnfolderBase]: 32/101 cut-off events. [2023-11-17 15:16:57,958 INFO L125 PetriNetUnfolderBase]: For 662/663 co-relation queries the response was YES. [2023-11-17 15:16:57,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 101 events. 32/101 cut-off events. For 662/663 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 327 event pairs, 10 based on Foata normal form. 22/122 useless extension candidates. Maximal degree in co-relation 570. Up to 45 conditions per place. [2023-11-17 15:16:57,959 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 35 selfloop transitions, 10 changer transitions 4/54 dead transitions. [2023-11-17 15:16:57,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 642 flow [2023-11-17 15:16:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:16:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:16:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2023-11-17 15:16:57,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723756906077348 [2023-11-17 15:16:57,961 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 342 transitions. [2023-11-17 15:16:57,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 342 transitions. [2023-11-17 15:16:57,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:57,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 342 transitions. [2023-11-17 15:16:57,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have 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:16:57,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have 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:16:57,963 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have 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:16:57,963 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 506 flow. Second operand 4 states and 342 transitions. [2023-11-17 15:16:57,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 642 flow [2023-11-17 15:16:57,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 585 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-11-17 15:16:57,965 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 467 flow [2023-11-17 15:16:57,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=467, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-11-17 15:16:57,966 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 34 predicate places. [2023-11-17 15:16:57,966 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 467 flow [2023-11-17 15:16:57,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:16:57,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:57,966 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:16:57,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:16:57,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:57,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash 850636331, now seen corresponding path program 1 times [2023-11-17 15:16:57,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:57,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557440007] [2023-11-17 15:16:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:57,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:58,276 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:16:58,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:58,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557440007] [2023-11-17 15:16:58,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557440007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:58,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:58,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:58,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942203978] [2023-11-17 15:16:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:58,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:16:58,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:58,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:16:58,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:16:58,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 181 [2023-11-17 15:16:58,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 467 flow. Second operand has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:16:58,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:58,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 181 [2023-11-17 15:16:58,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:58,415 INFO L124 PetriNetUnfolderBase]: 39/114 cut-off events. [2023-11-17 15:16:58,415 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2023-11-17 15:16:58,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 114 events. 39/114 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 364 event pairs, 5 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 666. Up to 57 conditions per place. [2023-11-17 15:16:58,416 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 20 selfloop transitions, 3 changer transitions 49/72 dead transitions. [2023-11-17 15:16:58,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 848 flow [2023-11-17 15:16:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 499 transitions. [2023-11-17 15:16:58,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39384372533543804 [2023-11-17 15:16:58,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 499 transitions. [2023-11-17 15:16:58,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 499 transitions. [2023-11-17 15:16:58,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:58,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 499 transitions. [2023-11-17 15:16:58,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 71.28571428571429) internal successors, (499), 7 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have 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:16:58,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have 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:16:58,421 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have 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:16:58,421 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 467 flow. Second operand 7 states and 499 transitions. [2023-11-17 15:16:58,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 848 flow [2023-11-17 15:16:58,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 744 flow, removed 22 selfloop flow, removed 6 redundant places. [2023-11-17 15:16:58,426 INFO L231 Difference]: Finished difference. Result has 63 places, 23 transitions, 176 flow [2023-11-17 15:16:58,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=63, PETRI_TRANSITIONS=23} [2023-11-17 15:16:58,427 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2023-11-17 15:16:58,427 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 23 transitions, 176 flow [2023-11-17 15:16:58,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:16:58,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:58,427 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:16:58,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:16:58,428 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:16:58,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1361187047, now seen corresponding path program 2 times [2023-11-17 15:16:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174809443] [2023-11-17 15:16:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:16:58,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:16:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:16:58,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:16:58,498 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:16:58,498 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:16:58,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:16:58,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:16:58,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:16:58,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:16:58,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:16:58,502 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2023-11-17 15:16:58,506 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:16:58,506 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:16:58,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 15:16:58,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:16:58,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:16:58 BasicIcfg [2023-11-17 15:16:58,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:16:58,558 INFO L158 Benchmark]: Toolchain (without parser) took 10435.12ms. Allocated memory was 194.0MB in the beginning and 514.9MB in the end (delta: 320.9MB). Free memory was 140.4MB in the beginning and 191.0MB in the end (delta: -50.6MB). Peak memory consumption was 272.5MB. Max. memory is 8.0GB. [2023-11-17 15:16:58,558 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 194.0MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:16:58,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.11ms. Allocated memory is still 194.0MB. Free memory was 140.2MB in the beginning and 117.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:16:58,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 194.0MB. Free memory was 117.2MB in the beginning and 114.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:16:58,559 INFO L158 Benchmark]: Boogie Preprocessor took 43.25ms. Allocated memory is still 194.0MB. Free memory was 114.6MB in the beginning and 112.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:16:58,559 INFO L158 Benchmark]: RCFGBuilder took 580.33ms. Allocated memory was 194.0MB in the beginning and 345.0MB in the end (delta: 151.0MB). Free memory was 112.8MB in the beginning and 296.9MB in the end (delta: -184.1MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. [2023-11-17 15:16:58,559 INFO L158 Benchmark]: TraceAbstraction took 9350.51ms. Allocated memory was 345.0MB in the beginning and 514.9MB in the end (delta: 169.9MB). Free memory was 296.4MB in the beginning and 191.0MB in the end (delta: 105.4MB). Peak memory consumption was 275.3MB. Max. memory is 8.0GB. [2023-11-17 15:16:58,560 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.59ms. Allocated memory is still 194.0MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 398.11ms. Allocated memory is still 194.0MB. Free memory was 140.2MB in the beginning and 117.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 194.0MB. Free memory was 117.2MB in the beginning and 114.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.25ms. Allocated memory is still 194.0MB. Free memory was 114.6MB in the beginning and 112.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 580.33ms. Allocated memory was 194.0MB in the beginning and 345.0MB in the end (delta: 151.0MB). Free memory was 112.8MB in the beginning and 296.9MB in the end (delta: -184.1MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. * TraceAbstraction took 9350.51ms. Allocated memory was 345.0MB in the beginning and 514.9MB in the end (delta: 169.9MB). Free memory was 296.4MB in the beginning and 191.0MB in the end (delta: 105.4MB). Peak memory consumption was 275.3MB. 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 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: 2.7s, 97 PlacesBefore, 26 PlacesAfterwards, 93 TransitionsBefore, 20 TransitionsAfterwards, 1368 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 3093 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1650, independent: 1530, independent conditional: 0, independent unconditional: 1530, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1002, independent: 967, independent conditional: 0, independent unconditional: 967, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1002, independent: 951, independent conditional: 0, independent unconditional: 951, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1650, independent: 563, independent conditional: 0, independent unconditional: 563, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 1002, unknown conditional: 0, unknown unconditional: 1002] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, t1604={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 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) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 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 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=1] [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 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) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 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) [L823] 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)) [L824] 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)) [L825] 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)) [L826] 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)) [L827] 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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 5 procedures, 114 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1054 IncrementalHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 22 mSDtfsCounter, 1054 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=8, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 1443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:16:58,577 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...