/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/safe012_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:18:19,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:18:19,541 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:18:19,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:18:19,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:18:19,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:18:19,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:18:19,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:18:19,576 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:18:19,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:18:19,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:18:19,577 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:18:19,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:18:19,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:18:19,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:18:19,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:18:19,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:18:19,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:18:19,579 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:18:19,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:18:19,579 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:18:19,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:18:19,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:18:19,581 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:18:19,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:18:19,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:18:19,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:18:19,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:18:19,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:18:19,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:18:19,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:18:19,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:18:19,583 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:18:19,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:18:19,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:18:19,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:18:19,796 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:18:19,796 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:18:19,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.oepc.i [2023-11-17 15:18:21,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:18:21,249 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:18:21,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_rmo.oepc.i [2023-11-17 15:18:21,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0811f1187/bb0b6c8825b642259212b33d24c4b952/FLAG3c52f2611 [2023-11-17 15:18:21,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0811f1187/bb0b6c8825b642259212b33d24c4b952 [2023-11-17 15:18:21,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:18:21,290 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:18:21,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:18:21,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:18:21,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:18:21,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72859cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21, skipping insertion in model container [2023-11-17 15:18:21,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,342 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:18:21,492 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/safe012_rmo.oepc.i[993,1006] [2023-11-17 15:18:21,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:18:21,675 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:18:21,687 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/safe012_rmo.oepc.i[993,1006] [2023-11-17 15:18:21,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:18:21,780 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:18:21,780 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:18:21,785 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:18:21,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21 WrapperNode [2023-11-17 15:18:21,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:18:21,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:18:21,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:18:21,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:18:21,792 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:18:21" (1/1) ... [2023-11-17 15:18:21,823 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:18:21" (1/1) ... [2023-11-17 15:18:21,850 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-11-17 15:18:21,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:18:21,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:18:21,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:18:21,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:18:21,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:18:21,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:18:21,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:18:21,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:18:21,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (1/1) ... [2023-11-17 15:18:21,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:18:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:18:21,939 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:18:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:18:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:18:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:18:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:18:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:18:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:18:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:18:21,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:18:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:18:21,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:18:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:18:21,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:18:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:18:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:18:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:18:21,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:18:21,965 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:18:21,968 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:18:22,153 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:18:22,157 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:18:22,514 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:18:22,693 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:18:22,693 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:18:22,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:18:22 BoogieIcfgContainer [2023-11-17 15:18:22,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:18:22,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:18:22,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:18:22,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:18:22,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:18:21" (1/3) ... [2023-11-17 15:18:22,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5c0f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:22, skipping insertion in model container [2023-11-17 15:18:22,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:21" (2/3) ... [2023-11-17 15:18:22,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5c0f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:22, skipping insertion in model container [2023-11-17 15:18:22,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:18:22" (3/3) ... [2023-11-17 15:18:22,702 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_rmo.oepc.i [2023-11-17 15:18:22,716 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:18:22,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 15:18:22,716 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:18:22,796 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:18:22,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 272 flow [2023-11-17 15:18:22,888 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-11-17 15:18:22,889 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:22,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-17 15:18:22,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 130 transitions, 272 flow [2023-11-17 15:18:22,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 112 transitions, 233 flow [2023-11-17 15:18:22,902 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:18:22,915 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 112 transitions, 233 flow [2023-11-17 15:18:22,918 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 112 transitions, 233 flow [2023-11-17 15:18:22,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 112 transitions, 233 flow [2023-11-17 15:18:22,955 INFO L124 PetriNetUnfolderBase]: 1/112 cut-off events. [2023-11-17 15:18:22,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:22,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 1/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-17 15:18:22,957 INFO L119 LiptonReduction]: Number of co-enabled transitions 1344 [2023-11-17 15:18:28,665 INFO L134 LiptonReduction]: Checked pairs total: 3165 [2023-11-17 15:18:28,665 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-17 15:18:28,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:18:28,681 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;@31eae2aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:18:28,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 15:18:28,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:18:28,684 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-11-17 15:18:28,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:28,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:28,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:28,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:28,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash 254474130, now seen corresponding path program 1 times [2023-11-17 15:18:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:28,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761818505] [2023-11-17 15:18:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:28,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:28,834 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:18:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761818505] [2023-11-17 15:18:28,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761818505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:28,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:28,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:18:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86081631] [2023-11-17 15:18:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:28,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:18:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:28,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:18:28,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:18:28,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 229 [2023-11-17 15:18:28,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:28,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:28,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 229 [2023-11-17 15:18:28,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:29,044 INFO L124 PetriNetUnfolderBase]: 711/1072 cut-off events. [2023-11-17 15:18:29,045 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-17 15:18:29,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 1072 events. 711/1072 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3964 event pairs, 711 based on Foata normal form. 0/1072 useless extension candidates. Maximal degree in co-relation 2180. Up to 1073 conditions per place. [2023-11-17 15:18:29,055 INFO L140 encePairwiseOnDemand]: 228/229 looper letters, 19 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-11-17 15:18:29,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 85 flow [2023-11-17 15:18:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:18:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:18:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2023-11-17 15:18:29,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633187772925764 [2023-11-17 15:18:29,072 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2023-11-17 15:18:29,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2023-11-17 15:18:29,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:29,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2023-11-17 15:18:29,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,086 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,088 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 258 transitions. [2023-11-17 15:18:29,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 85 flow [2023-11-17 15:18:29,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:18:29,091 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2023-11-17 15:18:29,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-11-17 15:18:29,097 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2023-11-17 15:18:29,098 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 44 flow [2023-11-17 15:18:29,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:29,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:29,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:18:29,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:29,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash -263492290, now seen corresponding path program 1 times [2023-11-17 15:18:29,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:29,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158629398] [2023-11-17 15:18:29,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:29,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:29,443 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:18:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158629398] [2023-11-17 15:18:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158629398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871794009] [2023-11-17 15:18:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:29,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:29,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:29,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:29,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 229 [2023-11-17 15:18:29,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:29,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 229 [2023-11-17 15:18:29,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:29,586 INFO L124 PetriNetUnfolderBase]: 671/1016 cut-off events. [2023-11-17 15:18:29,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:29,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 1016 events. 671/1016 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3787 event pairs, 159 based on Foata normal form. 16/1032 useless extension candidates. Maximal degree in co-relation 2074. Up to 817 conditions per place. [2023-11-17 15:18:29,592 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-11-17 15:18:29,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 114 flow [2023-11-17 15:18:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-17 15:18:29,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5516739446870451 [2023-11-17 15:18:29,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-17 15:18:29,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-17 15:18:29,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:29,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-17 15:18:29,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,600 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 44 flow. Second operand 3 states and 379 transitions. [2023-11-17 15:18:29,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 114 flow [2023-11-17 15:18:29,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:18:29,602 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 52 flow [2023-11-17 15:18:29,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2023-11-17 15:18:29,603 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2023-11-17 15:18:29,604 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 52 flow [2023-11-17 15:18:29,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:29,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:29,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:18:29,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:29,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:29,613 INFO L85 PathProgramCache]: Analyzing trace with hash 421672612, now seen corresponding path program 1 times [2023-11-17 15:18:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:29,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098587388] [2023-11-17 15:18:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:29,906 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:18:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:29,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098587388] [2023-11-17 15:18:29,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098587388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:29,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:29,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:18:29,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527418954] [2023-11-17 15:18:29,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:29,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:18:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:29,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:18:29,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:18:29,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 229 [2023-11-17 15:18:29,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:29,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:29,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 229 [2023-11-17 15:18:29,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:30,034 INFO L124 PetriNetUnfolderBase]: 631/960 cut-off events. [2023-11-17 15:18:30,035 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-11-17 15:18:30,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 960 events. 631/960 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3966 event pairs, 112 based on Foata normal form. 16/976 useless extension candidates. Maximal degree in co-relation 2107. Up to 810 conditions per place. [2023-11-17 15:18:30,039 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-11-17 15:18:30,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 149 flow [2023-11-17 15:18:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-11-17 15:18:30,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5589519650655022 [2023-11-17 15:18:30,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-11-17 15:18:30,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-11-17 15:18:30,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:30,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-11-17 15:18:30,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,044 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 52 flow. Second operand 3 states and 384 transitions. [2023-11-17 15:18:30,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 149 flow [2023-11-17 15:18:30,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:30,046 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 56 flow [2023-11-17 15:18:30,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-11-17 15:18:30,047 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-11-17 15:18:30,047 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 56 flow [2023-11-17 15:18:30,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:30,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:30,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:18:30,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:30,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash 186227313, now seen corresponding path program 1 times [2023-11-17 15:18:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:30,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562336459] [2023-11-17 15:18:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:30,233 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:18:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:30,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562336459] [2023-11-17 15:18:30,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562336459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:30,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:30,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:30,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437959970] [2023-11-17 15:18:30,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:30,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:30,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:30,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:30,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:30,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 229 [2023-11-17 15:18:30,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:30,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 229 [2023-11-17 15:18:30,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:30,414 INFO L124 PetriNetUnfolderBase]: 733/1134 cut-off events. [2023-11-17 15:18:30,415 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2023-11-17 15:18:30,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 1134 events. 733/1134 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4700 event pairs, 251 based on Foata normal form. 48/1182 useless extension candidates. Maximal degree in co-relation 2595. Up to 406 conditions per place. [2023-11-17 15:18:30,418 INFO L140 encePairwiseOnDemand]: 225/229 looper letters, 29 selfloop transitions, 3 changer transitions 7/39 dead transitions. [2023-11-17 15:18:30,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 183 flow [2023-11-17 15:18:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:18:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:18:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-11-17 15:18:30,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5469432314410481 [2023-11-17 15:18:30,420 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-11-17 15:18:30,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-11-17 15:18:30,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:30,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-11-17 15:18:30,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,423 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,423 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 56 flow. Second operand 4 states and 501 transitions. [2023-11-17 15:18:30,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 183 flow [2023-11-17 15:18:30,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 175 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:30,426 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 66 flow [2023-11-17 15:18:30,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-11-17 15:18:30,427 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-11-17 15:18:30,427 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 66 flow [2023-11-17 15:18:30,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:30,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:30,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:30,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:18:30,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:30,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1806896496, now seen corresponding path program 1 times [2023-11-17 15:18:30,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:30,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387851039] [2023-11-17 15:18:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:30,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:31,338 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:18:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387851039] [2023-11-17 15:18:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387851039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:31,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221140389] [2023-11-17 15:18:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:31,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:18:31,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:31,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:18:31,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:18:31,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 229 [2023-11-17 15:18:31,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:31,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 229 [2023-11-17 15:18:31,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:31,479 INFO L124 PetriNetUnfolderBase]: 328/531 cut-off events. [2023-11-17 15:18:31,479 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2023-11-17 15:18:31,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 531 events. 328/531 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1894 event pairs, 31 based on Foata normal form. 6/537 useless extension candidates. Maximal degree in co-relation 1335. Up to 262 conditions per place. [2023-11-17 15:18:31,482 INFO L140 encePairwiseOnDemand]: 225/229 looper letters, 32 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-11-17 15:18:31,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 185 flow [2023-11-17 15:18:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:18:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:18:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-11-17 15:18:31,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45524017467248906 [2023-11-17 15:18:31,484 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-11-17 15:18:31,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-11-17 15:18:31,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:31,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-11-17 15:18:31,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,486 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,487 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 66 flow. Second operand 4 states and 417 transitions. [2023-11-17 15:18:31,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 185 flow [2023-11-17 15:18:31,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 168 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 15:18:31,489 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 76 flow [2023-11-17 15:18:31,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2023-11-17 15:18:31,491 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-11-17 15:18:31,491 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 76 flow [2023-11-17 15:18:31,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:31,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:31,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:18:31,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:31,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2015727594, now seen corresponding path program 1 times [2023-11-17 15:18:31,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:31,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907052385] [2023-11-17 15:18:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:31,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:31,606 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:18:31,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:31,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907052385] [2023-11-17 15:18:31,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907052385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:31,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:31,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:31,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297075641] [2023-11-17 15:18:31,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:31,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:18:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:31,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:18:31,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:18:31,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 229 [2023-11-17 15:18:31,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:31,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 229 [2023-11-17 15:18:31,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:31,689 INFO L124 PetriNetUnfolderBase]: 220/383 cut-off events. [2023-11-17 15:18:31,689 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2023-11-17 15:18:31,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 383 events. 220/383 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1292 event pairs, 64 based on Foata normal form. 18/401 useless extension candidates. Maximal degree in co-relation 1007. Up to 303 conditions per place. [2023-11-17 15:18:31,691 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 33 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-11-17 15:18:31,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 203 flow [2023-11-17 15:18:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-17 15:18:31,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5473071324599709 [2023-11-17 15:18:31,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-11-17 15:18:31,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-11-17 15:18:31,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:31,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-11-17 15:18:31,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,695 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 76 flow. Second operand 3 states and 376 transitions. [2023-11-17 15:18:31,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 203 flow [2023-11-17 15:18:31,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:31,696 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 99 flow [2023-11-17 15:18:31,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-11-17 15:18:31,697 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2023-11-17 15:18:31,697 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 99 flow [2023-11-17 15:18:31,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:31,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:31,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:18:31,697 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:31,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1553919354, now seen corresponding path program 1 times [2023-11-17 15:18:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:31,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966552114] [2023-11-17 15:18:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:31,828 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:18:31,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966552114] [2023-11-17 15:18:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966552114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368588909] [2023-11-17 15:18:31,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:31,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:31,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 229 [2023-11-17 15:18:31,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:31,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 229 [2023-11-17 15:18:31,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:31,891 INFO L124 PetriNetUnfolderBase]: 124/237 cut-off events. [2023-11-17 15:18:31,891 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-17 15:18:31,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 237 events. 124/237 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 708 event pairs, 39 based on Foata normal form. 21/258 useless extension candidates. Maximal degree in co-relation 743. Up to 81 conditions per place. [2023-11-17 15:18:31,893 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-11-17 15:18:31,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 273 flow [2023-11-17 15:18:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:18:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:18:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-11-17 15:18:31,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458515283842795 [2023-11-17 15:18:31,894 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-11-17 15:18:31,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-11-17 15:18:31,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:31,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-11-17 15:18:31,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,897 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,897 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 99 flow. Second operand 4 states and 500 transitions. [2023-11-17 15:18:31,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 273 flow [2023-11-17 15:18:31,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:31,898 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 135 flow [2023-11-17 15:18:31,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-17 15:18:31,899 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2023-11-17 15:18:31,899 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 135 flow [2023-11-17 15:18:31,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:31,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:31,899 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:18:31,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:18:31,899 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:31,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1332841718, now seen corresponding path program 1 times [2023-11-17 15:18:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:31,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902535980] [2023-11-17 15:18:31,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:31,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:32,026 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:18:32,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:32,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902535980] [2023-11-17 15:18:32,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902535980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:32,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:32,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:18:32,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432124663] [2023-11-17 15:18:32,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:32,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:32,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 229 [2023-11-17 15:18:32,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:32,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:32,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 229 [2023-11-17 15:18:32,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:32,095 INFO L124 PetriNetUnfolderBase]: 103/195 cut-off events. [2023-11-17 15:18:32,096 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2023-11-17 15:18:32,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 195 events. 103/195 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 563 event pairs, 36 based on Foata normal form. 8/203 useless extension candidates. Maximal degree in co-relation 664. Up to 81 conditions per place. [2023-11-17 15:18:32,097 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 37 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-11-17 15:18:32,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 297 flow [2023-11-17 15:18:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-11-17 15:18:32,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362445414847161 [2023-11-17 15:18:32,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-11-17 15:18:32,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-11-17 15:18:32,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:32,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-11-17 15:18:32,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:32,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:32,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:32,102 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 135 flow. Second operand 5 states and 614 transitions. [2023-11-17 15:18:32,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 297 flow [2023-11-17 15:18:32,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 262 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-17 15:18:32,104 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 136 flow [2023-11-17 15:18:32,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-17 15:18:32,104 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2023-11-17 15:18:32,104 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 136 flow [2023-11-17 15:18:32,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:32,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:32,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:32,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:18:32,105 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:32,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1301193243, now seen corresponding path program 1 times [2023-11-17 15:18:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566768939] [2023-11-17 15:18:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:32,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:32,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:18:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:32,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:18:32,208 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:18:32,209 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 15:18:32,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 15:18:32,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 15:18:32,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 15:18:32,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:18:32,211 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:32,214 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:18:32,214 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:18:32,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-17 15:18:32,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-17 15:18:32,255 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated [2023-11-17 15:18:32,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:18:32 BasicIcfg [2023-11-17 15:18:32,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:18:32,275 INFO L158 Benchmark]: Toolchain (without parser) took 10985.03ms. Allocated memory was 229.6MB in the beginning and 398.5MB in the end (delta: 168.8MB). Free memory was 176.9MB in the beginning and 324.0MB in the end (delta: -147.1MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2023-11-17 15:18:32,275 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:18:32,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.03ms. Allocated memory is still 229.6MB. Free memory was 176.4MB in the beginning and 153.9MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-11-17 15:18:32,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.48ms. Allocated memory is still 229.6MB. Free memory was 153.9MB in the beginning and 151.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:32,276 INFO L158 Benchmark]: Boogie Preprocessor took 38.92ms. Allocated memory is still 229.6MB. Free memory was 151.2MB in the beginning and 149.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:32,276 INFO L158 Benchmark]: RCFGBuilder took 803.73ms. Allocated memory is still 229.6MB. Free memory was 149.1MB in the beginning and 99.9MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2023-11-17 15:18:32,276 INFO L158 Benchmark]: TraceAbstraction took 9577.09ms. Allocated memory was 229.6MB in the beginning and 398.5MB in the end (delta: 168.8MB). Free memory was 99.3MB in the beginning and 324.0MB in the end (delta: -224.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:18:32,277 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.13ms. Allocated memory is still 176.2MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.03ms. Allocated memory is still 229.6MB. Free memory was 176.4MB in the beginning and 153.9MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.48ms. Allocated memory is still 229.6MB. Free memory was 153.9MB in the beginning and 151.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.92ms. Allocated memory is still 229.6MB. Free memory was 151.2MB in the beginning and 149.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 803.73ms. Allocated memory is still 229.6MB. Free memory was 149.1MB in the beginning and 99.9MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * TraceAbstraction took 9577.09ms. Allocated memory was 229.6MB in the beginning and 398.5MB in the end (delta: 168.8MB). Free memory was 99.3MB in the beginning and 324.0MB in the end (delta: -224.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 121 PlacesBefore, 29 PlacesAfterwards, 112 TransitionsBefore, 20 TransitionsAfterwards, 1344 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 99 TotalNumberOfCompositions, 3165 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1483, independent: 1330, independent conditional: 0, independent unconditional: 1330, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 947, independent: 894, independent conditional: 0, independent unconditional: 894, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 947, independent: 876, independent conditional: 0, independent unconditional: 876, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1483, independent: 436, independent conditional: 0, independent unconditional: 436, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 947, unknown conditional: 0, unknown unconditional: 947] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t2061; [L837] FCALL, FORK 0 pthread_create(&t2061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2061={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 pthread_t t2062; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] FCALL, FORK 0 pthread_create(&t2062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2061={6:0}, t2062={7:0}, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L781] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L793] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 pthread_t t2063; [L796] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] FCALL, FORK 0 pthread_create(&t2063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2061={6:0}, t2062={7:0}, t2063={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2061={6:0}, t2062={7:0}, t2063={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: 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, 156 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 356 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 0 mSDtfsCounter, 356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=8, InterpolantAutomatonStates: 28, 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.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:18:32,304 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...