/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:29:21,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:29:21,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:29:21,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:29:21,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:29:21,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:29:21,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:29:21,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:29:21,442 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:29:21,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:29:21,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:29:21,443 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:29:21,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:29:21,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:29:21,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:29:21,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:29:21,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:29:21,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:29:21,444 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:29:21,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:29:21,445 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:29:21,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:29:21,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:29:21,445 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:29:21,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:29:21,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:21,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:29:21,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:29:21,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:29:21,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:29:21,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:29:21,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:29:21,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:29:21,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:29:21,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:29:21,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:29:21,630 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:29:21,631 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:29:21,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i [2023-11-17 11:29:22,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:29:22,824 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:29:22,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i [2023-11-17 11:29:22,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fccd0be/6658e27ecee04e0e99a2f7b6a65dfe1c/FLAG9a908ba32 [2023-11-17 11:29:22,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fccd0be/6658e27ecee04e0e99a2f7b6a65dfe1c [2023-11-17 11:29:22,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:29:22,855 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:29:22,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:22,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:29:22,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:29:22,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:22" (1/1) ... [2023-11-17 11:29:22,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c402a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:22, skipping insertion in model container [2023-11-17 11:29:22,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:22" (1/1) ... [2023-11-17 11:29:22,897 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:29:23,006 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/safe019_rmo.opt.i[992,1005] [2023-11-17 11:29:23,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:23,165 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:29:23,176 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/safe019_rmo.opt.i[992,1005] [2023-11-17 11:29:23,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:23,227 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:23,228 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:23,233 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:29:23,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23 WrapperNode [2023-11-17 11:29:23,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:23,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:23,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:29:23,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:29:23,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,278 INFO L138 Inliner]: procedures = 177, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2023-11-17 11:29:23,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:23,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:29:23,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:29:23,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:29:23,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:29:23,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:29:23,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:29:23,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:29:23,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (1/1) ... [2023-11-17 11:29:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:23,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:29:23,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:29:23,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:29:23,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:29:23,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:29:23,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:29:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:29:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:29:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:29:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:29:23,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:29:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:29:23,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:29:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:29:23,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:29:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:29:23,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:29:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:29:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:29:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:29:23,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:29:23,518 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:29:23,626 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:29:23,627 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:29:23,947 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:29:24,205 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:29:24,205 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:29:24,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:24 BoogieIcfgContainer [2023-11-17 11:29:24,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:29:24,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:29:24,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:29:24,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:29:24,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:29:22" (1/3) ... [2023-11-17 11:29:24,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfbb3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:24, skipping insertion in model container [2023-11-17 11:29:24,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:23" (2/3) ... [2023-11-17 11:29:24,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfbb3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:24, skipping insertion in model container [2023-11-17 11:29:24,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:24" (3/3) ... [2023-11-17 11:29:24,212 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i [2023-11-17 11:29:24,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:29:24,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:29:24,224 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:29:24,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:29:24,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2023-11-17 11:29:24,328 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-17 11:29:24,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:24,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-11-17 11:29:24,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2023-11-17 11:29:24,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:24,336 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:29:24,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:24,351 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:24,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:24,370 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2023-11-17 11:29:24,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:24,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2023-11-17 11:29:24,371 INFO L119 LiptonReduction]: Number of co-enabled transitions 850 [2023-11-17 11:29:26,084 INFO L134 LiptonReduction]: Checked pairs total: 1622 [2023-11-17 11:29:26,084 INFO L136 LiptonReduction]: Total number of compositions: 14 [2023-11-17 11:29:26,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:29:26,105 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;@4de5e4ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:29:26,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:29:26,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:29:26,112 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-17 11:29:26,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:26,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:26,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:26,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:26,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1087681629, now seen corresponding path program 1 times [2023-11-17 11:29:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16868126] [2023-11-17 11:29:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16868126] [2023-11-17 11:29:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16868126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179649602] [2023-11-17 11:29:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:26,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:26,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:26,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:26,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2023-11-17 11:29:26,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:26,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:26,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2023-11-17 11:29:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:27,231 INFO L124 PetriNetUnfolderBase]: 2951/4086 cut-off events. [2023-11-17 11:29:27,232 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-17 11:29:27,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 4086 events. 2951/4086 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18404 event pairs, 871 based on Foata normal form. 64/4145 useless extension candidates. Maximal degree in co-relation 8330. Up to 3423 conditions per place. [2023-11-17 11:29:27,256 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 38 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-17 11:29:27,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 183 flow [2023-11-17 11:29:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-17 11:29:27,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5536723163841808 [2023-11-17 11:29:27,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-17 11:29:27,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-17 11:29:27,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:27,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-17 11:29:27,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:27,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:27,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:27,277 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 60 flow. Second operand 3 states and 98 transitions. [2023-11-17 11:29:27,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 183 flow [2023-11-17 11:29:27,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:27,282 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 64 flow [2023-11-17 11:29:27,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-11-17 11:29:27,286 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2023-11-17 11:29:27,286 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 64 flow [2023-11-17 11:29:27,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:27,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:27,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:27,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:29:27,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:27,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:27,293 INFO L85 PathProgramCache]: Analyzing trace with hash -641607372, now seen corresponding path program 1 times [2023-11-17 11:29:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044995487] [2023-11-17 11:29:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:27,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044995487] [2023-11-17 11:29:27,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044995487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:27,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227377265] [2023-11-17 11:29:27,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:27,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:27,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:27,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2023-11-17 11:29:27,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:27,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:27,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2023-11-17 11:29:27,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:28,009 INFO L124 PetriNetUnfolderBase]: 2799/4104 cut-off events. [2023-11-17 11:29:28,009 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2023-11-17 11:29:28,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8771 conditions, 4104 events. 2799/4104 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19847 event pairs, 567 based on Foata normal form. 48/4152 useless extension candidates. Maximal degree in co-relation 8760. Up to 3145 conditions per place. [2023-11-17 11:29:28,029 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 34 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-17 11:29:28,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 167 flow [2023-11-17 11:29:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2023-11-17 11:29:28,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5480225988700564 [2023-11-17 11:29:28,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 97 transitions. [2023-11-17 11:29:28,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 97 transitions. [2023-11-17 11:29:28,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:28,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 97 transitions. [2023-11-17 11:29:28,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,036 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 64 flow. Second operand 3 states and 97 transitions. [2023-11-17 11:29:28,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 167 flow [2023-11-17 11:29:28,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:28,041 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 68 flow [2023-11-17 11:29:28,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-11-17 11:29:28,042 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-11-17 11:29:28,042 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 68 flow [2023-11-17 11:29:28,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:28,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:28,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:29:28,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:28,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash -238029817, now seen corresponding path program 1 times [2023-11-17 11:29:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313201935] [2023-11-17 11:29:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:28,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:28,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313201935] [2023-11-17 11:29:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313201935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669552302] [2023-11-17 11:29:28,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:28,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:28,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:28,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:28,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:28,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2023-11-17 11:29:28,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:28,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2023-11-17 11:29:28,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:28,950 INFO L124 PetriNetUnfolderBase]: 5374/7435 cut-off events. [2023-11-17 11:29:28,950 INFO L125 PetriNetUnfolderBase]: For 1296/1296 co-relation queries the response was YES. [2023-11-17 11:29:28,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16464 conditions, 7435 events. 5374/7435 cut-off events. For 1296/1296 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 34848 event pairs, 751 based on Foata normal form. 192/7627 useless extension candidates. Maximal degree in co-relation 16452. Up to 3484 conditions per place. [2023-11-17 11:29:28,972 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 44 selfloop transitions, 4 changer transitions 5/53 dead transitions. [2023-11-17 11:29:28,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 243 flow [2023-11-17 11:29:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2023-11-17 11:29:28,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211864406779662 [2023-11-17 11:29:28,976 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 123 transitions. [2023-11-17 11:29:28,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 123 transitions. [2023-11-17 11:29:28,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:28,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 123 transitions. [2023-11-17 11:29:28,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,978 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,978 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 68 flow. Second operand 4 states and 123 transitions. [2023-11-17 11:29:28,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 243 flow [2023-11-17 11:29:28,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:28,983 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 90 flow [2023-11-17 11:29:28,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-11-17 11:29:28,984 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2023-11-17 11:29:28,984 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 90 flow [2023-11-17 11:29:28,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:28,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:28,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:28,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:29:28,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:28,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1397530696, now seen corresponding path program 1 times [2023-11-17 11:29:28,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:28,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46267018] [2023-11-17 11:29:28,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46267018] [2023-11-17 11:29:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46267018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480465203] [2023-11-17 11:29:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:29,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:29,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:29,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:29,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2023-11-17 11:29:29,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:29,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:29,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2023-11-17 11:29:29,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:30,022 INFO L124 PetriNetUnfolderBase]: 5848/8191 cut-off events. [2023-11-17 11:29:30,022 INFO L125 PetriNetUnfolderBase]: For 4876/4876 co-relation queries the response was YES. [2023-11-17 11:29:30,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18710 conditions, 8191 events. 5848/8191 cut-off events. For 4876/4876 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 41313 event pairs, 1873 based on Foata normal form. 360/8551 useless extension candidates. Maximal degree in co-relation 18696. Up to 3149 conditions per place. [2023-11-17 11:29:30,049 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 36 selfloop transitions, 3 changer transitions 26/65 dead transitions. [2023-11-17 11:29:30,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 308 flow [2023-11-17 11:29:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2023-11-17 11:29:30,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152542372881356 [2023-11-17 11:29:30,050 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 152 transitions. [2023-11-17 11:29:30,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 152 transitions. [2023-11-17 11:29:30,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:30,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 152 transitions. [2023-11-17 11:29:30,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:30,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:30,052 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:30,052 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 90 flow. Second operand 5 states and 152 transitions. [2023-11-17 11:29:30,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 308 flow [2023-11-17 11:29:30,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 296 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:30,057 INFO L231 Difference]: Finished difference. Result has 44 places, 26 transitions, 98 flow [2023-11-17 11:29:30,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2023-11-17 11:29:30,058 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2023-11-17 11:29:30,058 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 98 flow [2023-11-17 11:29:30,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:30,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:30,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:30,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:29:30,059 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:30,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 479071492, now seen corresponding path program 1 times [2023-11-17 11:29:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517227793] [2023-11-17 11:29:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517227793] [2023-11-17 11:29:31,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517227793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:31,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:31,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598832470] [2023-11-17 11:29:31,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:31,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:31,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2023-11-17 11:29:31,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 26 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:31,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:31,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2023-11-17 11:29:31,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:31,928 INFO L124 PetriNetUnfolderBase]: 3045/4497 cut-off events. [2023-11-17 11:29:31,928 INFO L125 PetriNetUnfolderBase]: For 3312/3312 co-relation queries the response was YES. [2023-11-17 11:29:31,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10586 conditions, 4497 events. 3045/4497 cut-off events. For 3312/3312 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23146 event pairs, 1278 based on Foata normal form. 36/4533 useless extension candidates. Maximal degree in co-relation 10571. Up to 3568 conditions per place. [2023-11-17 11:29:31,950 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 47 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-11-17 11:29:31,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 278 flow [2023-11-17 11:29:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2023-11-17 11:29:31,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5508474576271186 [2023-11-17 11:29:31,952 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 130 transitions. [2023-11-17 11:29:31,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 130 transitions. [2023-11-17 11:29:31,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:31,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 130 transitions. [2023-11-17 11:29:31,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:31,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:31,953 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:31,953 INFO L175 Difference]: Start difference. First operand has 44 places, 26 transitions, 98 flow. Second operand 4 states and 130 transitions. [2023-11-17 11:29:31,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 278 flow [2023-11-17 11:29:31,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 266 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:31,964 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 111 flow [2023-11-17 11:29:31,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-17 11:29:31,964 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2023-11-17 11:29:31,965 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 111 flow [2023-11-17 11:29:31,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:31,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:31,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:31,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:29:31,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:31,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:31,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1461154923, now seen corresponding path program 1 times [2023-11-17 11:29:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:31,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595738944] [2023-11-17 11:29:31,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:31,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:32,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:32,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595738944] [2023-11-17 11:29:32,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595738944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:32,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:32,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:32,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493447981] [2023-11-17 11:29:32,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:32,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:32,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:32,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:32,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:32,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:32,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:32,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:32,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:32,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:32,543 INFO L124 PetriNetUnfolderBase]: 2876/4294 cut-off events. [2023-11-17 11:29:32,543 INFO L125 PetriNetUnfolderBase]: For 1623/1653 co-relation queries the response was YES. [2023-11-17 11:29:32,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10551 conditions, 4294 events. 2876/4294 cut-off events. For 1623/1653 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22645 event pairs, 398 based on Foata normal form. 360/4645 useless extension candidates. Maximal degree in co-relation 10535. Up to 2079 conditions per place. [2023-11-17 11:29:32,558 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 54 selfloop transitions, 6 changer transitions 1/63 dead transitions. [2023-11-17 11:29:32,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 351 flow [2023-11-17 11:29:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2023-11-17 11:29:32,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830508474576271 [2023-11-17 11:29:32,559 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 114 transitions. [2023-11-17 11:29:32,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 114 transitions. [2023-11-17 11:29:32,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:32,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 114 transitions. [2023-11-17 11:29:32,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:32,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:32,560 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:32,561 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 111 flow. Second operand 4 states and 114 transitions. [2023-11-17 11:29:32,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 351 flow [2023-11-17 11:29:32,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:32,563 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 150 flow [2023-11-17 11:29:32,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-11-17 11:29:32,564 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2023-11-17 11:29:32,564 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 150 flow [2023-11-17 11:29:32,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:32,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:32,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:32,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:29:32,564 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:32,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash 910491235, now seen corresponding path program 1 times [2023-11-17 11:29:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:32,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42120729] [2023-11-17 11:29:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:32,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42120729] [2023-11-17 11:29:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42120729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:32,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307620982] [2023-11-17 11:29:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:32,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:29:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:32,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:29:32,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:29:32,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:32,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:32,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:32,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:32,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:33,032 INFO L124 PetriNetUnfolderBase]: 1621/2557 cut-off events. [2023-11-17 11:29:33,032 INFO L125 PetriNetUnfolderBase]: For 1716/1729 co-relation queries the response was YES. [2023-11-17 11:29:33,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7803 conditions, 2557 events. 1621/2557 cut-off events. For 1716/1729 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13037 event pairs, 141 based on Foata normal form. 256/2807 useless extension candidates. Maximal degree in co-relation 7784. Up to 932 conditions per place. [2023-11-17 11:29:33,041 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 65 selfloop transitions, 10 changer transitions 1/78 dead transitions. [2023-11-17 11:29:33,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 473 flow [2023-11-17 11:29:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2023-11-17 11:29:33,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847457627118644 [2023-11-17 11:29:33,042 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 143 transitions. [2023-11-17 11:29:33,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 143 transitions. [2023-11-17 11:29:33,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:33,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 143 transitions. [2023-11-17 11:29:33,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:33,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:33,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:33,044 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 150 flow. Second operand 5 states and 143 transitions. [2023-11-17 11:29:33,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 473 flow [2023-11-17 11:29:33,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 462 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:33,047 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 202 flow [2023-11-17 11:29:33,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-11-17 11:29:33,047 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-11-17 11:29:33,048 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 202 flow [2023-11-17 11:29:33,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:33,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:33,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:33,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:29:33,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:33,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1654629564, now seen corresponding path program 1 times [2023-11-17 11:29:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:33,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950081497] [2023-11-17 11:29:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:33,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950081497] [2023-11-17 11:29:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950081497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:33,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:33,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077587072] [2023-11-17 11:29:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:33,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:33,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:33,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:33,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:33,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:33,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:33,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:33,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:33,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:33,433 INFO L124 PetriNetUnfolderBase]: 895/1470 cut-off events. [2023-11-17 11:29:33,434 INFO L125 PetriNetUnfolderBase]: For 1857/1863 co-relation queries the response was YES. [2023-11-17 11:29:33,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5121 conditions, 1470 events. 895/1470 cut-off events. For 1857/1863 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6939 event pairs, 137 based on Foata normal form. 108/1572 useless extension candidates. Maximal degree in co-relation 5100. Up to 518 conditions per place. [2023-11-17 11:29:33,439 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 69 selfloop transitions, 14 changer transitions 1/86 dead transitions. [2023-11-17 11:29:33,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 565 flow [2023-11-17 11:29:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:29:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:29:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2023-11-17 11:29:33,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745762711864407 [2023-11-17 11:29:33,441 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 168 transitions. [2023-11-17 11:29:33,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 168 transitions. [2023-11-17 11:29:33,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:33,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 168 transitions. [2023-11-17 11:29:33,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:33,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 59.0) internal successors, (413), 7 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 11:29:33,442 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 59.0) internal successors, (413), 7 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 11:29:33,442 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 202 flow. Second operand 6 states and 168 transitions. [2023-11-17 11:29:33,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 565 flow [2023-11-17 11:29:33,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 535 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:33,449 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 252 flow [2023-11-17 11:29:33,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-11-17 11:29:33,449 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2023-11-17 11:29:33,450 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 252 flow [2023-11-17 11:29:33,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:33,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:33,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:33,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:29:33,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:33,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1715957611, now seen corresponding path program 1 times [2023-11-17 11:29:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265735712] [2023-11-17 11:29:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265735712] [2023-11-17 11:29:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265735712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:34,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:29:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113999084] [2023-11-17 11:29:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:34,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:29:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:29:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:29:34,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2023-11-17 11:29:34,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 252 flow. Second operand has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:34,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:34,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2023-11-17 11:29:34,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:34,986 INFO L124 PetriNetUnfolderBase]: 1034/1706 cut-off events. [2023-11-17 11:29:34,986 INFO L125 PetriNetUnfolderBase]: For 2655/2663 co-relation queries the response was YES. [2023-11-17 11:29:34,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 1706 events. 1034/1706 cut-off events. For 2655/2663 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8399 event pairs, 406 based on Foata normal form. 8/1710 useless extension candidates. Maximal degree in co-relation 5925. Up to 1312 conditions per place. [2023-11-17 11:29:34,994 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 65 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2023-11-17 11:29:34,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 644 flow [2023-11-17 11:29:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2023-11-17 11:29:34,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016949152542373 [2023-11-17 11:29:34,996 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 148 transitions. [2023-11-17 11:29:34,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 148 transitions. [2023-11-17 11:29:34,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:34,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 148 transitions. [2023-11-17 11:29:34,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:34,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:34,997 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:34,997 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 252 flow. Second operand 5 states and 148 transitions. [2023-11-17 11:29:34,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 644 flow [2023-11-17 11:29:35,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 532 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-11-17 11:29:35,007 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 266 flow [2023-11-17 11:29:35,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-11-17 11:29:35,007 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2023-11-17 11:29:35,008 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 266 flow [2023-11-17 11:29:35,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:35,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:35,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:35,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:29:35,008 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:35,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1478442503, now seen corresponding path program 2 times [2023-11-17 11:29:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7972011] [2023-11-17 11:29:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7972011] [2023-11-17 11:29:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7972011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:35,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057792217] [2023-11-17 11:29:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:35,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:35,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:35,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2023-11-17 11:29:35,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:35,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:35,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2023-11-17 11:29:35,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:36,298 INFO L124 PetriNetUnfolderBase]: 1520/2521 cut-off events. [2023-11-17 11:29:36,298 INFO L125 PetriNetUnfolderBase]: For 3920/3941 co-relation queries the response was YES. [2023-11-17 11:29:36,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9282 conditions, 2521 events. 1520/2521 cut-off events. For 3920/3941 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13606 event pairs, 372 based on Foata normal form. 11/2524 useless extension candidates. Maximal degree in co-relation 9259. Up to 1801 conditions per place. [2023-11-17 11:29:36,308 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 66 selfloop transitions, 17 changer transitions 14/99 dead transitions. [2023-11-17 11:29:36,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 772 flow [2023-11-17 11:29:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2023-11-17 11:29:36,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49491525423728816 [2023-11-17 11:29:36,309 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 146 transitions. [2023-11-17 11:29:36,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 146 transitions. [2023-11-17 11:29:36,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:36,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 146 transitions. [2023-11-17 11:29:36,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:36,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:36,310 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:36,311 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 266 flow. Second operand 5 states and 146 transitions. [2023-11-17 11:29:36,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 772 flow [2023-11-17 11:29:36,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 99 transitions, 771 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:36,324 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 413 flow [2023-11-17 11:29:36,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=413, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2023-11-17 11:29:36,324 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2023-11-17 11:29:36,324 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 413 flow [2023-11-17 11:29:36,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:36,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:36,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:36,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:29:36,325 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:36,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1009469107, now seen corresponding path program 3 times [2023-11-17 11:29:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765441300] [2023-11-17 11:29:36,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:37,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765441300] [2023-11-17 11:29:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765441300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:37,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:29:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454864731] [2023-11-17 11:29:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:37,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:29:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:37,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:29:37,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:29:37,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2023-11-17 11:29:37,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 413 flow. Second operand has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:37,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:37,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2023-11-17 11:29:37,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:38,071 INFO L124 PetriNetUnfolderBase]: 2069/3516 cut-off events. [2023-11-17 11:29:38,071 INFO L125 PetriNetUnfolderBase]: For 8468/8492 co-relation queries the response was YES. [2023-11-17 11:29:38,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15000 conditions, 3516 events. 2069/3516 cut-off events. For 8468/8492 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 21310 event pairs, 402 based on Foata normal form. 9/3513 useless extension candidates. Maximal degree in co-relation 14974. Up to 1390 conditions per place. [2023-11-17 11:29:38,087 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 98 selfloop transitions, 24 changer transitions 58/182 dead transitions. [2023-11-17 11:29:38,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 182 transitions, 1566 flow [2023-11-17 11:29:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:29:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:29:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2023-11-17 11:29:38,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063559322033898 [2023-11-17 11:29:38,089 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 239 transitions. [2023-11-17 11:29:38,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 239 transitions. [2023-11-17 11:29:38,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:38,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 239 transitions. [2023-11-17 11:29:38,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,090 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,090 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 413 flow. Second operand 8 states and 239 transitions. [2023-11-17 11:29:38,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 182 transitions, 1566 flow [2023-11-17 11:29:38,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 182 transitions, 1561 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:38,117 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 594 flow [2023-11-17 11:29:38,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-11-17 11:29:38,118 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2023-11-17 11:29:38,118 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 594 flow [2023-11-17 11:29:38,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:38,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:38,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:29:38,118 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:38,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:38,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1726285389, now seen corresponding path program 4 times [2023-11-17 11:29:38,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:38,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179776100] [2023-11-17 11:29:38,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:38,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:39,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:39,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179776100] [2023-11-17 11:29:39,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179776100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:39,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:39,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 11:29:39,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63793089] [2023-11-17 11:29:39,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:39,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 11:29:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 11:29:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-17 11:29:39,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2023-11-17 11:29:39,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 594 flow. Second operand has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:39,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2023-11-17 11:29:39,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:39,932 INFO L124 PetriNetUnfolderBase]: 1756/2951 cut-off events. [2023-11-17 11:29:39,932 INFO L125 PetriNetUnfolderBase]: For 12157/12173 co-relation queries the response was YES. [2023-11-17 11:29:39,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14416 conditions, 2951 events. 1756/2951 cut-off events. For 12157/12173 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 16983 event pairs, 320 based on Foata normal form. 28/2974 useless extension candidates. Maximal degree in co-relation 14384. Up to 1208 conditions per place. [2023-11-17 11:29:39,945 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 75 selfloop transitions, 15 changer transitions 46/138 dead transitions. [2023-11-17 11:29:39,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 138 transitions, 1355 flow [2023-11-17 11:29:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:29:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:29:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2023-11-17 11:29:39,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028248587570622 [2023-11-17 11:29:39,947 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 178 transitions. [2023-11-17 11:29:39,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 178 transitions. [2023-11-17 11:29:39,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:39,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 178 transitions. [2023-11-17 11:29:39,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 59.0) internal successors, (413), 7 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 11:29:39,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 59.0) internal successors, (413), 7 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 11:29:39,948 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 594 flow. Second operand 6 states and 178 transitions. [2023-11-17 11:29:39,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 138 transitions, 1355 flow [2023-11-17 11:29:39,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 138 transitions, 1337 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:39,974 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 590 flow [2023-11-17 11:29:39,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2023-11-17 11:29:39,975 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2023-11-17 11:29:39,975 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 590 flow [2023-11-17 11:29:39,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:39,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:39,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:29:39,975 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:39,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -537289061, now seen corresponding path program 5 times [2023-11-17 11:29:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914895956] [2023-11-17 11:29:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:40,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914895956] [2023-11-17 11:29:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914895956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:40,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:29:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215230636] [2023-11-17 11:29:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:40,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:29:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:40,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:29:40,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:29:40,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:40,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 590 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:40,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:40,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:40,498 INFO L124 PetriNetUnfolderBase]: 1020/1676 cut-off events. [2023-11-17 11:29:40,498 INFO L125 PetriNetUnfolderBase]: For 9892/9910 co-relation queries the response was YES. [2023-11-17 11:29:40,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8344 conditions, 1676 events. 1020/1676 cut-off events. For 9892/9910 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8518 event pairs, 108 based on Foata normal form. 41/1711 useless extension candidates. Maximal degree in co-relation 8321. Up to 652 conditions per place. [2023-11-17 11:29:40,505 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 74 selfloop transitions, 18 changer transitions 49/142 dead transitions. [2023-11-17 11:29:40,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 142 transitions, 1610 flow [2023-11-17 11:29:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:29:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:29:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2023-11-17 11:29:40,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41404358353510895 [2023-11-17 11:29:40,509 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 171 transitions. [2023-11-17 11:29:40,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 171 transitions. [2023-11-17 11:29:40,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:40,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 171 transitions. [2023-11-17 11:29:40,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,511 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,511 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 590 flow. Second operand 7 states and 171 transitions. [2023-11-17 11:29:40,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 142 transitions, 1610 flow [2023-11-17 11:29:40,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 142 transitions, 1447 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-11-17 11:29:40,527 INFO L231 Difference]: Finished difference. Result has 74 places, 49 transitions, 411 flow [2023-11-17 11:29:40,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=74, PETRI_TRANSITIONS=49} [2023-11-17 11:29:40,528 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2023-11-17 11:29:40,528 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 49 transitions, 411 flow [2023-11-17 11:29:40,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:40,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:40,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:29:40,528 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:40,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash -631252124, now seen corresponding path program 1 times [2023-11-17 11:29:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507103011] [2023-11-17 11:29:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:29:40,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:29:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:29:40,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:29:40,670 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:29:40,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:29:40,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-17 11:29:40,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:29:40,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:29:40,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-17 11:29:40,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:29:40,672 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:40,677 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:29:40,677 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:29:40,725 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated [2023-11-17 11:29:40,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-17 11:29:40,728 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-17 11:29:40,730 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-11-17 11:29:40,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:29:40 BasicIcfg [2023-11-17 11:29:40,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:29:40,755 INFO L158 Benchmark]: Toolchain (without parser) took 17899.66ms. Allocated memory was 269.5MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 220.6MB in the beginning and 1.1GB in the end (delta: -830.4MB). Peak memory consumption was 265.3MB. Max. memory is 8.0GB. [2023-11-17 11:29:40,755 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory was 149.7MB in the beginning and 149.6MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:29:40,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.90ms. Allocated memory is still 269.5MB. Free memory was 220.0MB in the beginning and 194.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-11-17 11:29:40,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.20ms. Allocated memory is still 269.5MB. Free memory was 194.9MB in the beginning and 192.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:40,757 INFO L158 Benchmark]: Boogie Preprocessor took 61.34ms. Allocated memory is still 269.5MB. Free memory was 192.2MB in the beginning and 190.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:40,757 INFO L158 Benchmark]: RCFGBuilder took 865.62ms. Allocated memory is still 269.5MB. Free memory was 190.1MB in the beginning and 198.4MB in the end (delta: -8.2MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:40,757 INFO L158 Benchmark]: TraceAbstraction took 16545.88ms. Allocated memory was 269.5MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 197.8MB in the beginning and 1.1GB in the end (delta: -853.2MB). Peak memory consumption was 241.0MB. Max. memory is 8.0GB. [2023-11-17 11:29:40,758 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.10ms. Allocated memory is still 192.9MB. Free memory was 149.7MB in the beginning and 149.6MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 375.90ms. Allocated memory is still 269.5MB. Free memory was 220.0MB in the beginning and 194.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.20ms. Allocated memory is still 269.5MB. Free memory was 194.9MB in the beginning and 192.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.34ms. Allocated memory is still 269.5MB. Free memory was 192.2MB in the beginning and 190.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 865.62ms. Allocated memory is still 269.5MB. Free memory was 190.1MB in the beginning and 198.4MB in the end (delta: -8.2MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16545.88ms. Allocated memory was 269.5MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 197.8MB in the beginning and 1.1GB in the end (delta: -853.2MB). Peak memory consumption was 241.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 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: 1.7s, 51 PlacesBefore, 37 PlacesAfterwards, 38 TransitionsBefore, 24 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1622 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 707, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 498, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 498, independent: 442, independent conditional: 0, independent unconditional: 442, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 299, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 707, independent: 184, independent conditional: 0, independent unconditional: 184, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2245; [L872] FCALL, FORK 0 pthread_create(&t2245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2245={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L873] 0 pthread_t t2246; [L874] FCALL, FORK 0 pthread_create(&t2246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2245={6:0}, t2246={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L875] 0 pthread_t t2247; [L876] FCALL, FORK 0 pthread_create(&t2247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2245={6:0}, t2246={7:0}, t2247={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L829] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L877] 0 pthread_t t2248; [L878] FCALL, FORK 0 pthread_create(&t2248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2245={6:0}, t2246={7:0}, t2247={8:0}, t2248={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L846] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 \read(x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L794] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245={6:0}, t2246={7:0}, t2247={8:0}, t2248={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L885] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L886] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L887] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L888] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245={6:0}, t2246={7:0}, t2247={8:0}, t2248={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 874]: 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: 878]: 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: 876]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 75 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 603 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1263 IncrementalHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 2 mSDtfsCounter, 1263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=594occurred in iteration=11, InterpolantAutomatonStates: 65, 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.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 2821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:29:40,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...