/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/mix035.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:14:59,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:14:59,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:14:59,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:14:59,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:14:59,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:14:59,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:14:59,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:14:59,597 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:14:59,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:14:59,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:14:59,601 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:14:59,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:14:59,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:14:59,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:14:59,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:14:59,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:14:59,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:14:59,602 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:14:59,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:14:59,603 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:14:59,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:14:59,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:14:59,604 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:14:59,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:14:59,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:14:59,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:14:59,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:14:59,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:14:59,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:14:59,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:14:59,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:14:59,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:14:59,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:14:59,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:14:59,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:14:59,809 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:14:59,809 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:14:59,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2023-11-17 15:15:00,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:15:00,952 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:15:00,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2023-11-17 15:15:00,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a23d4380/647f7a6ca3fc458e8318bbf43a3fb820/FLAGd249b0643 [2023-11-17 15:15:00,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a23d4380/647f7a6ca3fc458e8318bbf43a3fb820 [2023-11-17 15:15:00,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:15:00,987 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:15:00,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:00,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:15:00,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:15:00,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d3c832f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00, skipping insertion in model container [2023-11-17 15:15:00,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:01,033 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:15:01,133 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/mix035.oepc.i[945,958] [2023-11-17 15:15:01,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:01,316 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:15:01,326 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/mix035.oepc.i[945,958] [2023-11-17 15:15:01,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:01,420 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:01,420 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:01,425 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:15:01,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01 WrapperNode [2023-11-17 15:15:01,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:01,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:01,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:15:01,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:15:01,432 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:15:01" (1/1) ... [2023-11-17 15:15:01,458 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:15:01" (1/1) ... [2023-11-17 15:15:01,486 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-11-17 15:15:01,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:01,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:15:01,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:15:01,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:15:01,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:15:01,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:15:01,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:15:01,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:15:01,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (1/1) ... [2023-11-17 15:15:01,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:01,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:15:01,553 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:15:01,564 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:15:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:15:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:15:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:15:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:15:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:15:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:15:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:15:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:15:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:15:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:15:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:15:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:15:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:15:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:15:01,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:15:01,582 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:15:01,714 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:15:01,716 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:15:01,970 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:15:02,050 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:15:02,050 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:15:02,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:02 BoogieIcfgContainer [2023-11-17 15:15:02,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:15:02,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:15:02,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:15:02,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:15:02,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:15:00" (1/3) ... [2023-11-17 15:15:02,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684b368a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:02, skipping insertion in model container [2023-11-17 15:15:02,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:01" (2/3) ... [2023-11-17 15:15:02,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684b368a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:02, skipping insertion in model container [2023-11-17 15:15:02,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:02" (3/3) ... [2023-11-17 15:15:02,057 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035.oepc.i [2023-11-17 15:15:02,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:15:02,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:15:02,068 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:15:02,106 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:15:02,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 246 flow [2023-11-17 15:15:02,170 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-11-17 15:15:02,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:02,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-11-17 15:15:02,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 117 transitions, 246 flow [2023-11-17 15:15:02,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 114 transitions, 237 flow [2023-11-17 15:15:02,183 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:15:02,196 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 114 transitions, 237 flow [2023-11-17 15:15:02,199 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 114 transitions, 237 flow [2023-11-17 15:15:02,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 114 transitions, 237 flow [2023-11-17 15:15:02,240 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-11-17 15:15:02,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:02,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-11-17 15:15:02,243 INFO L119 LiptonReduction]: Number of co-enabled transitions 2414 [2023-11-17 15:15:05,362 INFO L134 LiptonReduction]: Checked pairs total: 5828 [2023-11-17 15:15:05,363 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-11-17 15:15:05,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:15:05,379 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;@2d449d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:15:05,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:15:05,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:15:05,380 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-17 15:15:05,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:05,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:05,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:15:05,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:05,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash 504070, now seen corresponding path program 1 times [2023-11-17 15:15:05,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:05,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417119470] [2023-11-17 15:15:05,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417119470] [2023-11-17 15:15:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417119470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:05,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:05,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665560116] [2023-11-17 15:15:05,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:05,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:05,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:05,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 221 [2023-11-17 15:15:05,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:05,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:05,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 221 [2023-11-17 15:15:05,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:05,957 INFO L124 PetriNetUnfolderBase]: 1079/1735 cut-off events. [2023-11-17 15:15:05,958 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-17 15:15:05,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 1735 events. 1079/1735 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9286 event pairs, 173 based on Foata normal form. 0/1651 useless extension candidates. Maximal degree in co-relation 3371. Up to 1297 conditions per place. [2023-11-17 15:15:05,970 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-17 15:15:05,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2023-11-17 15:15:05,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-11-17 15:15:05,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233785822021116 [2023-11-17 15:15:05,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-11-17 15:15:05,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-11-17 15:15:05,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:05,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-11-17 15:15:05,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:05,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:05,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:05,990 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 63 flow. Second operand 3 states and 347 transitions. [2023-11-17 15:15:05,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2023-11-17 15:15:05,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:05,993 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-11-17 15:15:05,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 15:15:05,997 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-17 15:15:05,997 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-11-17 15:15:05,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:05,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:05,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:15:05,998 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:05,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash 4870186, now seen corresponding path program 1 times [2023-11-17 15:15:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243470508] [2023-11-17 15:15:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:06,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:06,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243470508] [2023-11-17 15:15:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243470508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:06,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:06,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:15:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772365341] [2023-11-17 15:15:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:06,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:06,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:06,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:06,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 221 [2023-11-17 15:15:06,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:06,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 221 [2023-11-17 15:15:06,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:06,424 INFO L124 PetriNetUnfolderBase]: 1079/1640 cut-off events. [2023-11-17 15:15:06,425 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-17 15:15:06,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 1640 events. 1079/1640 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7489 event pairs, 311 based on Foata normal form. 96/1732 useless extension candidates. Maximal degree in co-relation 3446. Up to 1025 conditions per place. [2023-11-17 15:15:06,431 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 27 selfloop transitions, 2 changer transitions 18/49 dead transitions. [2023-11-17 15:15:06,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 49 transitions, 208 flow [2023-11-17 15:15:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-11-17 15:15:06,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4832579185520362 [2023-11-17 15:15:06,433 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-11-17 15:15:06,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-11-17 15:15:06,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:06,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-11-17 15:15:06,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,438 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 5 states and 534 transitions. [2023-11-17 15:15:06,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 49 transitions, 208 flow [2023-11-17 15:15:06,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:06,439 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 64 flow [2023-11-17 15:15:06,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-11-17 15:15:06,440 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-11-17 15:15:06,440 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 64 flow [2023-11-17 15:15:06,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:06,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:06,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:15:06,441 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:06,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash -391339843, now seen corresponding path program 1 times [2023-11-17 15:15:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:06,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031662691] [2023-11-17 15:15:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:06,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:06,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031662691] [2023-11-17 15:15:06,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031662691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:06,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:06,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34327916] [2023-11-17 15:15:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:06,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:06,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:06,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-11-17 15:15:06,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:06,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-11-17 15:15:06,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:06,720 INFO L124 PetriNetUnfolderBase]: 577/957 cut-off events. [2023-11-17 15:15:06,721 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-17 15:15:06,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 957 events. 577/957 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4416 event pairs, 116 based on Foata normal form. 80/1033 useless extension candidates. Maximal degree in co-relation 2062. Up to 592 conditions per place. [2023-11-17 15:15:06,725 INFO L140 encePairwiseOnDemand]: 215/221 looper letters, 30 selfloop transitions, 4 changer transitions 21/58 dead transitions. [2023-11-17 15:15:06,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 248 flow [2023-11-17 15:15:06,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-11-17 15:15:06,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481447963800905 [2023-11-17 15:15:06,727 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-11-17 15:15:06,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-11-17 15:15:06,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:06,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-11-17 15:15:06,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,730 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 64 flow. Second operand 5 states and 532 transitions. [2023-11-17 15:15:06,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 248 flow [2023-11-17 15:15:06,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 240 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:06,735 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 92 flow [2023-11-17 15:15:06,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-17 15:15:06,736 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-11-17 15:15:06,736 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 92 flow [2023-11-17 15:15:06,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:06,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:06,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:15:06,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:06,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash 901755842, now seen corresponding path program 1 times [2023-11-17 15:15:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:06,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654982937] [2023-11-17 15:15:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:06,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654982937] [2023-11-17 15:15:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654982937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:06,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:06,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:06,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693936610] [2023-11-17 15:15:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:06,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:06,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:06,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:06,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:06,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-11-17 15:15:06,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:06,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:06,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-11-17 15:15:06,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:07,086 INFO L124 PetriNetUnfolderBase]: 262/486 cut-off events. [2023-11-17 15:15:07,087 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2023-11-17 15:15:07,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 486 events. 262/486 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2077 event pairs, 72 based on Foata normal form. 44/526 useless extension candidates. Maximal degree in co-relation 1294. Up to 154 conditions per place. [2023-11-17 15:15:07,089 INFO L140 encePairwiseOnDemand]: 215/221 looper letters, 39 selfloop transitions, 7 changer transitions 21/70 dead transitions. [2023-11-17 15:15:07,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 358 flow [2023-11-17 15:15:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2023-11-17 15:15:07,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819004524886878 [2023-11-17 15:15:07,093 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 639 transitions. [2023-11-17 15:15:07,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 639 transitions. [2023-11-17 15:15:07,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:07,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 639 transitions. [2023-11-17 15:15:07,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,098 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 92 flow. Second operand 6 states and 639 transitions. [2023-11-17 15:15:07,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 358 flow [2023-11-17 15:15:07,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 70 transitions, 352 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:07,100 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 142 flow [2023-11-17 15:15:07,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-17 15:15:07,101 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2023-11-17 15:15:07,101 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 142 flow [2023-11-17 15:15:07,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:07,101 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:15:07,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:15:07,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:07,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2081990404, now seen corresponding path program 1 times [2023-11-17 15:15:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273242448] [2023-11-17 15:15:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:07,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:07,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:07,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273242448] [2023-11-17 15:15:07,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273242448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:07,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:07,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70224430] [2023-11-17 15:15:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:07,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:07,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 221 [2023-11-17 15:15:07,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:07,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 221 [2023-11-17 15:15:07,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:07,626 INFO L124 PetriNetUnfolderBase]: 332/667 cut-off events. [2023-11-17 15:15:07,627 INFO L125 PetriNetUnfolderBase]: For 858/858 co-relation queries the response was YES. [2023-11-17 15:15:07,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 667 events. 332/667 cut-off events. For 858/858 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3284 event pairs, 77 based on Foata normal form. 7/673 useless extension candidates. Maximal degree in co-relation 2071. Up to 302 conditions per place. [2023-11-17 15:15:07,630 INFO L140 encePairwiseOnDemand]: 213/221 looper letters, 56 selfloop transitions, 9 changer transitions 31/99 dead transitions. [2023-11-17 15:15:07,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 99 transitions, 720 flow [2023-11-17 15:15:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2023-11-17 15:15:07,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738202973497091 [2023-11-17 15:15:07,633 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2023-11-17 15:15:07,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2023-11-17 15:15:07,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:07,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2023-11-17 15:15:07,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,636 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,636 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 142 flow. Second operand 7 states and 733 transitions. [2023-11-17 15:15:07,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 99 transitions, 720 flow [2023-11-17 15:15:07,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 99 transitions, 596 flow, removed 48 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:07,641 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 176 flow [2023-11-17 15:15:07,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-11-17 15:15:07,642 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2023-11-17 15:15:07,642 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 176 flow [2023-11-17 15:15:07,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:07,643 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:15:07,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:15:07,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:07,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1512248074, now seen corresponding path program 2 times [2023-11-17 15:15:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978039483] [2023-11-17 15:15:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978039483] [2023-11-17 15:15:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978039483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:07,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78714691] [2023-11-17 15:15:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:07,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:07,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:07,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:07,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-11-17 15:15:07,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 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:15:07,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:07,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-11-17 15:15:07,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:07,928 INFO L124 PetriNetUnfolderBase]: 235/468 cut-off events. [2023-11-17 15:15:07,929 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2023-11-17 15:15:07,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 468 events. 235/468 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2168 event pairs, 58 based on Foata normal form. 21/485 useless extension candidates. Maximal degree in co-relation 1503. Up to 173 conditions per place. [2023-11-17 15:15:07,931 INFO L140 encePairwiseOnDemand]: 215/221 looper letters, 52 selfloop transitions, 10 changer transitions 14/79 dead transitions. [2023-11-17 15:15:07,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 79 transitions, 513 flow [2023-11-17 15:15:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2023-11-17 15:15:07,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680025856496445 [2023-11-17 15:15:07,933 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2023-11-17 15:15:07,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2023-11-17 15:15:07,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:07,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2023-11-17 15:15:07,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,937 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:07,937 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 176 flow. Second operand 7 states and 724 transitions. [2023-11-17 15:15:07,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 79 transitions, 513 flow [2023-11-17 15:15:07,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 493 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:07,939 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 191 flow [2023-11-17 15:15:07,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-17 15:15:07,940 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-11-17 15:15:07,940 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 191 flow [2023-11-17 15:15:07,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 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:15:07,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:07,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:07,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:15:07,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:07,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1453411986, now seen corresponding path program 1 times [2023-11-17 15:15:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848567438] [2023-11-17 15:15:07,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848567438] [2023-11-17 15:15:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848567438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010183800] [2023-11-17 15:15:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:08,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:08,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-11-17 15:15:08,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:08,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:08,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-11-17 15:15:08,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:08,311 INFO L124 PetriNetUnfolderBase]: 565/1004 cut-off events. [2023-11-17 15:15:08,311 INFO L125 PetriNetUnfolderBase]: For 1407/1407 co-relation queries the response was YES. [2023-11-17 15:15:08,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3379 conditions, 1004 events. 565/1004 cut-off events. For 1407/1407 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4796 event pairs, 48 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 3359. Up to 534 conditions per place. [2023-11-17 15:15:08,316 INFO L140 encePairwiseOnDemand]: 213/221 looper letters, 73 selfloop transitions, 10 changer transitions 8/91 dead transitions. [2023-11-17 15:15:08,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 91 transitions, 640 flow [2023-11-17 15:15:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-11-17 15:15:08,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45324283559577677 [2023-11-17 15:15:08,318 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-11-17 15:15:08,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-11-17 15:15:08,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:08,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-11-17 15:15:08,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:08,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:08,321 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:08,321 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 191 flow. Second operand 6 states and 601 transitions. [2023-11-17 15:15:08,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 91 transitions, 640 flow [2023-11-17 15:15:08,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 91 transitions, 566 flow, removed 21 selfloop flow, removed 6 redundant places. [2023-11-17 15:15:08,329 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 225 flow [2023-11-17 15:15:08,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-11-17 15:15:08,329 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2023-11-17 15:15:08,330 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 225 flow [2023-11-17 15:15:08,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:08,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:08,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:08,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:15:08,334 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:08,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash -641413804, now seen corresponding path program 2 times [2023-11-17 15:15:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492680992] [2023-11-17 15:15:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492680992] [2023-11-17 15:15:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492680992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:08,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583631840] [2023-11-17 15:15:08,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:08,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:15:08,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:15:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:15:08,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 221 [2023-11-17 15:15:08,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 225 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:08,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:08,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 221 [2023-11-17 15:15:08,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:09,150 INFO L124 PetriNetUnfolderBase]: 639/1247 cut-off events. [2023-11-17 15:15:09,150 INFO L125 PetriNetUnfolderBase]: For 1825/1855 co-relation queries the response was YES. [2023-11-17 15:15:09,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4476 conditions, 1247 events. 639/1247 cut-off events. For 1825/1855 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7205 event pairs, 63 based on Foata normal form. 22/1263 useless extension candidates. Maximal degree in co-relation 4460. Up to 389 conditions per place. [2023-11-17 15:15:09,155 INFO L140 encePairwiseOnDemand]: 211/221 looper letters, 54 selfloop transitions, 16 changer transitions 66/141 dead transitions. [2023-11-17 15:15:09,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 141 transitions, 1022 flow [2023-11-17 15:15:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 15:15:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 15:15:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1277 transitions. [2023-11-17 15:15:09,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444831186912635 [2023-11-17 15:15:09,158 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1277 transitions. [2023-11-17 15:15:09,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1277 transitions. [2023-11-17 15:15:09,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:09,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1277 transitions. [2023-11-17 15:15:09,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.23076923076923) internal successors, (1277), 13 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,169 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,169 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 225 flow. Second operand 13 states and 1277 transitions. [2023-11-17 15:15:09,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 141 transitions, 1022 flow [2023-11-17 15:15:09,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 1020 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:09,175 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 328 flow [2023-11-17 15:15:09,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=328, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2023-11-17 15:15:09,177 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-11-17 15:15:09,177 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 328 flow [2023-11-17 15:15:09,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:09,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:09,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:15:09,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:09,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1773100516, now seen corresponding path program 3 times [2023-11-17 15:15:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:09,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859073917] [2023-11-17 15:15:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:09,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:09,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859073917] [2023-11-17 15:15:09,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859073917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:09,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:09,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:09,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473064025] [2023-11-17 15:15:09,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:09,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:15:09,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:09,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:15:09,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:15:09,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-11-17 15:15:09,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 92.5) internal successors, (740), 8 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:09,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-11-17 15:15:09,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:09,966 INFO L124 PetriNetUnfolderBase]: 345/744 cut-off events. [2023-11-17 15:15:09,966 INFO L125 PetriNetUnfolderBase]: For 1745/1767 co-relation queries the response was YES. [2023-11-17 15:15:09,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 744 events. 345/744 cut-off events. For 1745/1767 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4143 event pairs, 47 based on Foata normal form. 18/754 useless extension candidates. Maximal degree in co-relation 2885. Up to 395 conditions per place. [2023-11-17 15:15:09,970 INFO L140 encePairwiseOnDemand]: 214/221 looper letters, 48 selfloop transitions, 7 changer transitions 26/88 dead transitions. [2023-11-17 15:15:09,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 690 flow [2023-11-17 15:15:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:15:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:15:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 770 transitions. [2023-11-17 15:15:09,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43552036199095023 [2023-11-17 15:15:09,972 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 770 transitions. [2023-11-17 15:15:09,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 770 transitions. [2023-11-17 15:15:09,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:09,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 770 transitions. [2023-11-17 15:15:09,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,976 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,976 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 328 flow. Second operand 8 states and 770 transitions. [2023-11-17 15:15:09,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 690 flow [2023-11-17 15:15:09,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 672 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:09,984 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 324 flow [2023-11-17 15:15:09,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=324, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2023-11-17 15:15:09,985 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2023-11-17 15:15:09,985 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 324 flow [2023-11-17 15:15:09,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.5) internal successors, (740), 8 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:09,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:09,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:09,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:15:09,986 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:09,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2056261554, now seen corresponding path program 4 times [2023-11-17 15:15:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733423840] [2023-11-17 15:15:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:10,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:15:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:10,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:15:10,100 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:15:10,101 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:15:10,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:15:10,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:15:10,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:15:10,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:15:10,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:15:10,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:15:10,103 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-11-17 15:15:10,106 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:15:10,106 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:10,146 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:15:10,148 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:15:10,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:15:10,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:10 BasicIcfg [2023-11-17 15:15:10,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:10,166 INFO L158 Benchmark]: Toolchain (without parser) took 9178.82ms. Allocated memory was 251.7MB in the beginning and 401.6MB in the end (delta: 149.9MB). Free memory was 213.7MB in the beginning and 208.5MB in the end (delta: 5.2MB). Peak memory consumption was 156.2MB. Max. memory is 8.0GB. [2023-11-17 15:15:10,166 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:10,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.65ms. Allocated memory is still 251.7MB. Free memory was 213.2MB in the beginning and 190.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:10,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.31ms. Allocated memory is still 251.7MB. Free memory was 189.6MB in the beginning and 187.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:10,166 INFO L158 Benchmark]: Boogie Preprocessor took 30.95ms. Allocated memory is still 251.7MB. Free memory was 187.5MB in the beginning and 185.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:10,167 INFO L158 Benchmark]: RCFGBuilder took 532.35ms. Allocated memory is still 251.7MB. Free memory was 185.4MB in the beginning and 149.2MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-11-17 15:15:10,167 INFO L158 Benchmark]: TraceAbstraction took 8112.64ms. Allocated memory was 251.7MB in the beginning and 401.6MB in the end (delta: 149.9MB). Free memory was 148.7MB in the beginning and 208.5MB in the end (delta: -59.8MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. [2023-11-17 15:15:10,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.65ms. Allocated memory is still 251.7MB. Free memory was 213.2MB in the beginning and 190.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.31ms. Allocated memory is still 251.7MB. Free memory was 189.6MB in the beginning and 187.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.95ms. Allocated memory is still 251.7MB. Free memory was 187.5MB in the beginning and 185.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 532.35ms. Allocated memory is still 251.7MB. Free memory was 185.4MB in the beginning and 149.2MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8112.64ms. Allocated memory was 251.7MB in the beginning and 401.6MB in the end (delta: 149.9MB). Free memory was 148.7MB in the beginning and 208.5MB in the end (delta: -59.8MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 121 PlacesBefore, 35 PlacesAfterwards, 114 TransitionsBefore, 27 TransitionsAfterwards, 2414 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 5828 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2911, independent: 2755, independent conditional: 0, independent unconditional: 2755, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1794, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1794, independent: 1710, independent conditional: 0, independent unconditional: 1710, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2911, independent: 1011, independent conditional: 0, independent unconditional: 1011, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 1794, unknown conditional: 0, unknown unconditional: 1794] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t913; [L846] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t914; [L848] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, t914={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] 0 pthread_t t915; [L850] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L798] 3 y = 1 [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 a$flush_delayed = weak$$choice2 [L810] 3 a$mem_tmp = a [L811] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L812] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L813] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L814] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L815] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L817] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = a [L819] 3 a = a$flush_delayed ? a$mem_tmp : a [L820] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L823] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L824] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L825] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L826] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L827] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L857] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L858] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L859] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L860] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 850]: 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, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 294 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1310 IncrementalHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 8 mSDtfsCounter, 1310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=8, InterpolantAutomatonStates: 60, 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, 2.0s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:15:10,183 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...