/usr/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:47:59,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:47:59,128 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-NoLbe.epf [2023-11-10 11:47:59,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:47:59,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:47:59,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:47:59,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:47:59,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:47:59,146 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:47:59,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:47:59,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:47:59,147 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:47:59,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:47:59,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:47:59,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:47:59,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:47:59,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:47:59,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:47:59,148 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:47:59,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:47:59,149 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:47:59,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:47:59,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:47:59,157 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:47:59,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:47:59,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:47:59,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:47:59,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:47:59,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:47:59,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:47:59,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:47:59,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:47:59,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:47:59,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-10 11:47:59,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:47:59,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:47:59,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:47:59,369 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:47:59,369 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:47:59,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-10 11:48:00,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:48:00,690 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:48:00,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-10 11:48:00,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63a85c07/5fe9e521a2d6488898735b9a1dc08ce4/FLAG54b9711bc [2023-11-10 11:48:00,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63a85c07/5fe9e521a2d6488898735b9a1dc08ce4 [2023-11-10 11:48:00,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:48:00,719 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:48:00,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:48:00,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:48:00,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:48:00,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:48:00" (1/1) ... [2023-11-10 11:48:00,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778dd3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:00, skipping insertion in model container [2023-11-10 11:48:00,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:48:00" (1/1) ... [2023-11-10 11:48:00,766 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:48:00,867 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-10 11:48:00,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:48:00,986 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:48:00,994 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-10 11:48:01,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:48:01,059 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:48:01,059 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:48:01,064 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:48:01,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01 WrapperNode [2023-11-10 11:48:01,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:48:01,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:48:01,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:48:01,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:48:01,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,126 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-10 11:48:01,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:48:01,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:48:01,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:48:01,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:48:01,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:48:01,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:48:01,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:48:01,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:48:01,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (1/1) ... [2023-11-10 11:48:01,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:48:01,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:48:01,205 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-10 11:48:01,224 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-10 11:48:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:48:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:48:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:48:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:48:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:48:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:48:01,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:48:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:48:01,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:48:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:48:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:48:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:48:01,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:48:01,241 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:48:01,333 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:48:01,334 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:48:01,506 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:48:01,615 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:48:01,615 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:48:01,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:01 BoogieIcfgContainer [2023-11-10 11:48:01,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:48:01,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:48:01,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:48:01,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:48:01,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:48:00" (1/3) ... [2023-11-10 11:48:01,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6b3313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:48:01, skipping insertion in model container [2023-11-10 11:48:01,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:01" (2/3) ... [2023-11-10 11:48:01,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6b3313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:48:01, skipping insertion in model container [2023-11-10 11:48:01,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:01" (3/3) ... [2023-11-10 11:48:01,623 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2023-11-10 11:48:01,635 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:48:01,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:48:01,635 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:48:01,678 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:48:01,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 90 transitions, 188 flow [2023-11-10 11:48:01,751 INFO L124 PetriNetUnfolderBase]: 3/88 cut-off events. [2023-11-10 11:48:01,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:48:01,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 3/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-11-10 11:48:01,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 90 transitions, 188 flow [2023-11-10 11:48:01,763 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 88 transitions, 182 flow [2023-11-10 11:48:01,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:48:01,783 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;@18877ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:48:01,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:48:01,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:48:01,805 INFO L124 PetriNetUnfolderBase]: 1/52 cut-off events. [2023-11-10 11:48:01,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:48:01,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:01,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:01,806 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:01,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash 199304082, now seen corresponding path program 1 times [2023-11-10 11:48:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:01,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067328925] [2023-11-10 11:48:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:01,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:02,247 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-10 11:48:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:02,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067328925] [2023-11-10 11:48:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067328925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:02,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:48:02,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201124991] [2023-11-10 11:48:02,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:02,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:48:02,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:48:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:48:02,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2023-11-10 11:48:02,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:02,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2023-11-10 11:48:02,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:02,379 INFO L124 PetriNetUnfolderBase]: 17/155 cut-off events. [2023-11-10 11:48:02,379 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-10 11:48:02,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 155 events. 17/155 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 393 event pairs, 3 based on Foata normal form. 7/154 useless extension candidates. Maximal degree in co-relation 161. Up to 27 conditions per place. [2023-11-10 11:48:02,382 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 9 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-11-10 11:48:02,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 200 flow [2023-11-10 11:48:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:48:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:48:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2023-11-10 11:48:02,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2023-11-10 11:48:02,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2023-11-10 11:48:02,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2023-11-10 11:48:02,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:02,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2023-11-10 11:48:02,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 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-10 11:48:02,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,410 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 182 flow. Second operand 3 states and 248 transitions. [2023-11-10 11:48:02,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 200 flow [2023-11-10 11:48:02,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 86 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:48:02,416 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 174 flow [2023-11-10 11:48:02,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2023-11-10 11:48:02,420 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, -2 predicate places. [2023-11-10 11:48:02,421 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 174 flow [2023-11-10 11:48:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:02,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:02,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:48:02,421 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:02,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1471087714, now seen corresponding path program 1 times [2023-11-10 11:48:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:02,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885289078] [2023-11-10 11:48:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:03,201 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-10 11:48:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885289078] [2023-11-10 11:48:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885289078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:48:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175479121] [2023-11-10 11:48:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:03,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:48:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:48:03,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:48:03,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 90 [2023-11-10 11:48:03,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 174 flow. Second operand has 9 states, 9 states have (on average 60.888888888888886) internal successors, (548), 9 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:03,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:03,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 90 [2023-11-10 11:48:03,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:04,000 INFO L124 PetriNetUnfolderBase]: 497/1190 cut-off events. [2023-11-10 11:48:04,001 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-11-10 11:48:04,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 1190 events. 497/1190 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6808 event pairs, 38 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2060. Up to 359 conditions per place. [2023-11-10 11:48:04,005 INFO L140 encePairwiseOnDemand]: 73/90 looper letters, 28 selfloop transitions, 21 changer transitions 110/208 dead transitions. [2023-11-10 11:48:04,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 208 transitions, 752 flow [2023-11-10 11:48:04,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-10 11:48:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-10 11:48:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1513 transitions. [2023-11-10 11:48:04,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7309178743961353 [2023-11-10 11:48:04,009 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1513 transitions. [2023-11-10 11:48:04,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1513 transitions. [2023-11-10 11:48:04,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:04,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1513 transitions. [2023-11-10 11:48:04,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 65.78260869565217) internal successors, (1513), 23 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 90.0) internal successors, (2160), 24 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,017 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 90.0) internal successors, (2160), 24 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,017 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 174 flow. Second operand 23 states and 1513 transitions. [2023-11-10 11:48:04,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 208 transitions, 752 flow [2023-11-10 11:48:04,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 208 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:48:04,020 INFO L231 Difference]: Finished difference. Result has 129 places, 90 transitions, 325 flow [2023-11-10 11:48:04,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=325, PETRI_PLACES=129, PETRI_TRANSITIONS=90} [2023-11-10 11:48:04,021 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 37 predicate places. [2023-11-10 11:48:04,021 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 90 transitions, 325 flow [2023-11-10 11:48:04,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 60.888888888888886) internal successors, (548), 9 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:04,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:04,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:48:04,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:04,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash -883590625, now seen corresponding path program 1 times [2023-11-10 11:48:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786799225] [2023-11-10 11:48:04,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:04,172 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-10 11:48:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786799225] [2023-11-10 11:48:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786799225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:48:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344128210] [2023-11-10 11:48:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:04,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:48:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:48:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:48:04,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 90 [2023-11-10 11:48:04,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 90 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:04,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 90 [2023-11-10 11:48:04,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:04,349 INFO L124 PetriNetUnfolderBase]: 211/559 cut-off events. [2023-11-10 11:48:04,349 INFO L125 PetriNetUnfolderBase]: For 2263/2431 co-relation queries the response was YES. [2023-11-10 11:48:04,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 559 events. 211/559 cut-off events. For 2263/2431 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2746 event pairs, 43 based on Foata normal form. 17/562 useless extension candidates. Maximal degree in co-relation 2002. Up to 254 conditions per place. [2023-11-10 11:48:04,353 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 32 selfloop transitions, 4 changer transitions 35/132 dead transitions. [2023-11-10 11:48:04,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 132 transitions, 807 flow [2023-11-10 11:48:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:48:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:48:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 650 transitions. [2023-11-10 11:48:04,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8024691358024691 [2023-11-10 11:48:04,355 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 650 transitions. [2023-11-10 11:48:04,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 650 transitions. [2023-11-10 11:48:04,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:04,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 650 transitions. [2023-11-10 11:48:04,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 72.22222222222223) internal successors, (650), 9 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,358 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,358 INFO L175 Difference]: Start difference. First operand has 129 places, 90 transitions, 325 flow. Second operand 9 states and 650 transitions. [2023-11-10 11:48:04,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 132 transitions, 807 flow [2023-11-10 11:48:04,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 132 transitions, 699 flow, removed 52 selfloop flow, removed 14 redundant places. [2023-11-10 11:48:04,365 INFO L231 Difference]: Finished difference. Result has 104 places, 93 transitions, 360 flow [2023-11-10 11:48:04,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=360, PETRI_PLACES=104, PETRI_TRANSITIONS=93} [2023-11-10 11:48:04,366 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 12 predicate places. [2023-11-10 11:48:04,366 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 93 transitions, 360 flow [2023-11-10 11:48:04,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:04,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:04,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:48:04,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:04,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1096038548, now seen corresponding path program 1 times [2023-11-10 11:48:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:04,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305302954] [2023-11-10 11:48:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:04,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:04,849 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-10 11:48:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305302954] [2023-11-10 11:48:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305302954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:04,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:04,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:48:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441378347] [2023-11-10 11:48:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:04,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:48:04,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:04,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:48:04,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:48:04,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 90 [2023-11-10 11:48:04,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 93 transitions, 360 flow. Second operand has 10 states, 10 states have (on average 63.6) internal successors, (636), 10 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:04,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 90 [2023-11-10 11:48:04,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:05,223 INFO L124 PetriNetUnfolderBase]: 230/593 cut-off events. [2023-11-10 11:48:05,223 INFO L125 PetriNetUnfolderBase]: For 2020/2234 co-relation queries the response was YES. [2023-11-10 11:48:05,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2182 conditions, 593 events. 230/593 cut-off events. For 2020/2234 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2996 event pairs, 7 based on Foata normal form. 37/621 useless extension candidates. Maximal degree in co-relation 2117. Up to 172 conditions per place. [2023-11-10 11:48:05,227 INFO L140 encePairwiseOnDemand]: 76/90 looper letters, 41 selfloop transitions, 26 changer transitions 59/178 dead transitions. [2023-11-10 11:48:05,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 178 transitions, 1283 flow [2023-11-10 11:48:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 11:48:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 11:48:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1342 transitions. [2023-11-10 11:48:05,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7455555555555555 [2023-11-10 11:48:05,230 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1342 transitions. [2023-11-10 11:48:05,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1342 transitions. [2023-11-10 11:48:05,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:05,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1342 transitions. [2023-11-10 11:48:05,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 67.1) internal successors, (1342), 20 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 90.0) internal successors, (1890), 21 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,237 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 90.0) internal successors, (1890), 21 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,237 INFO L175 Difference]: Start difference. First operand has 104 places, 93 transitions, 360 flow. Second operand 20 states and 1342 transitions. [2023-11-10 11:48:05,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 178 transitions, 1283 flow [2023-11-10 11:48:05,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 178 transitions, 1224 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-11-10 11:48:05,246 INFO L231 Difference]: Finished difference. Result has 128 places, 103 transitions, 572 flow [2023-11-10 11:48:05,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=572, PETRI_PLACES=128, PETRI_TRANSITIONS=103} [2023-11-10 11:48:05,247 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 36 predicate places. [2023-11-10 11:48:05,247 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 103 transitions, 572 flow [2023-11-10 11:48:05,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.6) internal successors, (636), 10 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:05,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:05,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:48:05,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:05,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash 43644798, now seen corresponding path program 1 times [2023-11-10 11:48:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:05,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876304273] [2023-11-10 11:48:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:05,822 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-10 11:48:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:05,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876304273] [2023-11-10 11:48:05,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876304273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:05,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:05,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:48:05,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698756536] [2023-11-10 11:48:05,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:05,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:48:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:05,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:48:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:48:05,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 90 [2023-11-10 11:48:05,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 103 transitions, 572 flow. Second operand has 12 states, 12 states have (on average 56.833333333333336) internal successors, (682), 12 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-10 11:48:05,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:05,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 90 [2023-11-10 11:48:05,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:06,686 INFO L124 PetriNetUnfolderBase]: 356/808 cut-off events. [2023-11-10 11:48:06,686 INFO L125 PetriNetUnfolderBase]: For 5815/6036 co-relation queries the response was YES. [2023-11-10 11:48:06,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3636 conditions, 808 events. 356/808 cut-off events. For 5815/6036 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4265 event pairs, 31 based on Foata normal form. 40/840 useless extension candidates. Maximal degree in co-relation 3550. Up to 241 conditions per place. [2023-11-10 11:48:06,694 INFO L140 encePairwiseOnDemand]: 73/90 looper letters, 69 selfloop transitions, 33 changer transitions 56/203 dead transitions. [2023-11-10 11:48:06,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 203 transitions, 1663 flow [2023-11-10 11:48:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-10 11:48:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-10 11:48:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1739 transitions. [2023-11-10 11:48:06,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6662835249042146 [2023-11-10 11:48:06,698 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 1739 transitions. [2023-11-10 11:48:06,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 1739 transitions. [2023-11-10 11:48:06,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:06,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1739 transitions. [2023-11-10 11:48:06,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 59.96551724137931) internal successors, (1739), 29 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:06,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 90.0) internal successors, (2700), 30 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:06,713 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 90.0) internal successors, (2700), 30 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:06,713 INFO L175 Difference]: Start difference. First operand has 128 places, 103 transitions, 572 flow. Second operand 29 states and 1739 transitions. [2023-11-10 11:48:06,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 203 transitions, 1663 flow [2023-11-10 11:48:06,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 203 transitions, 1546 flow, removed 57 selfloop flow, removed 8 redundant places. [2023-11-10 11:48:06,727 INFO L231 Difference]: Finished difference. Result has 157 places, 112 transitions, 742 flow [2023-11-10 11:48:06,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=742, PETRI_PLACES=157, PETRI_TRANSITIONS=112} [2023-11-10 11:48:06,729 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 65 predicate places. [2023-11-10 11:48:06,729 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 112 transitions, 742 flow [2023-11-10 11:48:06,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 56.833333333333336) internal successors, (682), 12 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-10 11:48:06,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:06,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:06,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:48:06,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:06,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash 21529274, now seen corresponding path program 1 times [2023-11-10 11:48:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237667470] [2023-11-10 11:48:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:07,251 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-10 11:48:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237667470] [2023-11-10 11:48:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237667470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:07,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:07,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:48:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199409503] [2023-11-10 11:48:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:07,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:48:07,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:48:07,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:48:07,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 90 [2023-11-10 11:48:07,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 112 transitions, 742 flow. Second operand has 10 states, 10 states have (on average 65.5) internal successors, (655), 10 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:07,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 90 [2023-11-10 11:48:07,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:07,522 INFO L124 PetriNetUnfolderBase]: 177/530 cut-off events. [2023-11-10 11:48:07,522 INFO L125 PetriNetUnfolderBase]: For 6558/6774 co-relation queries the response was YES. [2023-11-10 11:48:07,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2868 conditions, 530 events. 177/530 cut-off events. For 6558/6774 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2643 event pairs, 30 based on Foata normal form. 44/555 useless extension candidates. Maximal degree in co-relation 2767. Up to 164 conditions per place. [2023-11-10 11:48:07,527 INFO L140 encePairwiseOnDemand]: 79/90 looper letters, 31 selfloop transitions, 17 changer transitions 44/160 dead transitions. [2023-11-10 11:48:07,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 160 transitions, 1455 flow [2023-11-10 11:48:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:48:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:48:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 881 transitions. [2023-11-10 11:48:07,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.752991452991453 [2023-11-10 11:48:07,530 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 881 transitions. [2023-11-10 11:48:07,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 881 transitions. [2023-11-10 11:48:07,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:07,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 881 transitions. [2023-11-10 11:48:07,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 67.76923076923077) internal successors, (881), 13 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,533 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,533 INFO L175 Difference]: Start difference. First operand has 157 places, 112 transitions, 742 flow. Second operand 13 states and 881 transitions. [2023-11-10 11:48:07,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 160 transitions, 1455 flow [2023-11-10 11:48:07,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 160 transitions, 1380 flow, removed 35 selfloop flow, removed 17 redundant places. [2023-11-10 11:48:07,550 INFO L231 Difference]: Finished difference. Result has 141 places, 115 transitions, 826 flow [2023-11-10 11:48:07,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=826, PETRI_PLACES=141, PETRI_TRANSITIONS=115} [2023-11-10 11:48:07,552 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 49 predicate places. [2023-11-10 11:48:07,552 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 115 transitions, 826 flow [2023-11-10 11:48:07,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.5) internal successors, (655), 10 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:07,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:07,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:48:07,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:07,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1809621792, now seen corresponding path program 1 times [2023-11-10 11:48:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:07,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542860226] [2023-11-10 11:48:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:07,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:07,699 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-10 11:48:07,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:07,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542860226] [2023-11-10 11:48:07,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542860226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:07,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:07,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:48:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53522380] [2023-11-10 11:48:07,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:07,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:48:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:48:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:48:07,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 90 [2023-11-10 11:48:07,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 115 transitions, 826 flow. Second operand has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:07,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 90 [2023-11-10 11:48:07,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:07,885 INFO L124 PetriNetUnfolderBase]: 150/502 cut-off events. [2023-11-10 11:48:07,885 INFO L125 PetriNetUnfolderBase]: For 4621/5468 co-relation queries the response was YES. [2023-11-10 11:48:07,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 502 events. 150/502 cut-off events. For 4621/5468 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2609 event pairs, 25 based on Foata normal form. 40/517 useless extension candidates. Maximal degree in co-relation 2526. Up to 116 conditions per place. [2023-11-10 11:48:07,889 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 40 selfloop transitions, 8 changer transitions 34/146 dead transitions. [2023-11-10 11:48:07,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 146 transitions, 1440 flow [2023-11-10 11:48:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:48:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:48:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 647 transitions. [2023-11-10 11:48:07,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7987654320987654 [2023-11-10 11:48:07,892 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 647 transitions. [2023-11-10 11:48:07,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 647 transitions. [2023-11-10 11:48:07,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:07,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 647 transitions. [2023-11-10 11:48:07,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 71.88888888888889) internal successors, (647), 9 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,896 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,896 INFO L175 Difference]: Start difference. First operand has 141 places, 115 transitions, 826 flow. Second operand 9 states and 647 transitions. [2023-11-10 11:48:07,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 146 transitions, 1440 flow [2023-11-10 11:48:07,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 146 transitions, 1338 flow, removed 40 selfloop flow, removed 8 redundant places. [2023-11-10 11:48:07,911 INFO L231 Difference]: Finished difference. Result has 142 places, 107 transitions, 720 flow [2023-11-10 11:48:07,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=720, PETRI_PLACES=142, PETRI_TRANSITIONS=107} [2023-11-10 11:48:07,912 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 50 predicate places. [2023-11-10 11:48:07,912 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 107 transitions, 720 flow [2023-11-10 11:48:07,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:07,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:07,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:48:07,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:07,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:07,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1237652797, now seen corresponding path program 1 times [2023-11-10 11:48:07,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:07,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833860307] [2023-11-10 11:48:07,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:07,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:08,424 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-10 11:48:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833860307] [2023-11-10 11:48:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833860307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:08,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:08,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-10 11:48:08,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158822318] [2023-11-10 11:48:08,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:08,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 11:48:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:08,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 11:48:08,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-10 11:48:08,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 90 [2023-11-10 11:48:08,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 107 transitions, 720 flow. Second operand has 13 states, 13 states have (on average 64.38461538461539) internal successors, (837), 13 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:08,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:08,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 90 [2023-11-10 11:48:08,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:08,688 INFO L124 PetriNetUnfolderBase]: 114/414 cut-off events. [2023-11-10 11:48:08,689 INFO L125 PetriNetUnfolderBase]: For 4192/4391 co-relation queries the response was YES. [2023-11-10 11:48:08,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 414 events. 114/414 cut-off events. For 4192/4391 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1984 event pairs, 27 based on Foata normal form. 25/423 useless extension candidates. Maximal degree in co-relation 2060. Up to 119 conditions per place. [2023-11-10 11:48:08,692 INFO L140 encePairwiseOnDemand]: 78/90 looper letters, 31 selfloop transitions, 15 changer transitions 21/131 dead transitions. [2023-11-10 11:48:08,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 131 transitions, 1146 flow [2023-11-10 11:48:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-10 11:48:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-10 11:48:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 992 transitions. [2023-11-10 11:48:08,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7348148148148148 [2023-11-10 11:48:08,695 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 992 transitions. [2023-11-10 11:48:08,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 992 transitions. [2023-11-10 11:48:08,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:08,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 992 transitions. [2023-11-10 11:48:08,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 66.13333333333334) internal successors, (992), 15 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:08,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 90.0) internal successors, (1440), 16 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:08,699 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 90.0) internal successors, (1440), 16 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:08,699 INFO L175 Difference]: Start difference. First operand has 142 places, 107 transitions, 720 flow. Second operand 15 states and 992 transitions. [2023-11-10 11:48:08,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 131 transitions, 1146 flow [2023-11-10 11:48:08,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 131 transitions, 1038 flow, removed 35 selfloop flow, removed 9 redundant places. [2023-11-10 11:48:08,715 INFO L231 Difference]: Finished difference. Result has 148 places, 103 transitions, 684 flow [2023-11-10 11:48:08,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=684, PETRI_PLACES=148, PETRI_TRANSITIONS=103} [2023-11-10 11:48:08,717 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 56 predicate places. [2023-11-10 11:48:08,717 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 103 transitions, 684 flow [2023-11-10 11:48:08,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.38461538461539) internal successors, (837), 13 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:08,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:08,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:08,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:48:08,718 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:08,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1187573343, now seen corresponding path program 2 times [2023-11-10 11:48:08,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:08,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405438694] [2023-11-10 11:48:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:09,232 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-10 11:48:09,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:09,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405438694] [2023-11-10 11:48:09,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405438694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:09,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:09,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:48:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33891541] [2023-11-10 11:48:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:09,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:48:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:09,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:48:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:48:09,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 90 [2023-11-10 11:48:09,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 103 transitions, 684 flow. Second operand has 12 states, 12 states have (on average 63.583333333333336) internal successors, (763), 12 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:09,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 90 [2023-11-10 11:48:09,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:09,472 INFO L124 PetriNetUnfolderBase]: 103/421 cut-off events. [2023-11-10 11:48:09,473 INFO L125 PetriNetUnfolderBase]: For 4245/4432 co-relation queries the response was YES. [2023-11-10 11:48:09,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 421 events. 103/421 cut-off events. For 4245/4432 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2178 event pairs, 33 based on Foata normal form. 22/428 useless extension candidates. Maximal degree in co-relation 2094. Up to 141 conditions per place. [2023-11-10 11:48:09,475 INFO L140 encePairwiseOnDemand]: 79/90 looper letters, 32 selfloop transitions, 8 changer transitions 18/121 dead transitions. [2023-11-10 11:48:09,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 121 transitions, 1096 flow [2023-11-10 11:48:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:48:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:48:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 846 transitions. [2023-11-10 11:48:09,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7230769230769231 [2023-11-10 11:48:09,477 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 846 transitions. [2023-11-10 11:48:09,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 846 transitions. [2023-11-10 11:48:09,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:09,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 846 transitions. [2023-11-10 11:48:09,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 65.07692307692308) internal successors, (846), 13 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,485 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,485 INFO L175 Difference]: Start difference. First operand has 148 places, 103 transitions, 684 flow. Second operand 13 states and 846 transitions. [2023-11-10 11:48:09,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 121 transitions, 1096 flow [2023-11-10 11:48:09,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 121 transitions, 986 flow, removed 42 selfloop flow, removed 15 redundant places. [2023-11-10 11:48:09,517 INFO L231 Difference]: Finished difference. Result has 145 places, 102 transitions, 655 flow [2023-11-10 11:48:09,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=655, PETRI_PLACES=145, PETRI_TRANSITIONS=102} [2023-11-10 11:48:09,518 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 53 predicate places. [2023-11-10 11:48:09,518 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 102 transitions, 655 flow [2023-11-10 11:48:09,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 63.583333333333336) internal successors, (763), 12 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:09,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:09,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:48:09,519 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:09,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 83985133, now seen corresponding path program 3 times [2023-11-10 11:48:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312250526] [2023-11-10 11:48:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:10,085 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-10 11:48:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312250526] [2023-11-10 11:48:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312250526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:10,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:10,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-10 11:48:10,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711382050] [2023-11-10 11:48:10,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:10,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-10 11:48:10,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:10,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-10 11:48:10,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-10 11:48:10,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 90 [2023-11-10 11:48:10,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 102 transitions, 655 flow. Second operand has 14 states, 14 states have (on average 58.642857142857146) internal successors, (821), 14 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:10,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:10,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 90 [2023-11-10 11:48:10,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:10,386 INFO L124 PetriNetUnfolderBase]: 102/409 cut-off events. [2023-11-10 11:48:10,386 INFO L125 PetriNetUnfolderBase]: For 4375/4664 co-relation queries the response was YES. [2023-11-10 11:48:10,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 409 events. 102/409 cut-off events. For 4375/4664 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2118 event pairs, 16 based on Foata normal form. 29/428 useless extension candidates. Maximal degree in co-relation 2064. Up to 110 conditions per place. [2023-11-10 11:48:10,389 INFO L140 encePairwiseOnDemand]: 74/90 looper letters, 31 selfloop transitions, 25 changer transitions 28/134 dead transitions. [2023-11-10 11:48:10,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 134 transitions, 1374 flow [2023-11-10 11:48:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-10 11:48:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-10 11:48:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1030 transitions. [2023-11-10 11:48:10,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673202614379085 [2023-11-10 11:48:10,390 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1030 transitions. [2023-11-10 11:48:10,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1030 transitions. [2023-11-10 11:48:10,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:10,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1030 transitions. [2023-11-10 11:48:10,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 60.588235294117645) internal successors, (1030), 17 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:10,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 90.0) internal successors, (1620), 18 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:10,394 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 90.0) internal successors, (1620), 18 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:10,394 INFO L175 Difference]: Start difference. First operand has 145 places, 102 transitions, 655 flow. Second operand 17 states and 1030 transitions. [2023-11-10 11:48:10,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 134 transitions, 1374 flow [2023-11-10 11:48:10,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 134 transitions, 1234 flow, removed 62 selfloop flow, removed 11 redundant places. [2023-11-10 11:48:10,403 INFO L231 Difference]: Finished difference. Result has 150 places, 98 transitions, 641 flow [2023-11-10 11:48:10,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=641, PETRI_PLACES=150, PETRI_TRANSITIONS=98} [2023-11-10 11:48:10,403 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 58 predicate places. [2023-11-10 11:48:10,404 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 98 transitions, 641 flow [2023-11-10 11:48:10,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 58.642857142857146) internal successors, (821), 14 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:10,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:10,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:10,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:48:10,404 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:10,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1154995483, now seen corresponding path program 4 times [2023-11-10 11:48:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883766044] [2023-11-10 11:48:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:11,014 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-10 11:48:11,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:11,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883766044] [2023-11-10 11:48:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883766044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:11,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:11,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:48:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579847070] [2023-11-10 11:48:11,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:11,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:48:11,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:11,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:48:11,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:48:11,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 90 [2023-11-10 11:48:11,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 98 transitions, 641 flow. Second operand has 12 states, 12 states have (on average 62.666666666666664) internal successors, (752), 12 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:11,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 90 [2023-11-10 11:48:11,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:11,270 INFO L124 PetriNetUnfolderBase]: 75/389 cut-off events. [2023-11-10 11:48:11,270 INFO L125 PetriNetUnfolderBase]: For 3078/3270 co-relation queries the response was YES. [2023-11-10 11:48:11,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 389 events. 75/389 cut-off events. For 3078/3270 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2139 event pairs, 9 based on Foata normal form. 23/401 useless extension candidates. Maximal degree in co-relation 1673. Up to 65 conditions per place. [2023-11-10 11:48:11,273 INFO L140 encePairwiseOnDemand]: 80/90 looper letters, 29 selfloop transitions, 9 changer transitions 24/119 dead transitions. [2023-11-10 11:48:11,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 119 transitions, 1074 flow [2023-11-10 11:48:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:48:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:48:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 834 transitions. [2023-11-10 11:48:11,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7128205128205128 [2023-11-10 11:48:11,274 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 834 transitions. [2023-11-10 11:48:11,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 834 transitions. [2023-11-10 11:48:11,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:11,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 834 transitions. [2023-11-10 11:48:11,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 64.15384615384616) internal successors, (834), 13 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,277 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,277 INFO L175 Difference]: Start difference. First operand has 150 places, 98 transitions, 641 flow. Second operand 13 states and 834 transitions. [2023-11-10 11:48:11,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 119 transitions, 1074 flow [2023-11-10 11:48:11,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 119 transitions, 945 flow, removed 46 selfloop flow, removed 16 redundant places. [2023-11-10 11:48:11,284 INFO L231 Difference]: Finished difference. Result has 142 places, 90 transitions, 511 flow [2023-11-10 11:48:11,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=511, PETRI_PLACES=142, PETRI_TRANSITIONS=90} [2023-11-10 11:48:11,285 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 50 predicate places. [2023-11-10 11:48:11,285 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 90 transitions, 511 flow [2023-11-10 11:48:11,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 62.666666666666664) internal successors, (752), 12 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:11,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:11,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:48:11,286 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:11,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash -448191487, now seen corresponding path program 1 times [2023-11-10 11:48:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106683855] [2023-11-10 11:48:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:11,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:11,527 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-10 11:48:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:11,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106683855] [2023-11-10 11:48:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106683855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:11,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:48:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591480754] [2023-11-10 11:48:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:11,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:48:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:48:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:48:11,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 90 [2023-11-10 11:48:11,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 90 transitions, 511 flow. Second operand has 9 states, 9 states have (on average 63.111111111111114) internal successors, (568), 9 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:11,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 90 [2023-11-10 11:48:11,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:11,806 INFO L124 PetriNetUnfolderBase]: 142/398 cut-off events. [2023-11-10 11:48:11,806 INFO L125 PetriNetUnfolderBase]: For 2155/2165 co-relation queries the response was YES. [2023-11-10 11:48:11,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511 conditions, 398 events. 142/398 cut-off events. For 2155/2165 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1801 event pairs, 0 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 1472. Up to 69 conditions per place. [2023-11-10 11:48:11,809 INFO L140 encePairwiseOnDemand]: 77/90 looper letters, 19 selfloop transitions, 10 changer transitions 65/142 dead transitions. [2023-11-10 11:48:11,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 142 transitions, 1133 flow [2023-11-10 11:48:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 11:48:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 11:48:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1245 transitions. [2023-11-10 11:48:11,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7280701754385965 [2023-11-10 11:48:11,811 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1245 transitions. [2023-11-10 11:48:11,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1245 transitions. [2023-11-10 11:48:11,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:11,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1245 transitions. [2023-11-10 11:48:11,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 65.52631578947368) internal successors, (1245), 19 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 90.0) internal successors, (1800), 20 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,815 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 90.0) internal successors, (1800), 20 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,815 INFO L175 Difference]: Start difference. First operand has 142 places, 90 transitions, 511 flow. Second operand 19 states and 1245 transitions. [2023-11-10 11:48:11,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 142 transitions, 1133 flow [2023-11-10 11:48:11,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 142 transitions, 747 flow, removed 120 selfloop flow, removed 40 redundant places. [2023-11-10 11:48:11,819 INFO L231 Difference]: Finished difference. Result has 127 places, 75 transitions, 285 flow [2023-11-10 11:48:11,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=285, PETRI_PLACES=127, PETRI_TRANSITIONS=75} [2023-11-10 11:48:11,819 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 35 predicate places. [2023-11-10 11:48:11,820 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 75 transitions, 285 flow [2023-11-10 11:48:11,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.111111111111114) internal successors, (568), 9 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:11,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:11,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:48:11,820 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:48:11,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1125138741, now seen corresponding path program 1 times [2023-11-10 11:48:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081600419] [2023-11-10 11:48:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:48:11,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:48:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:48:11,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:48:11,921 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:48:11,922 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-10 11:48:11,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-10 11:48:11,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-10 11:48:11,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-10 11:48:11,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-10 11:48:11,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:48:11,924 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:11,928 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:48:11,928 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:48:11,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-10 11:48:11,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-10 11:48:12,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:48:12 BasicIcfg [2023-11-10 11:48:12,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:48:12,005 INFO L158 Benchmark]: Toolchain (without parser) took 11285.74ms. Allocated memory was 199.2MB in the beginning and 468.7MB in the end (delta: 269.5MB). Free memory was 153.1MB in the beginning and 427.7MB in the end (delta: -274.6MB). Peak memory consumption was 263.9MB. Max. memory is 8.0GB. [2023-11-10 11:48:12,005 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:48:12,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.42ms. Allocated memory is still 199.2MB. Free memory was 153.1MB in the beginning and 130.7MB in the end (delta: 22.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-11-10 11:48:12,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.93ms. Allocated memory is still 199.2MB. Free memory was 130.5MB in the beginning and 128.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-10 11:48:12,007 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 199.2MB. Free memory was 128.0MB in the beginning and 126.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-10 11:48:12,007 INFO L158 Benchmark]: RCFGBuilder took 455.59ms. Allocated memory is still 199.2MB. Free memory was 125.9MB in the beginning and 163.0MB in the end (delta: -37.2MB). Peak memory consumption was 30.3MB. Max. memory is 8.0GB. [2023-11-10 11:48:12,007 INFO L158 Benchmark]: TraceAbstraction took 10385.50ms. Allocated memory was 199.2MB in the beginning and 468.7MB in the end (delta: 269.5MB). Free memory was 162.5MB in the beginning and 427.7MB in the end (delta: -265.2MB). Peak memory consumption was 272.4MB. Max. memory is 8.0GB. [2023-11-10 11:48:12,008 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.12ms. Allocated memory is still 199.2MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 346.42ms. Allocated memory is still 199.2MB. Free memory was 153.1MB in the beginning and 130.7MB in the end (delta: 22.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.93ms. Allocated memory is still 199.2MB. Free memory was 130.5MB in the beginning and 128.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 199.2MB. Free memory was 128.0MB in the beginning and 126.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 455.59ms. Allocated memory is still 199.2MB. Free memory was 125.9MB in the beginning and 163.0MB in the end (delta: -37.2MB). Peak memory consumption was 30.3MB. Max. memory is 8.0GB. * TraceAbstraction took 10385.50ms. Allocated memory was 199.2MB in the beginning and 468.7MB in the end (delta: 269.5MB). Free memory was 162.5MB in the beginning and 427.7MB in the end (delta: -265.2MB). Peak memory consumption was 272.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x$flush_delayed=0, x=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x$flush_delayed=0, x$mem_tmp=0, x=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x=0] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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 [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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 5 procedures, 107 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 744 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 744 mSDsluCounter, 982 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 807 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1545 IncrementalHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 175 mSDtfsCounter, 1545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=826occurred in iteration=6, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 5237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-10 11:48:12,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...