/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:06:27,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:06:27,469 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-12-09 15:06:27,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:06:27,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:06:27,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:06:27,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:06:27,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:06:27,494 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:06:27,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:06:27,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:06:27,495 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:06:27,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:06:27,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:06:27,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:06:27,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:06:27,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:06:27,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:06:27,496 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:06:27,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:06:27,501 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:06:27,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:06:27,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:06:27,503 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:06:27,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:06:27,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:06:27,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:06:27,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:06:27,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:06:27,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:06:27,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:06:27,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:06:27,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:06:27,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:06:27,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:06:27,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:06:27,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:06:27,667 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:06:27,667 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:06:27,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2023-12-09 15:06:28,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:06:29,001 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:06:29,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2023-12-09 15:06:29,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b6478cf/f48290e188ac4dc39579e8d6193c0c96/FLAG47a82259c [2023-12-09 15:06:29,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b6478cf/f48290e188ac4dc39579e8d6193c0c96 [2023-12-09 15:06:29,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:06:29,023 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:06:29,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:06:29,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:06:29,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:06:29,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d91856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29, skipping insertion in model container [2023-12-09 15:06:29,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,058 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:06:29,195 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c[2820,2833] [2023-12-09 15:06:29,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:06:29,208 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:06:29,224 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c[2820,2833] [2023-12-09 15:06:29,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:06:29,237 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:06:29,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29 WrapperNode [2023-12-09 15:06:29,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:06:29,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:06:29,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:06:29,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:06:29,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,269 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 292 [2023-12-09 15:06:29,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:06:29,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:06:29,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:06:29,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:06:29,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:06:29,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:06:29,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:06:29,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:06:29,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (1/1) ... [2023-12-09 15:06:29,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:06:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:06:29,322 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-12-09 15:06:29,356 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-12-09 15:06:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:06:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:06:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:06:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:06:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:06:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:06:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:06:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:06:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:06:29,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:06:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:06:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:06:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:06:29,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:06:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:06:29,375 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:06:29,480 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:06:29,482 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:06:29,886 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:06:29,897 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:06:29,897 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-09 15:06:29,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:06:29 BoogieIcfgContainer [2023-12-09 15:06:29,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:06:29,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:06:29,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:06:29,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:06:29,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:06:29" (1/3) ... [2023-12-09 15:06:29,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a3dfe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:06:29, skipping insertion in model container [2023-12-09 15:06:29,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:29" (2/3) ... [2023-12-09 15:06:29,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a3dfe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:06:29, skipping insertion in model container [2023-12-09 15:06:29,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:06:29" (3/3) ... [2023-12-09 15:06:29,903 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2023-12-09 15:06:29,919 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:06:29,919 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:06:29,919 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:06:29,984 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:06:30,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 366 transitions, 753 flow [2023-12-09 15:06:30,106 INFO L124 PetriNetUnfolderBase]: 29/363 cut-off events. [2023-12-09 15:06:30,106 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:06:30,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 363 events. 29/363 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 595 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 276. Up to 3 conditions per place. [2023-12-09 15:06:30,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 366 transitions, 753 flow [2023-12-09 15:06:30,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 333 places, 352 transitions, 722 flow [2023-12-09 15:06:30,125 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:06:30,130 INFO L362 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=true, 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;@2cb58385, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:06:30,130 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:06:30,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:06:30,177 INFO L124 PetriNetUnfolderBase]: 29/351 cut-off events. [2023-12-09 15:06:30,177 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:06:30,178 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:06:30,178 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:06:30,179 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:06:30,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:06:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash -617949310, now seen corresponding path program 1 times [2023-12-09 15:06:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:06:30,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151681750] [2023-12-09 15:06:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:06:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:06:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:06:32,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-12-09 15:06:32,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:06:32,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151681750] [2023-12-09 15:06:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151681750] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:06:32,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:06:32,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-12-09 15:06:32,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971160093] [2023-12-09 15:06:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:06:32,181 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-09 15:06:32,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:06:32,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-09 15:06:32,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2023-12-09 15:06:32,211 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 366 [2023-12-09 15:06:32,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 352 transitions, 722 flow. Second operand has 28 states, 28 states have (on average 226.42857142857142) internal successors, (6340), 28 states have internal predecessors, (6340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:32,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:06:32,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 366 [2023-12-09 15:06:32,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:06:36,025 INFO L124 PetriNetUnfolderBase]: 1669/12547 cut-off events. [2023-12-09 15:06:36,025 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2023-12-09 15:06:36,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15345 conditions, 12547 events. 1669/12547 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 152833 event pairs, 906 based on Foata normal form. 647/11764 useless extension candidates. Maximal degree in co-relation 4669. Up to 520 conditions per place. [2023-12-09 15:06:36,120 INFO L140 encePairwiseOnDemand]: 289/366 looper letters, 308 selfloop transitions, 61 changer transitions 36/615 dead transitions. [2023-12-09 15:06:36,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 615 transitions, 2139 flow [2023-12-09 15:06:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-09 15:06:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2023-12-09 15:06:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 14105 transitions. [2023-12-09 15:06:36,149 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6317746125593479 [2023-12-09 15:06:36,149 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 14105 transitions. [2023-12-09 15:06:36,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 14105 transitions. [2023-12-09 15:06:36,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:06:36,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 14105 transitions. [2023-12-09 15:06:36,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 231.2295081967213) internal successors, (14105), 61 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:36,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 366.0) internal successors, (22692), 62 states have internal predecessors, (22692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:36,272 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 366.0) internal successors, (22692), 62 states have internal predecessors, (22692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:36,284 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 60 predicate places. [2023-12-09 15:06:36,284 INFO L500 AbstractCegarLoop]: Abstraction has has 393 places, 615 transitions, 2139 flow [2023-12-09 15:06:36,286 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 226.42857142857142) internal successors, (6340), 28 states have internal predecessors, (6340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:36,286 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:06:36,286 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:06:36,287 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:06:36,287 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:06:36,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:06:36,287 INFO L85 PathProgramCache]: Analyzing trace with hash -880177298, now seen corresponding path program 2 times [2023-12-09 15:06:36,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:06:36,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102069399] [2023-12-09 15:06:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:06:36,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:06:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:06:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:06:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102069399] [2023-12-09 15:06:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102069399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:06:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:06:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-12-09 15:06:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798959580] [2023-12-09 15:06:37,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:06:37,499 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-09 15:06:37,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:06:37,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-09 15:06:37,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2023-12-09 15:06:37,503 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 366 [2023-12-09 15:06:37,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 615 transitions, 2139 flow. Second operand has 27 states, 27 states have (on average 228.5185185185185) internal successors, (6170), 27 states have internal predecessors, (6170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:37,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:06:37,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 366 [2023-12-09 15:06:37,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:06:40,407 INFO L124 PetriNetUnfolderBase]: 1864/14058 cut-off events. [2023-12-09 15:06:40,408 INFO L125 PetriNetUnfolderBase]: For 1547/3569 co-relation queries the response was YES. [2023-12-09 15:06:40,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19829 conditions, 14058 events. 1864/14058 cut-off events. For 1547/3569 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 175704 event pairs, 840 based on Foata normal form. 14/12422 useless extension candidates. Maximal degree in co-relation 7189. Up to 530 conditions per place. [2023-12-09 15:06:40,504 INFO L140 encePairwiseOnDemand]: 314/366 looper letters, 388 selfloop transitions, 55 changer transitions 66/727 dead transitions. [2023-12-09 15:06:40,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 727 transitions, 3653 flow [2023-12-09 15:06:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-09 15:06:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-12-09 15:06:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 11167 transitions. [2023-12-09 15:06:40,522 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6356443533697632 [2023-12-09 15:06:40,522 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 11167 transitions. [2023-12-09 15:06:40,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 11167 transitions. [2023-12-09 15:06:40,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:06:40,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 11167 transitions. [2023-12-09 15:06:40,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 232.64583333333334) internal successors, (11167), 48 states have internal predecessors, (11167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:40,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 366.0) internal successors, (17934), 49 states have internal predecessors, (17934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:40,579 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 366.0) internal successors, (17934), 49 states have internal predecessors, (17934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:40,580 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 107 predicate places. [2023-12-09 15:06:40,580 INFO L500 AbstractCegarLoop]: Abstraction has has 440 places, 727 transitions, 3653 flow [2023-12-09 15:06:40,582 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 228.5185185185185) internal successors, (6170), 27 states have internal predecessors, (6170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:40,582 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:06:40,582 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:06:40,582 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:06:40,582 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:06:40,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:06:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2032684158, now seen corresponding path program 3 times [2023-12-09 15:06:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:06:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089874414] [2023-12-09 15:06:40,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:06:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:06:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:06:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:06:41,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089874414] [2023-12-09 15:06:41,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089874414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:06:41,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:06:41,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-12-09 15:06:41,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248240881] [2023-12-09 15:06:41,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:06:41,726 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-09 15:06:41,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:06:41,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-09 15:06:41,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2023-12-09 15:06:41,731 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 366 [2023-12-09 15:06:41,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 727 transitions, 3653 flow. Second operand has 28 states, 28 states have (on average 226.42857142857142) internal successors, (6340), 28 states have internal predecessors, (6340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:41,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:06:41,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 366 [2023-12-09 15:06:41,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:06:46,120 INFO L124 PetriNetUnfolderBase]: 2174/16491 cut-off events. [2023-12-09 15:06:46,121 INFO L125 PetriNetUnfolderBase]: For 4343/13611 co-relation queries the response was YES. [2023-12-09 15:06:46,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26866 conditions, 16491 events. 2174/16491 cut-off events. For 4343/13611 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 210387 event pairs, 670 based on Foata normal form. 57/14571 useless extension candidates. Maximal degree in co-relation 8921. Up to 973 conditions per place. [2023-12-09 15:06:46,268 INFO L140 encePairwiseOnDemand]: 312/366 looper letters, 512 selfloop transitions, 75 changer transitions 112/909 dead transitions. [2023-12-09 15:06:46,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 909 transitions, 6224 flow [2023-12-09 15:06:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-09 15:06:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-12-09 15:06:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 11969 transitions. [2023-12-09 15:06:46,278 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6288881883144178 [2023-12-09 15:06:46,278 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 11969 transitions. [2023-12-09 15:06:46,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 11969 transitions. [2023-12-09 15:06:46,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:06:46,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 11969 transitions. [2023-12-09 15:06:46,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 230.17307692307693) internal successors, (11969), 52 states have internal predecessors, (11969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:46,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 366.0) internal successors, (19398), 53 states have internal predecessors, (19398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:46,317 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 366.0) internal successors, (19398), 53 states have internal predecessors, (19398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:46,317 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 158 predicate places. [2023-12-09 15:06:46,317 INFO L500 AbstractCegarLoop]: Abstraction has has 491 places, 909 transitions, 6224 flow [2023-12-09 15:06:46,319 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 226.42857142857142) internal successors, (6340), 28 states have internal predecessors, (6340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:46,319 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:06:46,319 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:06:46,319 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:06:46,319 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:06:46,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:06:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1688173562, now seen corresponding path program 4 times [2023-12-09 15:06:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:06:46,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170538780] [2023-12-09 15:06:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:06:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:06:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:06:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:47,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:06:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170538780] [2023-12-09 15:06:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170538780] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:06:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:06:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-12-09 15:06:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615691770] [2023-12-09 15:06:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:06:47,624 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-09 15:06:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:06:47,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-09 15:06:47,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2023-12-09 15:06:47,630 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 366 [2023-12-09 15:06:47,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 909 transitions, 6224 flow. Second operand has 26 states, 26 states have (on average 226.69230769230768) internal successors, (5894), 26 states have internal predecessors, (5894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:47,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:06:47,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 366 [2023-12-09 15:06:47,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:06:52,385 INFO L124 PetriNetUnfolderBase]: 3000/22462 cut-off events. [2023-12-09 15:06:52,386 INFO L125 PetriNetUnfolderBase]: For 10138/30740 co-relation queries the response was YES. [2023-12-09 15:06:52,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41272 conditions, 22462 events. 3000/22462 cut-off events. For 10138/30740 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 303653 event pairs, 822 based on Foata normal form. 99/19807 useless extension candidates. Maximal degree in co-relation 7739. Up to 2098 conditions per place. [2023-12-09 15:06:52,620 INFO L140 encePairwiseOnDemand]: 316/366 looper letters, 676 selfloop transitions, 90 changer transitions 160/1136 dead transitions. [2023-12-09 15:06:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 1136 transitions, 9974 flow [2023-12-09 15:06:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-09 15:06:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-12-09 15:06:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 10367 transitions. [2023-12-09 15:06:52,629 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6294474802671524 [2023-12-09 15:06:52,629 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 10367 transitions. [2023-12-09 15:06:52,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 10367 transitions. [2023-12-09 15:06:52,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:06:52,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 10367 transitions. [2023-12-09 15:06:52,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 230.37777777777777) internal successors, (10367), 45 states have internal predecessors, (10367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:52,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 366.0) internal successors, (16836), 46 states have internal predecessors, (16836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:52,654 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 366.0) internal successors, (16836), 46 states have internal predecessors, (16836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:52,655 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 202 predicate places. [2023-12-09 15:06:52,655 INFO L500 AbstractCegarLoop]: Abstraction has has 535 places, 1136 transitions, 9974 flow [2023-12-09 15:06:52,656 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 226.69230769230768) internal successors, (5894), 26 states have internal predecessors, (5894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:52,656 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:06:52,657 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:06:52,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:06:52,657 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:06:52,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:06:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2019234090, now seen corresponding path program 1 times [2023-12-09 15:06:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:06:52,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995218538] [2023-12-09 15:06:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:06:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:06:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:06:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:06:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995218538] [2023-12-09 15:06:52,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995218538] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:06:52,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203147020] [2023-12-09 15:06:52,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:06:52,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:06:52,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:06:52,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:06:52,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:06:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:06:53,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-09 15:06:53,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:06:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:53,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:06:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203147020] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:06:53,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:06:53,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 26 [2023-12-09 15:06:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409624996] [2023-12-09 15:06:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:06:53,665 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-09 15:06:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:06:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-09 15:06:53,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2023-12-09 15:06:53,667 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 366 [2023-12-09 15:06:53,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 1136 transitions, 9974 flow. Second operand has 13 states, 13 states have (on average 236.3846153846154) internal successors, (3073), 13 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:53,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:06:53,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 366 [2023-12-09 15:06:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:06:57,937 INFO L124 PetriNetUnfolderBase]: 3405/25393 cut-off events. [2023-12-09 15:06:57,937 INFO L125 PetriNetUnfolderBase]: For 14894/35906 co-relation queries the response was YES. [2023-12-09 15:06:58,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50991 conditions, 25393 events. 3405/25393 cut-off events. For 14894/35906 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 350178 event pairs, 1011 based on Foata normal form. 15/22331 useless extension candidates. Maximal degree in co-relation 10898. Up to 3325 conditions per place. [2023-12-09 15:06:58,289 INFO L140 encePairwiseOnDemand]: 332/366 looper letters, 735 selfloop transitions, 46 changer transitions 171/1213 dead transitions. [2023-12-09 15:06:58,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 1213 transitions, 12679 flow [2023-12-09 15:06:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-09 15:06:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-09 15:06:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5092 transitions. [2023-12-09 15:06:58,296 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6625032526671871 [2023-12-09 15:06:58,297 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5092 transitions. [2023-12-09 15:06:58,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5092 transitions. [2023-12-09 15:06:58,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:06:58,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5092 transitions. [2023-12-09 15:06:58,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 242.47619047619048) internal successors, (5092), 21 states have internal predecessors, (5092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:58,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 366.0) internal successors, (8052), 22 states have internal predecessors, (8052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:58,309 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 366.0) internal successors, (8052), 22 states have internal predecessors, (8052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:58,309 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 222 predicate places. [2023-12-09 15:06:58,309 INFO L500 AbstractCegarLoop]: Abstraction has has 555 places, 1213 transitions, 12679 flow [2023-12-09 15:06:58,310 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 236.3846153846154) internal successors, (3073), 13 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:58,310 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:06:58,310 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:06:58,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:06:58,514 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:06:58,517 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:06:58,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:06:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash 969651943, now seen corresponding path program 1 times [2023-12-09 15:06:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:06:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274008191] [2023-12-09 15:06:58,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:06:58,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:06:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:06:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:58,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:06:58,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274008191] [2023-12-09 15:06:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274008191] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:06:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140234057] [2023-12-09 15:06:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:06:58,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:06:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:06:58,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:06:58,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:06:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:06:58,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-09 15:06:58,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:06:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:59,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:06:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:06:59,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140234057] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:06:59,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:06:59,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 26 [2023-12-09 15:06:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794172542] [2023-12-09 15:06:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:06:59,518 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-09 15:06:59,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:06:59,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-09 15:06:59,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2023-12-09 15:06:59,520 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 366 [2023-12-09 15:06:59,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 1213 transitions, 12679 flow. Second operand has 13 states, 13 states have (on average 236.3846153846154) internal successors, (3073), 13 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:06:59,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:06:59,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 366 [2023-12-09 15:06:59,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:07:03,688 INFO L124 PetriNetUnfolderBase]: 3407/25511 cut-off events. [2023-12-09 15:07:03,688 INFO L125 PetriNetUnfolderBase]: For 19986/47205 co-relation queries the response was YES. [2023-12-09 15:07:03,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55018 conditions, 25511 events. 3407/25511 cut-off events. For 19986/47205 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 351626 event pairs, 1028 based on Foata normal form. 18/22445 useless extension candidates. Maximal degree in co-relation 8966. Up to 3253 conditions per place. [2023-12-09 15:07:03,973 INFO L140 encePairwiseOnDemand]: 329/366 looper letters, 644 selfloop transitions, 53 changer transitions 174/1132 dead transitions. [2023-12-09 15:07:03,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 1132 transitions, 13449 flow [2023-12-09 15:07:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-09 15:07:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-12-09 15:07:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 5321 transitions. [2023-12-09 15:07:03,985 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.660829607550919 [2023-12-09 15:07:03,985 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 5321 transitions. [2023-12-09 15:07:03,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 5321 transitions. [2023-12-09 15:07:03,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:07:03,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 5321 transitions. [2023-12-09 15:07:03,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 241.86363636363637) internal successors, (5321), 22 states have internal predecessors, (5321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:03,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 366.0) internal successors, (8418), 23 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:03,997 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 366.0) internal successors, (8418), 23 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:03,997 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 243 predicate places. [2023-12-09 15:07:03,997 INFO L500 AbstractCegarLoop]: Abstraction has has 576 places, 1132 transitions, 13449 flow [2023-12-09 15:07:03,998 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 236.3846153846154) internal successors, (3073), 13 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:03,998 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:07:03,998 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:07:04,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:07:04,202 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-09 15:07:04,204 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:07:04,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:07:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash 634437382, now seen corresponding path program 1 times [2023-12-09 15:07:04,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:07:04,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662560541] [2023-12-09 15:07:04,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:07:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:04,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:07:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662560541] [2023-12-09 15:07:04,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662560541] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149187245] [2023-12-09 15:07:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:04,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:07:04,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:07:04,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:07:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:05,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-09 15:07:05,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:07:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:05,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:07:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149187245] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:06,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:07:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19, 18] total 36 [2023-12-09 15:07:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770324501] [2023-12-09 15:07:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:07:06,558 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 15:07:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:07:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 15:07:06,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2023-12-09 15:07:06,561 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 366 [2023-12-09 15:07:06,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 1132 transitions, 13449 flow. Second operand has 18 states, 18 states have (on average 230.5) internal successors, (4149), 18 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:06,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:07:06,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 366 [2023-12-09 15:07:06,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:07:11,380 INFO L124 PetriNetUnfolderBase]: 3504/26139 cut-off events. [2023-12-09 15:07:11,380 INFO L125 PetriNetUnfolderBase]: For 27180/66141 co-relation queries the response was YES. [2023-12-09 15:07:11,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61648 conditions, 26139 events. 3504/26139 cut-off events. For 27180/66141 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 361600 event pairs, 831 based on Foata normal form. 11/22947 useless extension candidates. Maximal degree in co-relation 12782. Up to 3398 conditions per place. [2023-12-09 15:07:11,606 INFO L140 encePairwiseOnDemand]: 321/366 looper letters, 702 selfloop transitions, 63 changer transitions 185/1179 dead transitions. [2023-12-09 15:07:11,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 1179 transitions, 16013 flow [2023-12-09 15:07:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-09 15:07:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-12-09 15:07:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 8232 transitions. [2023-12-09 15:07:11,611 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6426229508196721 [2023-12-09 15:07:11,611 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 8232 transitions. [2023-12-09 15:07:11,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 8232 transitions. [2023-12-09 15:07:11,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:07:11,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 8232 transitions. [2023-12-09 15:07:11,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 235.2) internal successors, (8232), 35 states have internal predecessors, (8232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:11,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 366.0) internal successors, (13176), 36 states have internal predecessors, (13176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:11,626 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 366.0) internal successors, (13176), 36 states have internal predecessors, (13176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:11,626 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 277 predicate places. [2023-12-09 15:07:11,626 INFO L500 AbstractCegarLoop]: Abstraction has has 610 places, 1179 transitions, 16013 flow [2023-12-09 15:07:11,627 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 230.5) internal successors, (4149), 18 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:11,627 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:07:11,627 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:07:11,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:07:11,831 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:11,832 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:07:11,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:07:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash 673739316, now seen corresponding path program 2 times [2023-12-09 15:07:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:07:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365869792] [2023-12-09 15:07:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:07:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:12,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:07:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365869792] [2023-12-09 15:07:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365869792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366506939] [2023-12-09 15:07:12,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:07:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:07:12,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:07:12,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:07:12,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-09 15:07:12,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:07:12,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-09 15:07:12,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:07:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:07:13,184 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:07:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366506939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:07:13,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:07:13,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [19] total 32 [2023-12-09 15:07:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460905220] [2023-12-09 15:07:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:07:13,185 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-09 15:07:13,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:07:13,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-09 15:07:13,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2023-12-09 15:07:13,188 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 366 [2023-12-09 15:07:13,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 1179 transitions, 16013 flow. Second operand has 23 states, 23 states have (on average 227.34782608695653) internal successors, (5229), 23 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:13,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:07:13,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 366 [2023-12-09 15:07:13,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:07:19,372 INFO L124 PetriNetUnfolderBase]: 3914/29580 cut-off events. [2023-12-09 15:07:19,372 INFO L125 PetriNetUnfolderBase]: For 43971/120677 co-relation queries the response was YES. [2023-12-09 15:07:19,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76062 conditions, 29580 events. 3914/29580 cut-off events. For 43971/120677 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 417177 event pairs, 656 based on Foata normal form. 92/26006 useless extension candidates. Maximal degree in co-relation 16256. Up to 4004 conditions per place. [2023-12-09 15:07:19,672 INFO L140 encePairwiseOnDemand]: 309/366 looper letters, 731 selfloop transitions, 186 changer transitions 238/1365 dead transitions. [2023-12-09 15:07:19,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 1365 transitions, 21315 flow [2023-12-09 15:07:19,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-09 15:07:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-12-09 15:07:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 11735 transitions. [2023-12-09 15:07:19,679 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6286831672559734 [2023-12-09 15:07:19,679 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 11735 transitions. [2023-12-09 15:07:19,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 11735 transitions. [2023-12-09 15:07:19,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:07:19,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 11735 transitions. [2023-12-09 15:07:19,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 230.09803921568627) internal successors, (11735), 51 states have internal predecessors, (11735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:19,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 366.0) internal successors, (19032), 52 states have internal predecessors, (19032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:19,700 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 366.0) internal successors, (19032), 52 states have internal predecessors, (19032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:19,700 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 327 predicate places. [2023-12-09 15:07:19,700 INFO L500 AbstractCegarLoop]: Abstraction has has 660 places, 1365 transitions, 21315 flow [2023-12-09 15:07:19,701 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 227.34782608695653) internal successors, (5229), 23 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:19,701 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:07:19,701 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:07:19,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-09 15:07:19,905 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:19,906 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:07:19,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:07:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1731996728, now seen corresponding path program 3 times [2023-12-09 15:07:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:07:19,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292328557] [2023-12-09 15:07:19,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:07:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:07:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292328557] [2023-12-09 15:07:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292328557] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122381929] [2023-12-09 15:07:20,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:07:20,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:20,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:07:20,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:07:20,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:07:20,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-09 15:07:20,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:07:20,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-09 15:07:20,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:07:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:07:21,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:07:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122381929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:07:21,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:07:21,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [19] total 32 [2023-12-09 15:07:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049605690] [2023-12-09 15:07:21,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:07:21,210 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-09 15:07:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:07:21,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-09 15:07:21,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2023-12-09 15:07:21,214 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 366 [2023-12-09 15:07:21,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 1365 transitions, 21315 flow. Second operand has 23 states, 23 states have (on average 227.34782608695653) internal successors, (5229), 23 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:21,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:07:21,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 366 [2023-12-09 15:07:21,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:07:27,891 INFO L124 PetriNetUnfolderBase]: 4023/29902 cut-off events. [2023-12-09 15:07:27,892 INFO L125 PetriNetUnfolderBase]: For 60471/149191 co-relation queries the response was YES. [2023-12-09 15:07:28,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84171 conditions, 29902 events. 4023/29902 cut-off events. For 60471/149191 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 426067 event pairs, 798 based on Foata normal form. 151/26336 useless extension candidates. Maximal degree in co-relation 14649. Up to 4171 conditions per place. [2023-12-09 15:07:28,395 INFO L140 encePairwiseOnDemand]: 309/366 looper letters, 776 selfloop transitions, 229 changer transitions 261/1476 dead transitions. [2023-12-09 15:07:28,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 1476 transitions, 25860 flow [2023-12-09 15:07:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-09 15:07:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-12-09 15:07:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 11734 transitions. [2023-12-09 15:07:28,407 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6286295939140684 [2023-12-09 15:07:28,407 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 11734 transitions. [2023-12-09 15:07:28,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 11734 transitions. [2023-12-09 15:07:28,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:07:28,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 11734 transitions. [2023-12-09 15:07:28,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 230.07843137254903) internal successors, (11734), 51 states have internal predecessors, (11734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:28,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 366.0) internal successors, (19032), 52 states have internal predecessors, (19032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:28,442 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 366.0) internal successors, (19032), 52 states have internal predecessors, (19032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:28,443 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 377 predicate places. [2023-12-09 15:07:28,443 INFO L500 AbstractCegarLoop]: Abstraction has has 710 places, 1476 transitions, 25860 flow [2023-12-09 15:07:28,444 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 227.34782608695653) internal successors, (5229), 23 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:28,444 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:07:28,444 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:07:28,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 15:07:28,649 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:28,650 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:07:28,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:07:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1152876938, now seen corresponding path program 4 times [2023-12-09 15:07:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:07:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064585691] [2023-12-09 15:07:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:07:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:07:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064585691] [2023-12-09 15:07:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064585691] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643254988] [2023-12-09 15:07:29,124 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:07:29,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:29,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:07:29,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:07:29,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 15:07:29,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:07:29,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:07:29,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-09 15:07:29,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:07:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:29,679 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:07:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643254988] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:07:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19, 18] total 36 [2023-12-09 15:07:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676313246] [2023-12-09 15:07:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:07:30,639 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 15:07:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:07:30,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 15:07:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2023-12-09 15:07:30,641 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 366 [2023-12-09 15:07:30,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 1476 transitions, 25860 flow. Second operand has 18 states, 18 states have (on average 230.5) internal successors, (4149), 18 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:30,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:07:30,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 366 [2023-12-09 15:07:30,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:07:37,628 INFO L124 PetriNetUnfolderBase]: 4028/30281 cut-off events. [2023-12-09 15:07:37,629 INFO L125 PetriNetUnfolderBase]: For 73182/178525 co-relation queries the response was YES. [2023-12-09 15:07:37,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90332 conditions, 30281 events. 4028/30281 cut-off events. For 73182/178525 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 430843 event pairs, 768 based on Foata normal form. 54/26586 useless extension candidates. Maximal degree in co-relation 15810. Up to 4165 conditions per place. [2023-12-09 15:07:38,100 INFO L140 encePairwiseOnDemand]: 321/366 looper letters, 873 selfloop transitions, 79 changer transitions 280/1470 dead transitions. [2023-12-09 15:07:38,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 1470 transitions, 28204 flow [2023-12-09 15:07:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-09 15:07:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-12-09 15:07:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 8233 transitions. [2023-12-09 15:07:38,105 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6427010148321624 [2023-12-09 15:07:38,105 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 8233 transitions. [2023-12-09 15:07:38,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 8233 transitions. [2023-12-09 15:07:38,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:07:38,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 8233 transitions. [2023-12-09 15:07:38,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 235.22857142857143) internal successors, (8233), 35 states have internal predecessors, (8233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:38,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 366.0) internal successors, (13176), 36 states have internal predecessors, (13176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:38,123 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 366.0) internal successors, (13176), 36 states have internal predecessors, (13176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:38,123 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 411 predicate places. [2023-12-09 15:07:38,123 INFO L500 AbstractCegarLoop]: Abstraction has has 744 places, 1470 transitions, 28204 flow [2023-12-09 15:07:38,124 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 230.5) internal successors, (4149), 18 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:38,124 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:07:38,124 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:07:38,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-09 15:07:38,329 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:38,330 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:07:38,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:07:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash -498591741, now seen corresponding path program 1 times [2023-12-09 15:07:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:07:38,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450720025] [2023-12-09 15:07:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:07:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:38,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:07:38,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450720025] [2023-12-09 15:07:38,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450720025] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:38,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213096815] [2023-12-09 15:07:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:38,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:38,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:07:38,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:07:38,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 15:07:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:38,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-09 15:07:38,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:07:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:38,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:07:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:07:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213096815] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:07:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2023-12-09 15:07:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162181350] [2023-12-09 15:07:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:07:39,242 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:07:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:07:39,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:07:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-12-09 15:07:39,253 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 366 [2023-12-09 15:07:39,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 1470 transitions, 28204 flow. Second operand has 11 states, 11 states have (on average 279.27272727272725) internal successors, (3072), 11 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:39,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:07:39,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 366 [2023-12-09 15:07:39,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:07:50,051 INFO L124 PetriNetUnfolderBase]: 8024/50258 cut-off events. [2023-12-09 15:07:50,051 INFO L125 PetriNetUnfolderBase]: For 169879/308796 co-relation queries the response was YES. [2023-12-09 15:07:50,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157461 conditions, 50258 events. 8024/50258 cut-off events. For 169879/308796 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 776764 event pairs, 1935 based on Foata normal form. 31/44145 useless extension candidates. Maximal degree in co-relation 30449. Up to 6643 conditions per place. [2023-12-09 15:07:50,793 INFO L140 encePairwiseOnDemand]: 344/366 looper letters, 709 selfloop transitions, 66 changer transitions 284/1695 dead transitions. [2023-12-09 15:07:50,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 1695 transitions, 34581 flow [2023-12-09 15:07:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:07:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:07:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4589 transitions. [2023-12-09 15:07:50,796 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7836407103825137 [2023-12-09 15:07:50,796 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4589 transitions. [2023-12-09 15:07:50,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4589 transitions. [2023-12-09 15:07:50,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:07:50,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4589 transitions. [2023-12-09 15:07:50,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 286.8125) internal successors, (4589), 16 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:50,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 366.0) internal successors, (6222), 17 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:50,802 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 366.0) internal successors, (6222), 17 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:50,802 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 426 predicate places. [2023-12-09 15:07:50,803 INFO L500 AbstractCegarLoop]: Abstraction has has 759 places, 1695 transitions, 34581 flow [2023-12-09 15:07:50,803 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 279.27272727272725) internal successors, (3072), 11 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:50,803 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:07:50,803 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:07:50,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 15:07:51,008 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:51,009 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:07:51,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:07:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2126708491, now seen corresponding path program 1 times [2023-12-09 15:07:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:07:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261208165] [2023-12-09 15:07:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:07:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:07:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:07:51,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261208165] [2023-12-09 15:07:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261208165] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:51,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343768667] [2023-12-09 15:07:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:07:51,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:07:51,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:07:51,582 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:07:51,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-09 15:07:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:07:51,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-09 15:07:51,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:07:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:07:52,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:07:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:07:52,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343768667] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:07:52,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:07:52,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [20, 18] total 37 [2023-12-09 15:07:53,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592552407] [2023-12-09 15:07:53,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:07:53,000 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 15:07:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:07:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 15:07:53,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2023-12-09 15:07:53,003 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 366 [2023-12-09 15:07:53,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 1695 transitions, 34581 flow. Second operand has 18 states, 18 states have (on average 230.77777777777777) internal successors, (4154), 18 states have internal predecessors, (4154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:07:53,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:07:53,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 366 [2023-12-09 15:07:53,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:08:05,013 INFO L124 PetriNetUnfolderBase]: 9101/56567 cut-off events. [2023-12-09 15:08:05,013 INFO L125 PetriNetUnfolderBase]: For 230377/494424 co-relation queries the response was YES. [2023-12-09 15:08:05,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188743 conditions, 56567 events. 9101/56567 cut-off events. For 230377/494424 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 884438 event pairs, 1963 based on Foata normal form. 21/49738 useless extension candidates. Maximal degree in co-relation 37469. Up to 7690 conditions per place. [2023-12-09 15:08:06,119 INFO L140 encePairwiseOnDemand]: 324/366 looper letters, 1193 selfloop transitions, 65 changer transitions 297/1807 dead transitions. [2023-12-09 15:08:06,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 791 places, 1807 transitions, 40328 flow [2023-12-09 15:08:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-09 15:08:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-12-09 15:08:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 7782 transitions. [2023-12-09 15:08:06,134 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6443119721808246 [2023-12-09 15:08:06,134 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 7782 transitions. [2023-12-09 15:08:06,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 7782 transitions. [2023-12-09 15:08:06,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:08:06,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 7782 transitions. [2023-12-09 15:08:06,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 235.8181818181818) internal successors, (7782), 33 states have internal predecessors, (7782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:06,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 366.0) internal successors, (12444), 34 states have internal predecessors, (12444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:06,147 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 366.0) internal successors, (12444), 34 states have internal predecessors, (12444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:06,149 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 458 predicate places. [2023-12-09 15:08:06,149 INFO L500 AbstractCegarLoop]: Abstraction has has 791 places, 1807 transitions, 40328 flow [2023-12-09 15:08:06,149 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 230.77777777777777) internal successors, (4154), 18 states have internal predecessors, (4154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:06,150 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:08:06,156 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:08:06,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-09 15:08:06,365 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-09 15:08:06,366 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:08:06,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:08:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2007013355, now seen corresponding path program 2 times [2023-12-09 15:08:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:08:06,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953610980] [2023-12-09 15:08:06,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:08:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:08:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:08:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:08:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:08:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953610980] [2023-12-09 15:08:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953610980] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:08:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941835017] [2023-12-09 15:08:07,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:08:07,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:08:07,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:08:07,182 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:08:07,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-09 15:08:07,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-09 15:08:07,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:08:07,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-09 15:08:07,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:08:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-09 15:08:07,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:08:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941835017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:08:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:08:07,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 26 [2023-12-09 15:08:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805162272] [2023-12-09 15:08:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:08:07,545 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:08:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:08:07,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:08:07,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2023-12-09 15:08:07,547 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 366 [2023-12-09 15:08:07,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 791 places, 1807 transitions, 40328 flow. Second operand has 10 states, 10 states have (on average 266.3) internal successors, (2663), 10 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:07,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:08:07,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 366 [2023-12-09 15:08:07,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:08:24,183 INFO L124 PetriNetUnfolderBase]: 11768/73940 cut-off events. [2023-12-09 15:08:24,183 INFO L125 PetriNetUnfolderBase]: For 369655/797310 co-relation queries the response was YES. [2023-12-09 15:08:25,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259956 conditions, 73940 events. 11768/73940 cut-off events. For 369655/797310 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 1208729 event pairs, 2248 based on Foata normal form. 340/65048 useless extension candidates. Maximal degree in co-relation 34857. Up to 8794 conditions per place. [2023-12-09 15:08:25,924 INFO L140 encePairwiseOnDemand]: 344/366 looper letters, 1470 selfloop transitions, 147 changer transitions 429/2396 dead transitions. [2023-12-09 15:08:25,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 2396 transitions, 59286 flow [2023-12-09 15:08:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:08:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:08:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4308 transitions. [2023-12-09 15:08:25,926 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.735655737704918 [2023-12-09 15:08:25,926 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4308 transitions. [2023-12-09 15:08:25,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4308 transitions. [2023-12-09 15:08:25,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:08:25,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4308 transitions. [2023-12-09 15:08:25,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 269.25) internal successors, (4308), 16 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:25,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 366.0) internal successors, (6222), 17 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:25,932 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 366.0) internal successors, (6222), 17 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:25,932 INFO L308 CegarLoopForPetriNet]: 333 programPoint places, 473 predicate places. [2023-12-09 15:08:25,932 INFO L500 AbstractCegarLoop]: Abstraction has has 806 places, 2396 transitions, 59286 flow [2023-12-09 15:08:25,933 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 266.3) internal successors, (2663), 10 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:25,933 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:08:25,933 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:08:25,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-09 15:08:26,137 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-09 15:08:26,138 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:08:26,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:08:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash -66258297, now seen corresponding path program 3 times [2023-12-09 15:08:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:08:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529199340] [2023-12-09 15:08:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:08:26,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:08:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:08:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:08:26,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:08:26,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529199340] [2023-12-09 15:08:26,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529199340] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:08:26,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128631] [2023-12-09 15:08:26,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:08:26,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:08:26,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:08:26,629 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:08:26,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-09 15:08:26,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:08:26,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:08:26,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-09 15:08:26,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:08:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:08:27,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:08:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:08:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128631] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:08:28,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:08:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 16] total 50 [2023-12-09 15:08:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343223149] [2023-12-09 15:08:28,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:08:28,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-09 15:08:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:08:28,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-09 15:08:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2248, Unknown=0, NotChecked=0, Total=2450 [2023-12-09 15:08:28,662 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 366 [2023-12-09 15:08:28,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 2396 transitions, 59286 flow. Second operand has 50 states, 50 states have (on average 218.64) internal successors, (10932), 50 states have internal predecessors, (10932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:08:28,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:08:28,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 366 [2023-12-09 15:08:28,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand