/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:29:58,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:29:58,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:29:58,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:29:58,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:29:58,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:29:58,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:29:58,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:29:58,698 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:29:58,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:29:58,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:29:58,702 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:29:58,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:29:58,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:29:58,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:29:58,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:29:58,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:29:58,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:29:58,704 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:29:58,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:29:58,704 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:29:58,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:29:58,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:29:58,705 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:29:58,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:29:58,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:58,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:29:58,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:29:58,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:29:58,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:29:58,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:29:58,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:29:58,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:29:58,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:29:58,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:29:58,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:29:58,924 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:29:58,925 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:29:58,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:29:59,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:30:00,103 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:30:00,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:30:00,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95b15fae/c31ebd30f7684c818f40e9fd4c9516ab/FLAG2574146fb [2023-11-17 11:30:00,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95b15fae/c31ebd30f7684c818f40e9fd4c9516ab [2023-11-17 11:30:00,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:30:00,144 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:30:00,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:30:00,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:30:00,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:30:00,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5528d0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00, skipping insertion in model container [2023-11-17 11:30:00,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,184 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:30:00,291 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 11:30:00,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:30:00,511 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:30:00,519 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 11:30:00,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:30:00,586 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:00,587 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:00,592 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:30:00,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00 WrapperNode [2023-11-17 11:30:00,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:30:00,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:30:00,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:30:00,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:30:00,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,653 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-17 11:30:00,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:30:00,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:30:00,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:30:00,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:30:00,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:30:00,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:30:00,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:30:00,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:30:00,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (1/1) ... [2023-11-17 11:30:00,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:30:00,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:30:00,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:30:00,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:30:00,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:30:00,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:30:00,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:30:00,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:30:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:30:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:30:00,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:30:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:30:00,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:30:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:30:00,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:30:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:30:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:30:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:30:00,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:30:00,759 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:30:00,853 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:30:00,855 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:30:01,155 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:30:01,369 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:30:01,370 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:30:01,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:30:01 BoogieIcfgContainer [2023-11-17 11:30:01,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:30:01,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:30:01,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:30:01,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:30:01,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:30:00" (1/3) ... [2023-11-17 11:30:01,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771ef7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:30:01, skipping insertion in model container [2023-11-17 11:30:01,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:00" (2/3) ... [2023-11-17 11:30:01,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771ef7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:30:01, skipping insertion in model container [2023-11-17 11:30:01,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:30:01" (3/3) ... [2023-11-17 11:30:01,377 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:30:01,389 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:30:01,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:30:01,390 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:30:01,424 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:30:01,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2023-11-17 11:30:01,474 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-11-17 11:30:01,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:30:01,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-17 11:30:01,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2023-11-17 11:30:01,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2023-11-17 11:30:01,485 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:30:01,501 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 85 flow [2023-11-17 11:30:01,504 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 85 flow [2023-11-17 11:30:01,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 85 flow [2023-11-17 11:30:01,522 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-11-17 11:30:01,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:30:01,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-17 11:30:01,524 INFO L119 LiptonReduction]: Number of co-enabled transitions 840 [2023-11-17 11:30:03,224 INFO L134 LiptonReduction]: Checked pairs total: 2681 [2023-11-17 11:30:03,224 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-11-17 11:30:03,239 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:30:03,246 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;@7f1c6448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:30:03,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:30:03,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:30:03,254 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-17 11:30:03,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:30:03,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:03,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:03,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:03,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 68445927, now seen corresponding path program 1 times [2023-11-17 11:30:03,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481419257] [2023-11-17 11:30:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481419257] [2023-11-17 11:30:03,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481419257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:03,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:03,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:30:03,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049584698] [2023-11-17 11:30:03,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:03,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:30:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:03,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:30:03,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:30:03,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2023-11-17 11:30:03,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:03,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:03,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2023-11-17 11:30:03,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:04,139 INFO L124 PetriNetUnfolderBase]: 1107/1764 cut-off events. [2023-11-17 11:30:04,140 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-17 11:30:04,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3471 conditions, 1764 events. 1107/1764 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8175 event pairs, 249 based on Foata normal form. 0/1668 useless extension candidates. Maximal degree in co-relation 3460. Up to 1219 conditions per place. [2023-11-17 11:30:04,152 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 29 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-11-17 11:30:04,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 143 flow [2023-11-17 11:30:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:30:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:30:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-17 11:30:04,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2023-11-17 11:30:04,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-17 11:30:04,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-17 11:30:04,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:04,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-17 11:30:04,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,171 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 90 transitions. [2023-11-17 11:30:04,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 143 flow [2023-11-17 11:30:04,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:30:04,175 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-17 11:30:04,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-17 11:30:04,179 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-17 11:30:04,179 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-17 11:30:04,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:04,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:04,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:30:04,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:04,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:04,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1352051130, now seen corresponding path program 1 times [2023-11-17 11:30:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:04,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013668995] [2023-11-17 11:30:04,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:04,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:04,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013668995] [2023-11-17 11:30:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013668995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122129764] [2023-11-17 11:30:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:04,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:04,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:04,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2023-11-17 11:30:04,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:04,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2023-11-17 11:30:04,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:04,820 INFO L124 PetriNetUnfolderBase]: 1046/1571 cut-off events. [2023-11-17 11:30:04,820 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-17 11:30:04,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 1571 events. 1046/1571 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6407 event pairs, 420 based on Foata normal form. 72/1643 useless extension candidates. Maximal degree in co-relation 3278. Up to 891 conditions per place. [2023-11-17 11:30:04,826 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 32 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2023-11-17 11:30:04,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 174 flow [2023-11-17 11:30:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2023-11-17 11:30:04,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4112903225806452 [2023-11-17 11:30:04,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 102 transitions. [2023-11-17 11:30:04,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 102 transitions. [2023-11-17 11:30:04,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:04,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 102 transitions. [2023-11-17 11:30:04,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,835 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,835 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 102 transitions. [2023-11-17 11:30:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 174 flow [2023-11-17 11:30:04,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:30:04,837 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 108 flow [2023-11-17 11:30:04,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-11-17 11:30:04,838 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-11-17 11:30:04,839 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 108 flow [2023-11-17 11:30:04,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:04,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:04,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:30:04,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:04,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash -736267341, now seen corresponding path program 1 times [2023-11-17 11:30:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:04,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218581861] [2023-11-17 11:30:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:04,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218581861] [2023-11-17 11:30:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218581861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:05,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142339624] [2023-11-17 11:30:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:05,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:05,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:05,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2023-11-17 11:30:05,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:05,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2023-11-17 11:30:05,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:05,438 INFO L124 PetriNetUnfolderBase]: 1100/1648 cut-off events. [2023-11-17 11:30:05,438 INFO L125 PetriNetUnfolderBase]: For 597/597 co-relation queries the response was YES. [2023-11-17 11:30:05,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 1648 events. 1100/1648 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6890 event pairs, 198 based on Foata normal form. 6/1654 useless extension candidates. Maximal degree in co-relation 4506. Up to 1398 conditions per place. [2023-11-17 11:30:05,446 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 35 selfloop transitions, 17 changer transitions 0/52 dead transitions. [2023-11-17 11:30:05,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 294 flow [2023-11-17 11:30:05,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2023-11-17 11:30:05,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2023-11-17 11:30:05,450 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 107 transitions. [2023-11-17 11:30:05,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 107 transitions. [2023-11-17 11:30:05,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:05,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 107 transitions. [2023-11-17 11:30:05,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,453 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,453 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 108 flow. Second operand 4 states and 107 transitions. [2023-11-17 11:30:05,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 294 flow [2023-11-17 11:30:05,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 52 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:30:05,458 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 210 flow [2023-11-17 11:30:05,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2023-11-17 11:30:05,459 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-11-17 11:30:05,459 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 210 flow [2023-11-17 11:30:05,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:05,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:05,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:30:05,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:05,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1376118546, now seen corresponding path program 1 times [2023-11-17 11:30:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:05,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267574885] [2023-11-17 11:30:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:06,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267574885] [2023-11-17 11:30:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267574885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:06,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:06,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:30:06,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553817491] [2023-11-17 11:30:06,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:06,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:30:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:30:06,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:30:06,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:06,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:06,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:06,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:06,505 INFO L124 PetriNetUnfolderBase]: 1007/1546 cut-off events. [2023-11-17 11:30:06,505 INFO L125 PetriNetUnfolderBase]: For 1594/1594 co-relation queries the response was YES. [2023-11-17 11:30:06,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 1546 events. 1007/1546 cut-off events. For 1594/1594 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6497 event pairs, 39 based on Foata normal form. 9/1555 useless extension candidates. Maximal degree in co-relation 5314. Up to 1164 conditions per place. [2023-11-17 11:30:06,515 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 46 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-11-17 11:30:06,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 383 flow [2023-11-17 11:30:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2023-11-17 11:30:06,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2023-11-17 11:30:06,517 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 107 transitions. [2023-11-17 11:30:06,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 107 transitions. [2023-11-17 11:30:06,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:06,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 107 transitions. [2023-11-17 11:30:06,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,519 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,519 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 210 flow. Second operand 4 states and 107 transitions. [2023-11-17 11:30:06,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 383 flow [2023-11-17 11:30:06,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:30:06,524 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 231 flow [2023-11-17 11:30:06,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-11-17 11:30:06,526 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-11-17 11:30:06,526 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 231 flow [2023-11-17 11:30:06,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:06,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:06,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:30:06,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:06,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash 594622339, now seen corresponding path program 1 times [2023-11-17 11:30:06,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:06,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898660201] [2023-11-17 11:30:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898660201] [2023-11-17 11:30:06,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898660201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:06,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027837452] [2023-11-17 11:30:06,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:06,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:30:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:06,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:30:06,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:30:06,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 11:30:06,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:06,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 11:30:06,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:06,797 INFO L124 PetriNetUnfolderBase]: 550/902 cut-off events. [2023-11-17 11:30:06,798 INFO L125 PetriNetUnfolderBase]: For 1070/1097 co-relation queries the response was YES. [2023-11-17 11:30:06,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 902 events. 550/902 cut-off events. For 1070/1097 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3708 event pairs, 125 based on Foata normal form. 83/983 useless extension candidates. Maximal degree in co-relation 3234. Up to 643 conditions per place. [2023-11-17 11:30:06,804 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 55 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-11-17 11:30:06,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 483 flow [2023-11-17 11:30:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:30:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:30:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2023-11-17 11:30:06,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2023-11-17 11:30:06,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 78 transitions. [2023-11-17 11:30:06,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 78 transitions. [2023-11-17 11:30:06,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:06,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 78 transitions. [2023-11-17 11:30:06,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,807 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 231 flow. Second operand 3 states and 78 transitions. [2023-11-17 11:30:06,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 483 flow [2023-11-17 11:30:06,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:30:06,810 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 254 flow [2023-11-17 11:30:06,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-11-17 11:30:06,812 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2023-11-17 11:30:06,812 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 254 flow [2023-11-17 11:30:06,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:06,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:06,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:30:06,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:06,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash -115337889, now seen corresponding path program 1 times [2023-11-17 11:30:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:06,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866262698] [2023-11-17 11:30:06,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:07,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:07,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866262698] [2023-11-17 11:30:07,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866262698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:07,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:07,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:30:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108130998] [2023-11-17 11:30:07,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:07,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:07,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:07,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:07,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:07,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 11:30:07,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:07,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 11:30:07,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:07,136 INFO L124 PetriNetUnfolderBase]: 302/529 cut-off events. [2023-11-17 11:30:07,137 INFO L125 PetriNetUnfolderBase]: For 601/606 co-relation queries the response was YES. [2023-11-17 11:30:07,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 529 events. 302/529 cut-off events. For 601/606 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1997 event pairs, 89 based on Foata normal form. 52/580 useless extension candidates. Maximal degree in co-relation 2044. Up to 232 conditions per place. [2023-11-17 11:30:07,140 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 65 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2023-11-17 11:30:07,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 585 flow [2023-11-17 11:30:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2023-11-17 11:30:07,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2023-11-17 11:30:07,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 105 transitions. [2023-11-17 11:30:07,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 105 transitions. [2023-11-17 11:30:07,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:07,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 105 transitions. [2023-11-17 11:30:07,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,143 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,143 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 254 flow. Second operand 4 states and 105 transitions. [2023-11-17 11:30:07,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 585 flow [2023-11-17 11:30:07,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 574 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:30:07,146 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 277 flow [2023-11-17 11:30:07,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-11-17 11:30:07,148 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-11-17 11:30:07,148 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 277 flow [2023-11-17 11:30:07,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:07,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:07,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:30:07,148 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:07,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:07,149 INFO L85 PathProgramCache]: Analyzing trace with hash 36483, now seen corresponding path program 1 times [2023-11-17 11:30:07,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:07,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056831307] [2023-11-17 11:30:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:07,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:07,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:07,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056831307] [2023-11-17 11:30:07,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056831307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:07,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:07,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:07,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420146562] [2023-11-17 11:30:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:07,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:30:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:07,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:30:07,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:30:07,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 11:30:07,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:07,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 11:30:07,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:07,471 INFO L124 PetriNetUnfolderBase]: 269/462 cut-off events. [2023-11-17 11:30:07,471 INFO L125 PetriNetUnfolderBase]: For 768/770 co-relation queries the response was YES. [2023-11-17 11:30:07,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 462 events. 269/462 cut-off events. For 768/770 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1726 event pairs, 86 based on Foata normal form. 14/475 useless extension candidates. Maximal degree in co-relation 1808. Up to 232 conditions per place. [2023-11-17 11:30:07,474 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 61 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2023-11-17 11:30:07,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 591 flow [2023-11-17 11:30:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:30:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:30:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2023-11-17 11:30:07,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2023-11-17 11:30:07,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 119 transitions. [2023-11-17 11:30:07,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 119 transitions. [2023-11-17 11:30:07,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:07,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 119 transitions. [2023-11-17 11:30:07,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,476 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,476 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 277 flow. Second operand 5 states and 119 transitions. [2023-11-17 11:30:07,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 591 flow [2023-11-17 11:30:07,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 556 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-17 11:30:07,479 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 267 flow [2023-11-17 11:30:07,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-11-17 11:30:07,480 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2023-11-17 11:30:07,480 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 267 flow [2023-11-17 11:30:07,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:07,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:07,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:30:07,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:07,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:07,481 INFO L85 PathProgramCache]: Analyzing trace with hash 831409113, now seen corresponding path program 1 times [2023-11-17 11:30:07,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:07,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236080185] [2023-11-17 11:30:07,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:07,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:07,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236080185] [2023-11-17 11:30:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236080185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:07,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111225045] [2023-11-17 11:30:07,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:07,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:30:07,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:07,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:30:07,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:30:07,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2023-11-17 11:30:07,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:07,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2023-11-17 11:30:07,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:07,747 INFO L124 PetriNetUnfolderBase]: 342/598 cut-off events. [2023-11-17 11:30:07,747 INFO L125 PetriNetUnfolderBase]: For 1082/1082 co-relation queries the response was YES. [2023-11-17 11:30:07,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 598 events. 342/598 cut-off events. For 1082/1082 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2360 event pairs, 151 based on Foata normal form. 1/599 useless extension candidates. Maximal degree in co-relation 2368. Up to 383 conditions per place. [2023-11-17 11:30:07,749 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 41 selfloop transitions, 5 changer transitions 13/59 dead transitions. [2023-11-17 11:30:07,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 497 flow [2023-11-17 11:30:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:30:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:30:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2023-11-17 11:30:07,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44086021505376344 [2023-11-17 11:30:07,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 82 transitions. [2023-11-17 11:30:07,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 82 transitions. [2023-11-17 11:30:07,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:07,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 82 transitions. [2023-11-17 11:30:07,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,751 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 267 flow. Second operand 3 states and 82 transitions. [2023-11-17 11:30:07,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 497 flow [2023-11-17 11:30:07,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 447 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-17 11:30:07,754 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 220 flow [2023-11-17 11:30:07,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-11-17 11:30:07,755 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2023-11-17 11:30:07,755 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 220 flow [2023-11-17 11:30:07,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:07,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:07,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:30:07,755 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:07,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1650659329, now seen corresponding path program 2 times [2023-11-17 11:30:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:07,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75828468] [2023-11-17 11:30:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75828468] [2023-11-17 11:30:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75828468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:30:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23571023] [2023-11-17 11:30:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:08,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:30:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:08,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:30:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:30:08,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:08,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:08,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:08,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:08,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:08,461 INFO L124 PetriNetUnfolderBase]: 195/379 cut-off events. [2023-11-17 11:30:08,461 INFO L125 PetriNetUnfolderBase]: For 618/621 co-relation queries the response was YES. [2023-11-17 11:30:08,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 379 events. 195/379 cut-off events. For 618/621 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1497 event pairs, 13 based on Foata normal form. 4/383 useless extension candidates. Maximal degree in co-relation 1512. Up to 188 conditions per place. [2023-11-17 11:30:08,463 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 42 selfloop transitions, 18 changer transitions 33/95 dead transitions. [2023-11-17 11:30:08,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 727 flow [2023-11-17 11:30:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:30:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:30:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2023-11-17 11:30:08,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2023-11-17 11:30:08,465 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 198 transitions. [2023-11-17 11:30:08,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 198 transitions. [2023-11-17 11:30:08,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:08,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 198 transitions. [2023-11-17 11:30:08,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:08,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 62.0) internal successors, (558), 9 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:08,467 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 62.0) internal successors, (558), 9 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:08,467 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 220 flow. Second operand 8 states and 198 transitions. [2023-11-17 11:30:08,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 727 flow [2023-11-17 11:30:08,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 699 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-17 11:30:08,470 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 372 flow [2023-11-17 11:30:08,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-11-17 11:30:08,470 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-11-17 11:30:08,470 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 372 flow [2023-11-17 11:30:08,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:08,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:08,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:08,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:30:08,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:08,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:08,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1706956039, now seen corresponding path program 3 times [2023-11-17 11:30:08,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431672138] [2023-11-17 11:30:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:08,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:09,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:09,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431672138] [2023-11-17 11:30:09,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431672138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:09,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:09,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:30:09,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371737731] [2023-11-17 11:30:09,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:09,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:30:09,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:09,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:30:09,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:30:09,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:09,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 372 flow. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:09,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:09,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:09,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:09,477 INFO L124 PetriNetUnfolderBase]: 178/350 cut-off events. [2023-11-17 11:30:09,477 INFO L125 PetriNetUnfolderBase]: For 991/997 co-relation queries the response was YES. [2023-11-17 11:30:09,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 350 events. 178/350 cut-off events. For 991/997 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1351 event pairs, 34 based on Foata normal form. 7/357 useless extension candidates. Maximal degree in co-relation 1701. Up to 149 conditions per place. [2023-11-17 11:30:09,480 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 44 selfloop transitions, 8 changer transitions 29/83 dead transitions. [2023-11-17 11:30:09,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 765 flow [2023-11-17 11:30:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:30:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:30:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2023-11-17 11:30:09,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699 [2023-11-17 11:30:09,494 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 146 transitions. [2023-11-17 11:30:09,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 146 transitions. [2023-11-17 11:30:09,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:09,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 146 transitions. [2023-11-17 11:30:09,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:09,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:09,496 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:09,496 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 372 flow. Second operand 6 states and 146 transitions. [2023-11-17 11:30:09,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 765 flow [2023-11-17 11:30:09,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 718 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-11-17 11:30:09,501 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 330 flow [2023-11-17 11:30:09,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-17 11:30:09,502 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-11-17 11:30:09,502 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 330 flow [2023-11-17 11:30:09,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:09,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:09,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:09,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:30:09,502 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:09,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1523876675, now seen corresponding path program 4 times [2023-11-17 11:30:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817576789] [2023-11-17 11:30:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:09,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:09,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817576789] [2023-11-17 11:30:09,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817576789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:09,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:09,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:09,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797672850] [2023-11-17 11:30:09,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:09,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:30:09,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:09,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:30:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:30:09,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:09,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:09,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:09,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:09,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:10,105 INFO L124 PetriNetUnfolderBase]: 140/273 cut-off events. [2023-11-17 11:30:10,106 INFO L125 PetriNetUnfolderBase]: For 812/815 co-relation queries the response was YES. [2023-11-17 11:30:10,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 273 events. 140/273 cut-off events. For 812/815 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 941 event pairs, 39 based on Foata normal form. 4/277 useless extension candidates. Maximal degree in co-relation 1296. Up to 190 conditions per place. [2023-11-17 11:30:10,108 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 36 selfloop transitions, 11 changer transitions 21/70 dead transitions. [2023-11-17 11:30:10,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 617 flow [2023-11-17 11:30:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:30:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:30:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2023-11-17 11:30:10,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699 [2023-11-17 11:30:10,110 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 146 transitions. [2023-11-17 11:30:10,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 146 transitions. [2023-11-17 11:30:10,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:10,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 146 transitions. [2023-11-17 11:30:10,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:10,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:10,111 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:10,111 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 330 flow. Second operand 6 states and 146 transitions. [2023-11-17 11:30:10,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 617 flow [2023-11-17 11:30:10,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 587 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-17 11:30:10,114 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 323 flow [2023-11-17 11:30:10,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-11-17 11:30:10,115 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2023-11-17 11:30:10,115 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 323 flow [2023-11-17 11:30:10,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:10,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:10,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:10,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:30:10,115 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:10,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1320014213, now seen corresponding path program 5 times [2023-11-17 11:30:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:10,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798325115] [2023-11-17 11:30:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:11,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798325115] [2023-11-17 11:30:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798325115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:11,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:11,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-17 11:30:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867423493] [2023-11-17 11:30:11,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:11,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 11:30:11,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 11:30:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-17 11:30:11,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:11,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 323 flow. Second operand has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:11,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:11,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:11,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:11,537 INFO L124 PetriNetUnfolderBase]: 150/295 cut-off events. [2023-11-17 11:30:11,537 INFO L125 PetriNetUnfolderBase]: For 860/863 co-relation queries the response was YES. [2023-11-17 11:30:11,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 295 events. 150/295 cut-off events. For 860/863 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1090 event pairs, 21 based on Foata normal form. 4/299 useless extension candidates. Maximal degree in co-relation 1393. Up to 131 conditions per place. [2023-11-17 11:30:11,539 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 48 selfloop transitions, 13 changer transitions 17/79 dead transitions. [2023-11-17 11:30:11,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 713 flow [2023-11-17 11:30:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 11:30:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 11:30:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2023-11-17 11:30:11,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2023-11-17 11:30:11,541 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 200 transitions. [2023-11-17 11:30:11,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 200 transitions. [2023-11-17 11:30:11,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:11,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 200 transitions. [2023-11-17 11:30:11,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 22.22222222222222) internal successors, (200), 9 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:11,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 62.0) internal successors, (620), 10 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:11,542 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 62.0) internal successors, (620), 10 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:11,542 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 323 flow. Second operand 9 states and 200 transitions. [2023-11-17 11:30:11,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 713 flow [2023-11-17 11:30:11,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 677 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-17 11:30:11,547 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 330 flow [2023-11-17 11:30:11,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=330, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-11-17 11:30:11,548 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2023-11-17 11:30:11,548 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 330 flow [2023-11-17 11:30:11,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:11,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:11,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:11,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:30:11,549 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:11,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash -29791243, now seen corresponding path program 6 times [2023-11-17 11:30:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:11,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889037726] [2023-11-17 11:30:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:11,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889037726] [2023-11-17 11:30:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889037726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 11:30:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321958064] [2023-11-17 11:30:12,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:12,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 11:30:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:12,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 11:30:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-17 11:30:12,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:12,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 330 flow. Second operand has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:12,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:12,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:12,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:12,522 INFO L124 PetriNetUnfolderBase]: 149/306 cut-off events. [2023-11-17 11:30:12,522 INFO L125 PetriNetUnfolderBase]: For 1296/1297 co-relation queries the response was YES. [2023-11-17 11:30:12,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 306 events. 149/306 cut-off events. For 1296/1297 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1188 event pairs, 50 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 1482. Up to 151 conditions per place. [2023-11-17 11:30:12,524 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 39 selfloop transitions, 11 changer transitions 22/73 dead transitions. [2023-11-17 11:30:12,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 687 flow [2023-11-17 11:30:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:30:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:30:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2023-11-17 11:30:12,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778801843317972 [2023-11-17 11:30:12,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 164 transitions. [2023-11-17 11:30:12,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 164 transitions. [2023-11-17 11:30:12,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:12,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 164 transitions. [2023-11-17 11:30:12,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:12,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 62.0) internal successors, (496), 8 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:12,527 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 62.0) internal successors, (496), 8 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:12,527 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 330 flow. Second operand 7 states and 164 transitions. [2023-11-17 11:30:12,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 687 flow [2023-11-17 11:30:12,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 645 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-11-17 11:30:12,531 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 351 flow [2023-11-17 11:30:12,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2023-11-17 11:30:12,531 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2023-11-17 11:30:12,532 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 351 flow [2023-11-17 11:30:12,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:12,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:12,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:12,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:30:12,532 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:12,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1000951081, now seen corresponding path program 7 times [2023-11-17 11:30:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939508236] [2023-11-17 11:30:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:12,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:12,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939508236] [2023-11-17 11:30:12,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939508236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:12,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71924938] [2023-11-17 11:30:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:12,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:30:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:30:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:30:12,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:12,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:12,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:12,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:12,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:13,065 INFO L124 PetriNetUnfolderBase]: 112/230 cut-off events. [2023-11-17 11:30:13,066 INFO L125 PetriNetUnfolderBase]: For 956/957 co-relation queries the response was YES. [2023-11-17 11:30:13,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 230 events. 112/230 cut-off events. For 956/957 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 766 event pairs, 25 based on Foata normal form. 2/232 useless extension candidates. Maximal degree in co-relation 1090. Up to 105 conditions per place. [2023-11-17 11:30:13,068 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 39 selfloop transitions, 9 changer transitions 18/67 dead transitions. [2023-11-17 11:30:13,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 629 flow [2023-11-17 11:30:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:30:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:30:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2023-11-17 11:30:13,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3736559139784946 [2023-11-17 11:30:13,069 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 139 transitions. [2023-11-17 11:30:13,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 139 transitions. [2023-11-17 11:30:13,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:13,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 139 transitions. [2023-11-17 11:30:13,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,071 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,071 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 351 flow. Second operand 6 states and 139 transitions. [2023-11-17 11:30:13,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 629 flow [2023-11-17 11:30:13,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 67 transitions, 596 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-11-17 11:30:13,075 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 345 flow [2023-11-17 11:30:13,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2023-11-17 11:30:13,076 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2023-11-17 11:30:13,076 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 345 flow [2023-11-17 11:30:13,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:13,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:13,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:30:13,077 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:13,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash 26265815, now seen corresponding path program 8 times [2023-11-17 11:30:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416090254] [2023-11-17 11:30:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:13,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416090254] [2023-11-17 11:30:13,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416090254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:13,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:13,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 11:30:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068214443] [2023-11-17 11:30:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:13,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 11:30:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:13,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 11:30:13,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-17 11:30:13,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:13,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 345 flow. Second operand has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:13,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:13,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:13,939 INFO L124 PetriNetUnfolderBase]: 99/221 cut-off events. [2023-11-17 11:30:13,939 INFO L125 PetriNetUnfolderBase]: For 1014/1017 co-relation queries the response was YES. [2023-11-17 11:30:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 221 events. 99/221 cut-off events. For 1014/1017 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 774 event pairs, 32 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 1103. Up to 124 conditions per place. [2023-11-17 11:30:13,940 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 35 selfloop transitions, 5 changer transitions 28/69 dead transitions. [2023-11-17 11:30:13,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 656 flow [2023-11-17 11:30:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 11:30:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 11:30:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2023-11-17 11:30:13,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2023-11-17 11:30:13,942 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 196 transitions. [2023-11-17 11:30:13,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 196 transitions. [2023-11-17 11:30:13,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:13,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 196 transitions. [2023-11-17 11:30:13,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 62.0) internal successors, (620), 10 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,944 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 62.0) internal successors, (620), 10 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,945 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 345 flow. Second operand 9 states and 196 transitions. [2023-11-17 11:30:13,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 656 flow [2023-11-17 11:30:13,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 608 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-17 11:30:13,948 INFO L231 Difference]: Finished difference. Result has 68 places, 40 transitions, 289 flow [2023-11-17 11:30:13,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2023-11-17 11:30:13,949 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places. [2023-11-17 11:30:13,949 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 40 transitions, 289 flow [2023-11-17 11:30:13,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:13,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:13,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:13,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:30:13,950 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:13,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1481131247, now seen corresponding path program 9 times [2023-11-17 11:30:13,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:13,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677768852] [2023-11-17 11:30:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:13,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:14,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:14,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677768852] [2023-11-17 11:30:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677768852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:14,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:14,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 11:30:14,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335228251] [2023-11-17 11:30:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:14,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 11:30:14,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:14,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 11:30:14,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-17 11:30:14,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:30:14,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 40 transitions, 289 flow. Second operand has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:14,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:14,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:30:14,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:14,939 INFO L124 PetriNetUnfolderBase]: 126/284 cut-off events. [2023-11-17 11:30:14,939 INFO L125 PetriNetUnfolderBase]: For 1031/1034 co-relation queries the response was YES. [2023-11-17 11:30:14,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 284 events. 126/284 cut-off events. For 1031/1034 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1194 event pairs, 21 based on Foata normal form. 2/286 useless extension candidates. Maximal degree in co-relation 1358. Up to 95 conditions per place. [2023-11-17 11:30:14,941 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 35 selfloop transitions, 7 changer transitions 48/91 dead transitions. [2023-11-17 11:30:14,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 815 flow [2023-11-17 11:30:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 11:30:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 11:30:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 228 transitions. [2023-11-17 11:30:14,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2023-11-17 11:30:14,942 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 228 transitions. [2023-11-17 11:30:14,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 228 transitions. [2023-11-17 11:30:14,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:14,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 228 transitions. [2023-11-17 11:30:14,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:14,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 62.0) internal successors, (682), 11 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:14,944 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 62.0) internal successors, (682), 11 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:14,944 INFO L175 Difference]: Start difference. First operand has 68 places, 40 transitions, 289 flow. Second operand 10 states and 228 transitions. [2023-11-17 11:30:14,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 815 flow [2023-11-17 11:30:14,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 91 transitions, 759 flow, removed 16 selfloop flow, removed 11 redundant places. [2023-11-17 11:30:14,948 INFO L231 Difference]: Finished difference. Result has 62 places, 30 transitions, 190 flow [2023-11-17 11:30:14,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=190, PETRI_PLACES=62, PETRI_TRANSITIONS=30} [2023-11-17 11:30:14,949 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2023-11-17 11:30:14,949 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 30 transitions, 190 flow [2023-11-17 11:30:14,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:14,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:14,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:14,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:30:14,949 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:14,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash 704454675, now seen corresponding path program 10 times [2023-11-17 11:30:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:14,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336650361] [2023-11-17 11:30:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:30:14,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:30:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:30:15,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:30:15,050 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:30:15,051 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:30:15,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:30:15,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:30:15,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:30:15,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:30:15,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:30:15,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 11:30:15,054 INFO L445 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:15,058 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:30:15,058 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:30:15,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:30:15,101 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:30:15,102 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 11:30:15,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:30:15 BasicIcfg [2023-11-17 11:30:15,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:30:15,122 INFO L158 Benchmark]: Toolchain (without parser) took 14977.19ms. Allocated memory was 278.9MB in the beginning and 669.0MB in the end (delta: 390.1MB). Free memory was 224.3MB in the beginning and 474.3MB in the end (delta: -250.0MB). Peak memory consumption was 140.9MB. Max. memory is 8.0GB. [2023-11-17 11:30:15,122 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:30:15,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.22ms. Allocated memory is still 278.9MB. Free memory was 224.1MB in the beginning and 197.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-11-17 11:30:15,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.17ms. Allocated memory is still 278.9MB. Free memory was 197.9MB in the beginning and 195.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:15,122 INFO L158 Benchmark]: Boogie Preprocessor took 50.65ms. Allocated memory is still 278.9MB. Free memory was 195.2MB in the beginning and 193.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:15,122 INFO L158 Benchmark]: RCFGBuilder took 665.90ms. Allocated memory is still 278.9MB. Free memory was 193.1MB in the beginning and 232.8MB in the end (delta: -39.6MB). Peak memory consumption was 61.0MB. Max. memory is 8.0GB. [2023-11-17 11:30:15,122 INFO L158 Benchmark]: TraceAbstraction took 13748.26ms. Allocated memory was 278.9MB in the beginning and 669.0MB in the end (delta: 390.1MB). Free memory was 232.3MB in the beginning and 474.3MB in the end (delta: -242.0MB). Peak memory consumption was 148.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:15,123 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 198.2MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.22ms. Allocated memory is still 278.9MB. Free memory was 224.1MB in the beginning and 197.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.17ms. Allocated memory is still 278.9MB. Free memory was 197.9MB in the beginning and 195.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.65ms. Allocated memory is still 278.9MB. Free memory was 195.2MB in the beginning and 193.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 665.90ms. Allocated memory is still 278.9MB. Free memory was 193.1MB in the beginning and 232.8MB in the end (delta: -39.6MB). Peak memory consumption was 61.0MB. Max. memory is 8.0GB. * TraceAbstraction took 13748.26ms. Allocated memory was 278.9MB in the beginning and 669.0MB in the end (delta: 390.1MB). Free memory was 232.3MB in the beginning and 474.3MB in the end (delta: -242.0MB). Peak memory consumption was 148.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 47 PlacesBefore, 33 PlacesAfterwards, 38 TransitionsBefore, 24 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 2681 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1126, independent: 996, independent conditional: 0, independent unconditional: 996, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 619, independent: 570, independent conditional: 0, independent unconditional: 570, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 619, independent: 534, independent conditional: 0, independent unconditional: 534, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 85, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 600, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 556, dependent conditional: 0, dependent unconditional: 556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1126, independent: 426, independent conditional: 0, independent unconditional: 426, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 619, unknown conditional: 0, unknown unconditional: 619] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: 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: 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. - UnprovableResult [Line: 852]: 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: 854]: 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, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 412 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1523 IncrementalHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 3 mSDtfsCounter, 1523 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 3564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:30:15,142 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...