/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:12:44,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:12:44,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:12:44,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:12:44,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:12:44,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:12:44,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:12:44,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:12:44,506 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:12:44,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:12:44,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:12:44,507 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:12:44,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:12:44,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:12:44,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:12:44,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:12:44,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:12:44,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:12:44,509 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:12:44,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:12:44,510 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:12:44,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:12:44,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:12:44,511 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:12:44,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:12:44,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:44,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:12:44,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:12:44,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:12:44,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:12:44,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:12:44,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:12:44,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:12:44,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:12:44,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:12:44,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:12:44,765 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:12:44,765 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:12:44,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2023-11-17 15:12:45,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:12:46,167 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:12:46,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2023-11-17 15:12:46,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbcec268/03890c14cdeb4fd0a5d5d4a5127d7534/FLAGf71834406 [2023-11-17 15:12:46,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbcec268/03890c14cdeb4fd0a5d5d4a5127d7534 [2023-11-17 15:12:46,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:12:46,200 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:12:46,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:46,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:12:46,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:12:46,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15420ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46, skipping insertion in model container [2023-11-17 15:12:46,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,247 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:12:46,388 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/mix011_tso.oepc.i[949,962] [2023-11-17 15:12:46,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:46,584 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:12:46,597 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/mix011_tso.oepc.i[949,962] [2023-11-17 15:12:46,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:46,695 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:46,695 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:46,721 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:12:46,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46 WrapperNode [2023-11-17 15:12:46,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:46,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:46,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:12:46,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:12:46,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,805 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-11-17 15:12:46,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:46,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:12:46,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:12:46,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:12:46,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:12:46,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:12:46,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:12:46,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:12:46,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (1/1) ... [2023-11-17 15:12:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:46,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:12:46,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:12:46,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:12:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:12:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:12:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:12:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:12:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:12:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:12:46,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:12:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:12:46,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:12:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:12:46,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:12:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:12:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:12:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:12:46,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:12:46,949 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:12:47,115 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:12:47,117 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:12:47,426 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:12:47,591 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:12:47,591 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:12:47,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:47 BoogieIcfgContainer [2023-11-17 15:12:47,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:12:47,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:12:47,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:12:47,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:12:47,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:46" (1/3) ... [2023-11-17 15:12:47,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9398a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:47, skipping insertion in model container [2023-11-17 15:12:47,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:46" (2/3) ... [2023-11-17 15:12:47,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9398a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:47, skipping insertion in model container [2023-11-17 15:12:47,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:47" (3/3) ... [2023-11-17 15:12:47,606 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2023-11-17 15:12:47,622 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:12:47,623 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:12:47,623 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:12:47,690 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:12:47,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 248 flow [2023-11-17 15:12:47,812 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-11-17 15:12:47,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:47,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-17 15:12:47,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 118 transitions, 248 flow [2023-11-17 15:12:47,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 115 transitions, 239 flow [2023-11-17 15:12:47,833 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:12:47,854 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 115 transitions, 239 flow [2023-11-17 15:12:47,858 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 115 transitions, 239 flow [2023-11-17 15:12:47,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 239 flow [2023-11-17 15:12:47,901 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-11-17 15:12:47,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:47,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-17 15:12:47,906 INFO L119 LiptonReduction]: Number of co-enabled transitions 2508 [2023-11-17 15:12:52,144 INFO L134 LiptonReduction]: Checked pairs total: 6600 [2023-11-17 15:12:52,144 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-11-17 15:12:52,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:12:52,165 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;@4ec55a06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:12:52,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:12:52,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:12:52,170 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 15:12:52,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:52,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:52,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:12:52,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:52,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash 486410825, now seen corresponding path program 1 times [2023-11-17 15:12:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:52,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615841313] [2023-11-17 15:12:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615841313] [2023-11-17 15:12:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615841313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:52,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:52,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:52,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722483566] [2023-11-17 15:12:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:52,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:52,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:52,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:52,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 221 [2023-11-17 15:12:52,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:52,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:52,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 221 [2023-11-17 15:12:52,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:52,939 INFO L124 PetriNetUnfolderBase]: 855/1506 cut-off events. [2023-11-17 15:12:52,940 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 15:12:52,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1506 events. 855/1506 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8564 event pairs, 141 based on Foata normal form. 0/1429 useless extension candidates. Maximal degree in co-relation 2822. Up to 1027 conditions per place. [2023-11-17 15:12:52,957 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 29 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-17 15:12:52,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 154 flow [2023-11-17 15:12:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-11-17 15:12:52,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203619909502263 [2023-11-17 15:12:52,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-11-17 15:12:52,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-11-17 15:12:52,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:52,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-11-17 15:12:52,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:52,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:52,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:52,995 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 345 transitions. [2023-11-17 15:12:52,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 154 flow [2023-11-17 15:12:52,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:12:52,999 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 58 flow [2023-11-17 15:12:53,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-11-17 15:12:53,007 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-11-17 15:12:53,007 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 58 flow [2023-11-17 15:12:53,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:53,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:53,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:53,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:12:53,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:53,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 749252591, now seen corresponding path program 1 times [2023-11-17 15:12:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900578263] [2023-11-17 15:12:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:53,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:53,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900578263] [2023-11-17 15:12:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900578263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:53,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:53,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:53,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672914322] [2023-11-17 15:12:53,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:53,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:53,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:53,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 221 [2023-11-17 15:12:53,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:53,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:53,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 221 [2023-11-17 15:12:53,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:54,246 INFO L124 PetriNetUnfolderBase]: 2155/3186 cut-off events. [2023-11-17 15:12:54,246 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-17 15:12:54,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6618 conditions, 3186 events. 2155/3186 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13982 event pairs, 611 based on Foata normal form. 180/3366 useless extension candidates. Maximal degree in co-relation 6608. Up to 2001 conditions per place. [2023-11-17 15:12:54,261 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 33 selfloop transitions, 2 changer transitions 24/59 dead transitions. [2023-11-17 15:12:54,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 59 transitions, 252 flow [2023-11-17 15:12:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2023-11-17 15:12:54,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43981900452488687 [2023-11-17 15:12:54,266 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 486 transitions. [2023-11-17 15:12:54,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 486 transitions. [2023-11-17 15:12:54,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:54,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 486 transitions. [2023-11-17 15:12:54,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:54,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:54,273 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:54,273 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 58 flow. Second operand 5 states and 486 transitions. [2023-11-17 15:12:54,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 59 transitions, 252 flow [2023-11-17 15:12:54,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 59 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:54,277 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 66 flow [2023-11-17 15:12:54,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-11-17 15:12:54,277 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-11-17 15:12:54,278 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 66 flow [2023-11-17 15:12:54,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:54,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:54,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:54,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:12:54,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:54,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1519341938, now seen corresponding path program 1 times [2023-11-17 15:12:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:54,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742612759] [2023-11-17 15:12:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:54,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742612759] [2023-11-17 15:12:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742612759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:54,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:54,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:54,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428463558] [2023-11-17 15:12:54,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:54,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:54,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 221 [2023-11-17 15:12:54,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:54,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:54,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 221 [2023-11-17 15:12:54,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:55,131 INFO L124 PetriNetUnfolderBase]: 1833/2724 cut-off events. [2023-11-17 15:12:55,131 INFO L125 PetriNetUnfolderBase]: For 540/540 co-relation queries the response was YES. [2023-11-17 15:12:55,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5987 conditions, 2724 events. 1833/2724 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12037 event pairs, 479 based on Foata normal form. 120/2844 useless extension candidates. Maximal degree in co-relation 5974. Up to 1829 conditions per place. [2023-11-17 15:12:55,148 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 35 selfloop transitions, 2 changer transitions 20/57 dead transitions. [2023-11-17 15:12:55,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 253 flow [2023-11-17 15:12:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2023-11-17 15:12:55,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43800904977375565 [2023-11-17 15:12:55,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 484 transitions. [2023-11-17 15:12:55,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 484 transitions. [2023-11-17 15:12:55,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:55,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 484 transitions. [2023-11-17 15:12:55,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,155 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,155 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 66 flow. Second operand 5 states and 484 transitions. [2023-11-17 15:12:55,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 253 flow [2023-11-17 15:12:55,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 243 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 15:12:55,170 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 70 flow [2023-11-17 15:12:55,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=5, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-11-17 15:12:55,172 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-11-17 15:12:55,172 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 70 flow [2023-11-17 15:12:55,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:55,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:55,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:12:55,173 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:55,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1555567045, now seen corresponding path program 1 times [2023-11-17 15:12:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:55,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184605847] [2023-11-17 15:12:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:55,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184605847] [2023-11-17 15:12:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184605847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704511773] [2023-11-17 15:12:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:55,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:12:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:12:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:12:55,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 221 [2023-11-17 15:12:55,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:55,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 221 [2023-11-17 15:12:55,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:55,986 INFO L124 PetriNetUnfolderBase]: 812/1398 cut-off events. [2023-11-17 15:12:55,986 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2023-11-17 15:12:55,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 1398 events. 812/1398 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7352 event pairs, 208 based on Foata normal form. 49/1438 useless extension candidates. Maximal degree in co-relation 3022. Up to 1005 conditions per place. [2023-11-17 15:12:56,013 INFO L140 encePairwiseOnDemand]: 214/221 looper letters, 36 selfloop transitions, 6 changer transitions 14/60 dead transitions. [2023-11-17 15:12:56,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 264 flow [2023-11-17 15:12:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:12:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:12:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 622 transitions. [2023-11-17 15:12:56,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46907993966817496 [2023-11-17 15:12:56,016 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 622 transitions. [2023-11-17 15:12:56,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 622 transitions. [2023-11-17 15:12:56,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:56,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 622 transitions. [2023-11-17 15:12:56,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,021 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 70 flow. Second operand 6 states and 622 transitions. [2023-11-17 15:12:56,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 264 flow [2023-11-17 15:12:56,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 256 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 15:12:56,026 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 109 flow [2023-11-17 15:12:56,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=62, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-17 15:12:56,027 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-11-17 15:12:56,027 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 109 flow [2023-11-17 15:12:56,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:56,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:56,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:12:56,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:56,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash 461762254, now seen corresponding path program 1 times [2023-11-17 15:12:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:56,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658189216] [2023-11-17 15:12:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:56,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:56,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658189216] [2023-11-17 15:12:56,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658189216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:56,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:56,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:12:56,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654670420] [2023-11-17 15:12:56,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:56,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:12:56,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:12:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:12:56,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 221 [2023-11-17 15:12:56,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 109 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:56,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 221 [2023-11-17 15:12:56,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:57,376 INFO L124 PetriNetUnfolderBase]: 1942/2876 cut-off events. [2023-11-17 15:12:57,377 INFO L125 PetriNetUnfolderBase]: For 1291/1291 co-relation queries the response was YES. [2023-11-17 15:12:57,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7555 conditions, 2876 events. 1942/2876 cut-off events. For 1291/1291 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12581 event pairs, 417 based on Foata normal form. 55/2931 useless extension candidates. Maximal degree in co-relation 7539. Up to 2286 conditions per place. [2023-11-17 15:12:57,396 INFO L140 encePairwiseOnDemand]: 208/221 looper letters, 71 selfloop transitions, 28 changer transitions 16/115 dead transitions. [2023-11-17 15:12:57,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 115 transitions, 599 flow [2023-11-17 15:12:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:12:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:12:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2023-11-17 15:12:57,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43574660633484164 [2023-11-17 15:12:57,400 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2023-11-17 15:12:57,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2023-11-17 15:12:57,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:57,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2023-11-17 15:12:57,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,409 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,409 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 109 flow. Second operand 10 states and 963 transitions. [2023-11-17 15:12:57,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 115 transitions, 599 flow [2023-11-17 15:12:57,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 115 transitions, 597 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:57,415 INFO L231 Difference]: Finished difference. Result has 54 places, 56 transitions, 320 flow [2023-11-17 15:12:57,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2023-11-17 15:12:57,417 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-11-17 15:12:57,417 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 320 flow [2023-11-17 15:12:57,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:57,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:57,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:12:57,418 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:57,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1465706040, now seen corresponding path program 2 times [2023-11-17 15:12:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063305736] [2023-11-17 15:12:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:57,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063305736] [2023-11-17 15:12:57,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063305736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:57,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:57,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:12:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326562362] [2023-11-17 15:12:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:57,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:12:57,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:57,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:12:57,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:12:57,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-11-17 15:12:57,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:57,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-11-17 15:12:57,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:58,438 INFO L124 PetriNetUnfolderBase]: 1412/2341 cut-off events. [2023-11-17 15:12:58,438 INFO L125 PetriNetUnfolderBase]: For 5040/5558 co-relation queries the response was YES. [2023-11-17 15:12:58,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 2341 events. 1412/2341 cut-off events. For 5040/5558 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12577 event pairs, 295 based on Foata normal form. 142/2414 useless extension candidates. Maximal degree in co-relation 8052. Up to 1370 conditions per place. [2023-11-17 15:12:58,460 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 47 selfloop transitions, 24 changer transitions 12/93 dead transitions. [2023-11-17 15:12:58,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 622 flow [2023-11-17 15:12:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:12:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:12:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 719 transitions. [2023-11-17 15:12:58,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.464770523594053 [2023-11-17 15:12:58,464 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 719 transitions. [2023-11-17 15:12:58,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 719 transitions. [2023-11-17 15:12:58,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:58,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 719 transitions. [2023-11-17 15:12:58,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,469 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 320 flow. Second operand 7 states and 719 transitions. [2023-11-17 15:12:58,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 622 flow [2023-11-17 15:12:58,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 93 transitions, 596 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:58,485 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 396 flow [2023-11-17 15:12:58,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2023-11-17 15:12:58,487 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2023-11-17 15:12:58,488 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 396 flow [2023-11-17 15:12:58,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:58,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:58,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:12:58,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:58,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -306310564, now seen corresponding path program 1 times [2023-11-17 15:12:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355227740] [2023-11-17 15:12:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:58,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355227740] [2023-11-17 15:12:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355227740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:58,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:12:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269649219] [2023-11-17 15:12:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:58,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:12:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:58,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:12:58,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:12:58,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 221 [2023-11-17 15:12:58,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:58,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 221 [2023-11-17 15:12:58,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:59,563 INFO L124 PetriNetUnfolderBase]: 2854/4256 cut-off events. [2023-11-17 15:12:59,564 INFO L125 PetriNetUnfolderBase]: For 10521/10521 co-relation queries the response was YES. [2023-11-17 15:12:59,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16680 conditions, 4256 events. 2854/4256 cut-off events. For 10521/10521 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 20568 event pairs, 246 based on Foata normal form. 54/4310 useless extension candidates. Maximal degree in co-relation 16653. Up to 2315 conditions per place. [2023-11-17 15:12:59,593 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 96 selfloop transitions, 16 changer transitions 29/141 dead transitions. [2023-11-17 15:12:59,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 141 transitions, 1195 flow [2023-11-17 15:12:59,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:12:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:12:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2023-11-17 15:12:59,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253393665158371 [2023-11-17 15:12:59,596 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2023-11-17 15:12:59,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2023-11-17 15:12:59,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:59,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2023-11-17 15:12:59,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,601 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,601 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 396 flow. Second operand 7 states and 658 transitions. [2023-11-17 15:12:59,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 141 transitions, 1195 flow [2023-11-17 15:12:59,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 141 transitions, 1079 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-11-17 15:12:59,632 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 436 flow [2023-11-17 15:12:59,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2023-11-17 15:12:59,632 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2023-11-17 15:12:59,633 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 436 flow [2023-11-17 15:12:59,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:59,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:59,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:12:59,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:59,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:59,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2045509610, now seen corresponding path program 2 times [2023-11-17 15:12:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:59,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933969057] [2023-11-17 15:12:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933969057] [2023-11-17 15:12:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933969057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662390303] [2023-11-17 15:12:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:59,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:59,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:59,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:59,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 221 [2023-11-17 15:12:59,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:59,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 221 [2023-11-17 15:12:59,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:59,981 INFO L124 PetriNetUnfolderBase]: 802/1457 cut-off events. [2023-11-17 15:12:59,981 INFO L125 PetriNetUnfolderBase]: For 4185/4328 co-relation queries the response was YES. [2023-11-17 15:12:59,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5478 conditions, 1457 events. 802/1457 cut-off events. For 4185/4328 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8129 event pairs, 197 based on Foata normal form. 92/1491 useless extension candidates. Maximal degree in co-relation 5450. Up to 1078 conditions per place. [2023-11-17 15:12:59,996 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 60 selfloop transitions, 4 changer transitions 6/83 dead transitions. [2023-11-17 15:12:59,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 657 flow [2023-11-17 15:12:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-11-17 15:12:59,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.497737556561086 [2023-11-17 15:12:59,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-11-17 15:12:59,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-11-17 15:12:59,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:59,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-11-17 15:12:59,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,002 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 436 flow. Second operand 3 states and 330 transitions. [2023-11-17 15:13:00,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 657 flow [2023-11-17 15:13:00,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 645 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:00,011 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 385 flow [2023-11-17 15:13:00,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-11-17 15:13:00,014 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2023-11-17 15:13:00,014 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 385 flow [2023-11-17 15:13:00,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:00,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:00,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:13:00,015 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:13:00,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1179970393, now seen corresponding path program 1 times [2023-11-17 15:13:00,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:00,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691096017] [2023-11-17 15:13:00,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:00,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691096017] [2023-11-17 15:13:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691096017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:00,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:00,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:13:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26587523] [2023-11-17 15:13:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:00,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:13:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:13:00,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:13:00,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 221 [2023-11-17 15:13:00,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:00,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 221 [2023-11-17 15:13:00,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:00,355 INFO L124 PetriNetUnfolderBase]: 368/755 cut-off events. [2023-11-17 15:13:00,355 INFO L125 PetriNetUnfolderBase]: For 1745/1827 co-relation queries the response was YES. [2023-11-17 15:13:00,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 755 events. 368/755 cut-off events. For 1745/1827 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3989 event pairs, 82 based on Foata normal form. 95/829 useless extension candidates. Maximal degree in co-relation 2972. Up to 232 conditions per place. [2023-11-17 15:13:00,361 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 63 selfloop transitions, 7 changer transitions 6/89 dead transitions. [2023-11-17 15:13:00,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 709 flow [2023-11-17 15:13:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:13:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:13:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-11-17 15:13:00,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.497737556561086 [2023-11-17 15:13:00,364 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-11-17 15:13:00,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-11-17 15:13:00,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:00,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-11-17 15:13:00,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,368 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,368 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 385 flow. Second operand 4 states and 440 transitions. [2023-11-17 15:13:00,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 709 flow [2023-11-17 15:13:00,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 705 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:13:00,374 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 408 flow [2023-11-17 15:13:00,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=408, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-11-17 15:13:00,375 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2023-11-17 15:13:00,375 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 408 flow [2023-11-17 15:13:00,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:00,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:00,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:13:00,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:13:00,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1658278986, now seen corresponding path program 1 times [2023-11-17 15:13:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262579563] [2023-11-17 15:13:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:00,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:00,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262579563] [2023-11-17 15:13:00,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262579563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:00,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:00,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:13:00,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868360921] [2023-11-17 15:13:00,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:00,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:13:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:00,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:13:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:13:00,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 221 [2023-11-17 15:13:00,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:00,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 221 [2023-11-17 15:13:00,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:00,724 INFO L124 PetriNetUnfolderBase]: 315/632 cut-off events. [2023-11-17 15:13:00,724 INFO L125 PetriNetUnfolderBase]: For 1874/1955 co-relation queries the response was YES. [2023-11-17 15:13:00,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 632 events. 315/632 cut-off events. For 1874/1955 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3287 event pairs, 71 based on Foata normal form. 40/652 useless extension candidates. Maximal degree in co-relation 2608. Up to 223 conditions per place. [2023-11-17 15:13:00,729 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 46 selfloop transitions, 10 changer transitions 24/88 dead transitions. [2023-11-17 15:13:00,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 727 flow [2023-11-17 15:13:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:13:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:13:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 539 transitions. [2023-11-17 15:13:00,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48778280542986424 [2023-11-17 15:13:00,731 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 539 transitions. [2023-11-17 15:13:00,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 539 transitions. [2023-11-17 15:13:00,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:00,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 539 transitions. [2023-11-17 15:13:00,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,736 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,736 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 408 flow. Second operand 5 states and 539 transitions. [2023-11-17 15:13:00,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 727 flow [2023-11-17 15:13:00,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 691 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-17 15:13:00,748 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 297 flow [2023-11-17 15:13:00,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-11-17 15:13:00,749 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2023-11-17 15:13:00,750 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 297 flow [2023-11-17 15:13:00,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:00,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:00,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:13:00,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:13:00,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1310724335, now seen corresponding path program 1 times [2023-11-17 15:13:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888731622] [2023-11-17 15:13:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:01,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888731622] [2023-11-17 15:13:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888731622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:13:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768485218] [2023-11-17 15:13:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:01,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:13:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:13:01,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:13:01,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 221 [2023-11-17 15:13:01,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:01,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 221 [2023-11-17 15:13:01,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:01,415 INFO L124 PetriNetUnfolderBase]: 414/745 cut-off events. [2023-11-17 15:13:01,415 INFO L125 PetriNetUnfolderBase]: For 1824/1824 co-relation queries the response was YES. [2023-11-17 15:13:01,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 745 events. 414/745 cut-off events. For 1824/1824 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3095 event pairs, 108 based on Foata normal form. 1/746 useless extension candidates. Maximal degree in co-relation 3084. Up to 498 conditions per place. [2023-11-17 15:13:01,419 INFO L140 encePairwiseOnDemand]: 214/221 looper letters, 43 selfloop transitions, 3 changer transitions 50/96 dead transitions. [2023-11-17 15:13:01,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 96 transitions, 806 flow [2023-11-17 15:13:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:13:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:13:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 642 transitions. [2023-11-17 15:13:01,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41499676793794443 [2023-11-17 15:13:01,422 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 642 transitions. [2023-11-17 15:13:01,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 642 transitions. [2023-11-17 15:13:01,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:01,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 642 transitions. [2023-11-17 15:13:01,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,426 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,427 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 297 flow. Second operand 7 states and 642 transitions. [2023-11-17 15:13:01,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 96 transitions, 806 flow [2023-11-17 15:13:01,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 690 flow, removed 32 selfloop flow, removed 11 redundant places. [2023-11-17 15:13:01,434 INFO L231 Difference]: Finished difference. Result has 61 places, 36 transitions, 198 flow [2023-11-17 15:13:01,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2023-11-17 15:13:01,434 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-11-17 15:13:01,435 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 36 transitions, 198 flow [2023-11-17 15:13:01,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:01,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:01,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:13:01,435 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:13:01,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:01,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1051018137, now seen corresponding path program 2 times [2023-11-17 15:13:01,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:01,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576894771] [2023-11-17 15:13:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:01,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:13:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:01,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:13:01,583 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:13:01,584 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:13:01,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:13:01,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:13:01,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:13:01,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:13:01,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:13:01,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:13:01,586 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:01,592 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:13:01,592 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:13:01,647 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 15:13:01,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:13:01,651 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:13:01,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:13:01 BasicIcfg [2023-11-17 15:13:01,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:13:01,721 INFO L158 Benchmark]: Toolchain (without parser) took 15521.35ms. Allocated memory was 175.1MB in the beginning and 483.4MB in the end (delta: 308.3MB). Free memory was 116.5MB in the beginning and 444.6MB in the end (delta: -328.1MB). Peak memory consumption was 150.6MB. Max. memory is 8.0GB. [2023-11-17 15:13:01,721 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 175.1MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:13:01,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.58ms. Allocated memory was 175.1MB in the beginning and 261.1MB in the end (delta: 86.0MB). Free memory was 116.3MB in the beginning and 230.0MB in the end (delta: -113.7MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2023-11-17 15:13:01,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.89ms. Allocated memory is still 261.1MB. Free memory was 230.0MB in the beginning and 227.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:01,722 INFO L158 Benchmark]: Boogie Preprocessor took 53.58ms. Allocated memory is still 261.1MB. Free memory was 227.4MB in the beginning and 225.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:01,722 INFO L158 Benchmark]: RCFGBuilder took 732.44ms. Allocated memory is still 261.1MB. Free memory was 225.3MB in the beginning and 188.6MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-11-17 15:13:01,723 INFO L158 Benchmark]: TraceAbstraction took 14120.50ms. Allocated memory was 261.1MB in the beginning and 483.4MB in the end (delta: 222.3MB). Free memory was 188.1MB in the beginning and 444.6MB in the end (delta: -256.6MB). Peak memory consumption was 135.3MB. Max. memory is 8.0GB. [2023-11-17 15:13:01,724 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.15ms. Allocated memory is still 175.1MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 523.58ms. Allocated memory was 175.1MB in the beginning and 261.1MB in the end (delta: 86.0MB). Free memory was 116.3MB in the beginning and 230.0MB in the end (delta: -113.7MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.89ms. Allocated memory is still 261.1MB. Free memory was 230.0MB in the beginning and 227.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.58ms. Allocated memory is still 261.1MB. Free memory was 227.4MB in the beginning and 225.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 732.44ms. Allocated memory is still 261.1MB. Free memory was 225.3MB in the beginning and 188.6MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14120.50ms. Allocated memory was 261.1MB in the beginning and 483.4MB in the end (delta: 222.3MB). Free memory was 188.1MB in the beginning and 444.6MB in the end (delta: -256.6MB). Peak memory consumption was 135.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 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: 4.3s, 122 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 27 TransitionsAfterwards, 2508 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 6600 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3116, independent: 2920, independent conditional: 0, independent unconditional: 2920, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1794, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1794, independent: 1724, independent conditional: 0, independent unconditional: 1724, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 452, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 428, dependent conditional: 0, dependent unconditional: 428, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3116, independent: 1176, independent conditional: 0, independent unconditional: 1176, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 1794, unknown conditional: 0, unknown unconditional: 1794] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 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 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 840]: 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: 838]: 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 7 procedures, 147 locations, 6 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: 13.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1187 IncrementalHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 57 mSDtfsCounter, 1187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 1504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:13:01,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...