/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 20:28:01,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 20:28:01,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 20:28:01,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 20:28:01,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 20:28:01,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 20:28:01,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 20:28:01,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 20:28:01,592 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 20:28:01,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 20:28:01,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 20:28:01,596 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 20:28:01,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 20:28:01,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 20:28:01,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 20:28:01,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 20:28:01,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 20:28:01,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 20:28:01,597 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 20:28:01,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 20:28:01,598 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 20:28:01,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 20:28:01,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 20:28:01,598 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 20:28:01,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 20:28:01,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 20:28:01,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 20:28:01,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 20:28:01,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 20:28:01,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 20:28:01,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 20:28:01,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 20:28:01,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 20:28:01,601 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-11-29 20:28:01,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 20:28:01,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 20:28:01,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 20:28:01,807 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 20:28:01,807 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 20:28:01,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2023-11-29 20:28:02,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 20:28:02,948 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 20:28:02,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2023-11-29 20:28:02,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a690a34da/563f98677e434bfe8e090dae625d7e9c/FLAG32faefd33 [2023-11-29 20:28:02,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a690a34da/563f98677e434bfe8e090dae625d7e9c [2023-11-29 20:28:02,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 20:28:02,966 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 20:28:02,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 20:28:02,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 20:28:02,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 20:28:02,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:28:02" (1/1) ... [2023-11-29 20:28:02,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c241086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:02, skipping insertion in model container [2023-11-29 20:28:02,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:28:02" (1/1) ... [2023-11-29 20:28:02,987 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 20:28:03,095 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-trans.wvr.c[2767,2780] [2023-11-29 20:28:03,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 20:28:03,109 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 20:28:03,126 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-trans.wvr.c[2767,2780] [2023-11-29 20:28:03,129 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 20:28:03,139 INFO L206 MainTranslator]: Completed translation [2023-11-29 20:28:03,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03 WrapperNode [2023-11-29 20:28:03,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 20:28:03,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 20:28:03,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 20:28:03,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 20:28:03,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,174 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 288 [2023-11-29 20:28:03,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 20:28:03,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 20:28:03,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 20:28:03,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 20:28:03,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 20:28:03,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 20:28:03,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 20:28:03,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 20:28:03,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (1/1) ... [2023-11-29 20:28:03,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 20:28:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:28:03,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 20:28:03,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 20:28:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 20:28:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 20:28:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 20:28:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 20:28:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 20:28:03,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 20:28:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 20:28:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 20:28:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 20:28:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 20:28:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 20:28:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 20:28:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 20:28:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 20:28:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 20:28:03,283 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 20:28:03,399 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 20:28:03,400 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 20:28:03,785 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 20:28:03,803 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 20:28:03,804 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 20:28:03,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:28:03 BoogieIcfgContainer [2023-11-29 20:28:03,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 20:28:03,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 20:28:03,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 20:28:03,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 20:28:03,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:28:02" (1/3) ... [2023-11-29 20:28:03,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab0c463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:28:03, skipping insertion in model container [2023-11-29 20:28:03,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:28:03" (2/3) ... [2023-11-29 20:28:03,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab0c463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:28:03, skipping insertion in model container [2023-11-29 20:28:03,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:28:03" (3/3) ... [2023-11-29 20:28:03,813 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2023-11-29 20:28:03,825 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 20:28:03,826 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 20:28:03,826 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 20:28:03,913 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 20:28:03,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 358 transitions, 737 flow [2023-11-29 20:28:04,069 INFO L124 PetriNetUnfolderBase]: 28/355 cut-off events. [2023-11-29 20:28:04,069 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 20:28:04,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 355 events. 28/355 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/326 useless extension candidates. Maximal degree in co-relation 276. Up to 3 conditions per place. [2023-11-29 20:28:04,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 340 places, 358 transitions, 737 flow [2023-11-29 20:28:04,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 344 transitions, 706 flow [2023-11-29 20:28:04,100 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 20:28:04,106 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;@14eb37f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 20:28:04,106 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 20:28:04,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 20:28:04,160 INFO L124 PetriNetUnfolderBase]: 28/343 cut-off events. [2023-11-29 20:28:04,160 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 20:28:04,161 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:04,161 INFO L232 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] [2023-11-29 20:28:04,162 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-11-29 20:28:04,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash -871495324, now seen corresponding path program 1 times [2023-11-29 20:28:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424804361] [2023-11-29 20:28:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:28:05,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424804361] [2023-11-29 20:28:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424804361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:28:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:28:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 20:28:05,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715749929] [2023-11-29 20:28:05,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:05,060 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 20:28:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 20:28:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-11-29 20:28:05,091 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 358 [2023-11-29 20:28:05,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 344 transitions, 706 flow. Second operand has 14 states, 14 states have (on average 235.14285714285714) internal successors, (3292), 14 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:05,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:05,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 358 [2023-11-29 20:28:05,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:06,160 INFO L124 PetriNetUnfolderBase]: 497/4014 cut-off events. [2023-11-29 20:28:06,161 INFO L125 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2023-11-29 20:28:06,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 4014 events. 497/4014 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 39077 event pairs, 147 based on Foata normal form. 217/3814 useless extension candidates. Maximal degree in co-relation 2470. Up to 267 conditions per place. [2023-11-29 20:28:06,184 INFO L140 encePairwiseOnDemand]: 308/358 looper letters, 175 selfloop transitions, 23 changer transitions 19/433 dead transitions. [2023-11-29 20:28:06,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 433 transitions, 1357 flow [2023-11-29 20:28:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 20:28:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-29 20:28:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 6450 transitions. [2023-11-29 20:28:06,205 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6672873991309746 [2023-11-29 20:28:06,205 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 6450 transitions. [2023-11-29 20:28:06,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 6450 transitions. [2023-11-29 20:28:06,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:06,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 6450 transitions. [2023-11-29 20:28:06,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 238.88888888888889) internal successors, (6450), 27 states have internal predecessors, (6450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:06,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 358.0) internal successors, (10024), 28 states have internal predecessors, (10024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:06,245 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 358.0) internal successors, (10024), 28 states have internal predecessors, (10024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:06,248 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 26 predicate places. [2023-11-29 20:28:06,248 INFO L500 AbstractCegarLoop]: Abstraction has has 352 places, 433 transitions, 1357 flow [2023-11-29 20:28:06,251 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 235.14285714285714) internal successors, (3292), 14 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:06,251 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:06,252 INFO L232 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] [2023-11-29 20:28:06,252 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 20:28:06,252 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-11-29 20:28:06,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1210752103, now seen corresponding path program 1 times [2023-11-29 20:28:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668857591] [2023-11-29 20:28:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:06,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:28:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668857591] [2023-11-29 20:28:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668857591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:06,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175487620] [2023-11-29 20:28:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:06,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:28:06,738 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-11-29 20:28:06,768 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-11-29 20:28:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:06,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 20:28:06,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:28:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:28:07,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:28:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:28:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175487620] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:07,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 20:28:07,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 26 [2023-11-29 20:28:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256546908] [2023-11-29 20:28:07,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:07,450 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 20:28:07,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:07,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 20:28:07,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2023-11-29 20:28:07,454 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 358 [2023-11-29 20:28:07,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 433 transitions, 1357 flow. Second operand has 13 states, 13 states have (on average 235.92307692307693) internal successors, (3067), 13 states have internal predecessors, (3067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:07,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 358 [2023-11-29 20:28:07,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:08,589 INFO L124 PetriNetUnfolderBase]: 855/6437 cut-off events. [2023-11-29 20:28:08,590 INFO L125 PetriNetUnfolderBase]: For 867/1041 co-relation queries the response was YES. [2023-11-29 20:28:08,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9180 conditions, 6437 events. 855/6437 cut-off events. For 867/1041 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 66997 event pairs, 222 based on Foata normal form. 0/5733 useless extension candidates. Maximal degree in co-relation 2997. Up to 609 conditions per place. [2023-11-29 20:28:08,623 INFO L140 encePairwiseOnDemand]: 325/358 looper letters, 213 selfloop transitions, 31 changer transitions 25/486 dead transitions. [2023-11-29 20:28:08,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 486 transitions, 2136 flow [2023-11-29 20:28:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 20:28:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 20:28:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5042 transitions. [2023-11-29 20:28:08,630 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6706570896515031 [2023-11-29 20:28:08,630 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5042 transitions. [2023-11-29 20:28:08,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5042 transitions. [2023-11-29 20:28:08,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:08,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5042 transitions. [2023-11-29 20:28:08,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 240.0952380952381) internal successors, (5042), 21 states have internal predecessors, (5042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:08,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 358.0) internal successors, (7876), 22 states have internal predecessors, (7876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:08,646 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 358.0) internal successors, (7876), 22 states have internal predecessors, (7876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:08,647 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 46 predicate places. [2023-11-29 20:28:08,647 INFO L500 AbstractCegarLoop]: Abstraction has has 372 places, 486 transitions, 2136 flow [2023-11-29 20:28:08,648 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 235.92307692307693) internal successors, (3067), 13 states have internal predecessors, (3067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:08,648 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:08,648 INFO L232 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] [2023-11-29 20:28:08,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 20:28:08,852 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:08,853 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-11-29 20:28:08,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1075783601, now seen corresponding path program 1 times [2023-11-29 20:28:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051321671] [2023-11-29 20:28:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:08,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:28:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051321671] [2023-11-29 20:28:09,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051321671] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817278162] [2023-11-29 20:28:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:28:09,061 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-11-29 20:28:09,064 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-11-29 20:28:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:09,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 20:28:09,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:28:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:28:09,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:28:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:28:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817278162] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:09,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 20:28:09,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2023-11-29 20:28:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964890313] [2023-11-29 20:28:09,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:09,667 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 20:28:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 20:28:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-11-29 20:28:09,673 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 358 [2023-11-29 20:28:09,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 486 transitions, 2136 flow. Second operand has 11 states, 11 states have (on average 272.27272727272725) internal successors, (2995), 11 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:09,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:09,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 358 [2023-11-29 20:28:09,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:10,831 INFO L124 PetriNetUnfolderBase]: 1643/8305 cut-off events. [2023-11-29 20:28:10,831 INFO L125 PetriNetUnfolderBase]: For 4468/5152 co-relation queries the response was YES. [2023-11-29 20:28:10,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15427 conditions, 8305 events. 1643/8305 cut-off events. For 4468/5152 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 86390 event pairs, 313 based on Foata normal form. 2/7286 useless extension candidates. Maximal degree in co-relation 5291. Up to 1086 conditions per place. [2023-11-29 20:28:10,911 INFO L140 encePairwiseOnDemand]: 336/358 looper letters, 208 selfloop transitions, 33 changer transitions 28/551 dead transitions. [2023-11-29 20:28:10,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 551 transitions, 3005 flow [2023-11-29 20:28:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 20:28:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 20:28:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4456 transitions. [2023-11-29 20:28:10,917 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7779329608938548 [2023-11-29 20:28:10,917 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4456 transitions. [2023-11-29 20:28:10,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4456 transitions. [2023-11-29 20:28:10,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:10,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4456 transitions. [2023-11-29 20:28:10,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 278.5) internal successors, (4456), 16 states have internal predecessors, (4456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:10,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 358.0) internal successors, (6086), 17 states have internal predecessors, (6086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:10,931 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 358.0) internal successors, (6086), 17 states have internal predecessors, (6086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:10,932 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 61 predicate places. [2023-11-29 20:28:10,932 INFO L500 AbstractCegarLoop]: Abstraction has has 387 places, 551 transitions, 3005 flow [2023-11-29 20:28:10,933 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 272.27272727272725) internal successors, (2995), 11 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:10,933 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:10,933 INFO L232 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] [2023-11-29 20:28:10,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 20:28:11,137 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,SelfDestructingSolverStorable2 [2023-11-29 20:28:11,138 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-11-29 20:28:11,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash 807559837, now seen corresponding path program 1 times [2023-11-29 20:28:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995836687] [2023-11-29 20:28:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:11,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:11,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995836687] [2023-11-29 20:28:11,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995836687] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:11,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356415713] [2023-11-29 20:28:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:11,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:11,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:28:11,574 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-11-29 20:28:11,600 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-11-29 20:28:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:11,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 20:28:11,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:28:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:11,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:28:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:12,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356415713] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:12,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 20:28:12,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 28 [2023-11-29 20:28:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727932578] [2023-11-29 20:28:12,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:12,154 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 20:28:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 20:28:12,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2023-11-29 20:28:12,158 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 358 [2023-11-29 20:28:12,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 551 transitions, 3005 flow. Second operand has 13 states, 13 states have (on average 236.30769230769232) internal successors, (3072), 13 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-11-29 20:28:12,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:12,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 358 [2023-11-29 20:28:12,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:15,511 INFO L124 PetriNetUnfolderBase]: 4737/25168 cut-off events. [2023-11-29 20:28:15,511 INFO L125 PetriNetUnfolderBase]: For 22478/24500 co-relation queries the response was YES. [2023-11-29 20:28:15,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50393 conditions, 25168 events. 4737/25168 cut-off events. For 22478/24500 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 328225 event pairs, 673 based on Foata normal form. 5/22065 useless extension candidates. Maximal degree in co-relation 7391. Up to 2718 conditions per place. [2023-11-29 20:28:15,731 INFO L140 encePairwiseOnDemand]: 321/358 looper letters, 593 selfloop transitions, 87 changer transitions 92/1005 dead transitions. [2023-11-29 20:28:15,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1005 transitions, 8347 flow [2023-11-29 20:28:15,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 20:28:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-29 20:28:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5948 transitions. [2023-11-29 20:28:15,740 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6645810055865922 [2023-11-29 20:28:15,740 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5948 transitions. [2023-11-29 20:28:15,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5948 transitions. [2023-11-29 20:28:15,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:15,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5948 transitions. [2023-11-29 20:28:15,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 237.92) internal successors, (5948), 25 states have internal predecessors, (5948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:15,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 358.0) internal successors, (9308), 26 states have internal predecessors, (9308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:15,763 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 358.0) internal successors, (9308), 26 states have internal predecessors, (9308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:15,763 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 85 predicate places. [2023-11-29 20:28:15,763 INFO L500 AbstractCegarLoop]: Abstraction has has 411 places, 1005 transitions, 8347 flow [2023-11-29 20:28:15,764 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 236.30769230769232) internal successors, (3072), 13 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-11-29 20:28:15,764 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:15,764 INFO L232 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, 1, 1] [2023-11-29 20:28:15,783 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-11-29 20:28:15,969 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:15,969 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-11-29 20:28:15,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1124179107, now seen corresponding path program 1 times [2023-11-29 20:28:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143394614] [2023-11-29 20:28:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143394614] [2023-11-29 20:28:16,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143394614] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600841595] [2023-11-29 20:28:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:16,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:16,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:28:16,317 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-11-29 20:28:16,368 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-11-29 20:28:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:16,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 20:28:16,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:28:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:16,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:28:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600841595] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:17,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 20:28:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2023-11-29 20:28:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582863436] [2023-11-29 20:28:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:17,224 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 20:28:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:17,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 20:28:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-11-29 20:28:17,226 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 358 [2023-11-29 20:28:17,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 1005 transitions, 8347 flow. Second operand has 11 states, 11 states have (on average 272.72727272727275) internal successors, (3000), 11 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:17,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:17,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 358 [2023-11-29 20:28:17,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:23,593 INFO L124 PetriNetUnfolderBase]: 9229/48643 cut-off events. [2023-11-29 20:28:23,593 INFO L125 PetriNetUnfolderBase]: For 63647/68413 co-relation queries the response was YES. [2023-11-29 20:28:23,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104031 conditions, 48643 events. 9229/48643 cut-off events. For 63647/68413 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 709025 event pairs, 1933 based on Foata normal form. 179/43005 useless extension candidates. Maximal degree in co-relation 14983. Up to 5074 conditions per place. [2023-11-29 20:28:24,019 INFO L140 encePairwiseOnDemand]: 336/358 looper letters, 726 selfloop transitions, 71 changer transitions 99/1238 dead transitions. [2023-11-29 20:28:24,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 1238 transitions, 12476 flow [2023-11-29 20:28:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 20:28:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 20:28:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4477 transitions. [2023-11-29 20:28:24,028 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7815991620111732 [2023-11-29 20:28:24,028 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4477 transitions. [2023-11-29 20:28:24,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4477 transitions. [2023-11-29 20:28:24,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:24,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4477 transitions. [2023-11-29 20:28:24,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 279.8125) internal successors, (4477), 16 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:24,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 358.0) internal successors, (6086), 17 states have internal predecessors, (6086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:24,044 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 358.0) internal successors, (6086), 17 states have internal predecessors, (6086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:24,046 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 100 predicate places. [2023-11-29 20:28:24,046 INFO L500 AbstractCegarLoop]: Abstraction has has 426 places, 1238 transitions, 12476 flow [2023-11-29 20:28:24,047 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 272.72727272727275) internal successors, (3000), 11 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:24,047 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:24,047 INFO L232 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, 1, 1] [2023-11-29 20:28:24,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 20:28:24,252 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:24,252 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-11-29 20:28:24,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:24,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1386769392, now seen corresponding path program 1 times [2023-11-29 20:28:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752889875] [2023-11-29 20:28:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:24,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 20:28:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752889875] [2023-11-29 20:28:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752889875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:28:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:28:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 20:28:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960808032] [2023-11-29 20:28:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:24,378 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 20:28:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 20:28:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 20:28:24,380 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 358 [2023-11-29 20:28:24,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1238 transitions, 12476 flow. Second operand has 7 states, 7 states have (on average 279.14285714285717) internal successors, (1954), 7 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:24,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:24,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 358 [2023-11-29 20:28:24,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:28,931 INFO L124 PetriNetUnfolderBase]: 6775/34872 cut-off events. [2023-11-29 20:28:28,932 INFO L125 PetriNetUnfolderBase]: For 62639/71006 co-relation queries the response was YES. [2023-11-29 20:28:29,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81304 conditions, 34872 events. 6775/34872 cut-off events. For 62639/71006 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 472398 event pairs, 1519 based on Foata normal form. 82/30833 useless extension candidates. Maximal degree in co-relation 14754. Up to 5016 conditions per place. [2023-11-29 20:28:29,169 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 399 selfloop transitions, 8 changer transitions 283/1103 dead transitions. [2023-11-29 20:28:29,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 1103 transitions, 12077 flow [2023-11-29 20:28:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 20:28:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 20:28:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2842 transitions. [2023-11-29 20:28:29,171 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7938547486033519 [2023-11-29 20:28:29,171 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2842 transitions. [2023-11-29 20:28:29,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2842 transitions. [2023-11-29 20:28:29,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:29,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2842 transitions. [2023-11-29 20:28:29,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 284.2) internal successors, (2842), 10 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:29,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:29,178 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:29,178 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 106 predicate places. [2023-11-29 20:28:29,178 INFO L500 AbstractCegarLoop]: Abstraction has has 432 places, 1103 transitions, 12077 flow [2023-11-29 20:28:29,179 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 279.14285714285717) internal successors, (1954), 7 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:29,179 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:29,179 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:28:29,179 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 20:28:29,179 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-11-29 20:28:29,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2082155949, now seen corresponding path program 1 times [2023-11-29 20:28:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:29,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902657421] [2023-11-29 20:28:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 20:28:29,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902657421] [2023-11-29 20:28:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902657421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:28:29,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:28:29,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 20:28:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243026678] [2023-11-29 20:28:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:29,301 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 20:28:29,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:29,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 20:28:29,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 20:28:29,302 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 358 [2023-11-29 20:28:29,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 1103 transitions, 12077 flow. Second operand has 7 states, 7 states have (on average 279.7142857142857) internal successors, (1958), 7 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:29,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:29,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 358 [2023-11-29 20:28:29,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:32,849 INFO L124 PetriNetUnfolderBase]: 5188/25562 cut-off events. [2023-11-29 20:28:32,849 INFO L125 PetriNetUnfolderBase]: For 59222/67029 co-relation queries the response was YES. [2023-11-29 20:28:33,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68980 conditions, 25562 events. 5188/25562 cut-off events. For 59222/67029 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 325314 event pairs, 1010 based on Foata normal form. 76/22755 useless extension candidates. Maximal degree in co-relation 15842. Up to 4321 conditions per place. [2023-11-29 20:28:33,161 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 222 selfloop transitions, 14 changer transitions 503/1040 dead transitions. [2023-11-29 20:28:33,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 1040 transitions, 12588 flow [2023-11-29 20:28:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 20:28:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 20:28:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2812 transitions. [2023-11-29 20:28:33,164 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7854748603351955 [2023-11-29 20:28:33,164 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2812 transitions. [2023-11-29 20:28:33,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2812 transitions. [2023-11-29 20:28:33,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:33,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2812 transitions. [2023-11-29 20:28:33,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 281.2) internal successors, (2812), 10 states have internal predecessors, (2812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:33,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:33,170 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:33,171 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 113 predicate places. [2023-11-29 20:28:33,171 INFO L500 AbstractCegarLoop]: Abstraction has has 439 places, 1040 transitions, 12588 flow [2023-11-29 20:28:33,171 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 279.7142857142857) internal successors, (1958), 7 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:33,171 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:33,172 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:28:33,172 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 20:28:33,172 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-11-29 20:28:33,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1469174215, now seen corresponding path program 1 times [2023-11-29 20:28:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487019617] [2023-11-29 20:28:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:33,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487019617] [2023-11-29 20:28:33,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487019617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573400302] [2023-11-29 20:28:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:33,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:33,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:28:33,340 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-11-29 20:28:33,343 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-11-29 20:28:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:33,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 20:28:33,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:28:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:33,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:28:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 20:28:34,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573400302] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:34,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 20:28:34,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 23 [2023-11-29 20:28:34,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53474336] [2023-11-29 20:28:34,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:34,023 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 20:28:34,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:34,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 20:28:34,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2023-11-29 20:28:34,025 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 358 [2023-11-29 20:28:34,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1040 transitions, 12588 flow. Second operand has 11 states, 11 states have (on average 272.8181818181818) internal successors, (3001), 11 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:34,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:34,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 358 [2023-11-29 20:28:34,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:40,812 INFO L124 PetriNetUnfolderBase]: 10852/48233 cut-off events. [2023-11-29 20:28:40,812 INFO L125 PetriNetUnfolderBase]: For 205014/225700 co-relation queries the response was YES. [2023-11-29 20:28:41,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147642 conditions, 48233 events. 10852/48233 cut-off events. For 205014/225700 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 674462 event pairs, 3370 based on Foata normal form. 424/43422 useless extension candidates. Maximal degree in co-relation 35741. Up to 8413 conditions per place. [2023-11-29 20:28:41,129 INFO L140 encePairwiseOnDemand]: 336/358 looper letters, 346 selfloop transitions, 35 changer transitions 648/1300 dead transitions. [2023-11-29 20:28:41,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1300 transitions, 18594 flow [2023-11-29 20:28:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 20:28:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 20:28:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4442 transitions. [2023-11-29 20:28:41,133 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7754888268156425 [2023-11-29 20:28:41,133 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4442 transitions. [2023-11-29 20:28:41,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4442 transitions. [2023-11-29 20:28:41,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:41,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4442 transitions. [2023-11-29 20:28:41,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 277.625) internal successors, (4442), 16 states have internal predecessors, (4442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:41,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 358.0) internal successors, (6086), 17 states have internal predecessors, (6086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:41,143 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 358.0) internal successors, (6086), 17 states have internal predecessors, (6086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:41,143 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 128 predicate places. [2023-11-29 20:28:41,143 INFO L500 AbstractCegarLoop]: Abstraction has has 454 places, 1300 transitions, 18594 flow [2023-11-29 20:28:41,144 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 272.8181818181818) internal successors, (3001), 11 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:41,144 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:41,144 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:28:41,152 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-11-29 20:28:41,348 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:41,349 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-11-29 20:28:41,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1123822032, now seen corresponding path program 1 times [2023-11-29 20:28:41,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:41,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376279281] [2023-11-29 20:28:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 20:28:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376279281] [2023-11-29 20:28:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376279281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:28:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525741837] [2023-11-29 20:28:41,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:41,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:41,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:28:41,791 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-11-29 20:28:41,792 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-11-29 20:28:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:41,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 20:28:41,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:28:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 20:28:42,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:28:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 20:28:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525741837] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 20:28:42,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 20:28:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 31 [2023-11-29 20:28:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171505633] [2023-11-29 20:28:42,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 20:28:42,573 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 20:28:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:42,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 20:28:42,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2023-11-29 20:28:42,578 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 358 [2023-11-29 20:28:42,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 1300 transitions, 18594 flow. Second operand has 31 states, 31 states have (on average 232.70967741935485) internal successors, (7214), 31 states have internal predecessors, (7214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:42,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:42,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 358 [2023-11-29 20:28:42,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:28:56,478 INFO L124 PetriNetUnfolderBase]: 18954/85766 cut-off events. [2023-11-29 20:28:56,478 INFO L125 PetriNetUnfolderBase]: For 461830/498324 co-relation queries the response was YES. [2023-11-29 20:28:56,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277557 conditions, 85766 events. 18954/85766 cut-off events. For 461830/498324 co-relation queries the response was YES. Maximal size of possible extension queue 1688. Compared 1316370 event pairs, 5176 based on Foata normal form. 552/76799 useless extension candidates. Maximal degree in co-relation 42455. Up to 15120 conditions per place. [2023-11-29 20:28:57,239 INFO L140 encePairwiseOnDemand]: 313/358 looper letters, 753 selfloop transitions, 94 changer transitions 1031/2106 dead transitions. [2023-11-29 20:28:57,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 2106 transitions, 36155 flow [2023-11-29 20:28:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-29 20:28:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-11-29 20:28:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 12750 transitions. [2023-11-29 20:28:57,257 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6475368207211782 [2023-11-29 20:28:57,257 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 12750 transitions. [2023-11-29 20:28:57,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 12750 transitions. [2023-11-29 20:28:57,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:28:57,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 12750 transitions. [2023-11-29 20:28:57,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 231.8181818181818) internal successors, (12750), 55 states have internal predecessors, (12750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:57,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 358.0) internal successors, (20048), 56 states have internal predecessors, (20048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:57,287 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 358.0) internal successors, (20048), 56 states have internal predecessors, (20048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:57,287 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 182 predicate places. [2023-11-29 20:28:57,287 INFO L500 AbstractCegarLoop]: Abstraction has has 508 places, 2106 transitions, 36155 flow [2023-11-29 20:28:57,288 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 232.70967741935485) internal successors, (7214), 31 states have internal predecessors, (7214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:57,288 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:28:57,288 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:28:57,297 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-11-29 20:28:57,495 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:28:57,498 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-11-29 20:28:57,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:28:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1919276634, now seen corresponding path program 1 times [2023-11-29 20:28:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:28:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138093552] [2023-11-29 20:28:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:28:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:28:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:28:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 20:28:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:28:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138093552] [2023-11-29 20:28:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138093552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 20:28:57,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 20:28:57,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 20:28:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089443223] [2023-11-29 20:28:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 20:28:57,616 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 20:28:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:28:57,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 20:28:57,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 20:28:57,618 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 358 [2023-11-29 20:28:57,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 2106 transitions, 36155 flow. Second operand has 7 states, 7 states have (on average 280.2857142857143) internal successors, (1962), 7 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:28:57,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:28:57,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 358 [2023-11-29 20:28:57,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:29:08,078 INFO L124 PetriNetUnfolderBase]: 13610/57001 cut-off events. [2023-11-29 20:29:08,079 INFO L125 PetriNetUnfolderBase]: For 395134/430316 co-relation queries the response was YES. [2023-11-29 20:29:08,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210324 conditions, 57001 events. 13610/57001 cut-off events. For 395134/430316 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 793663 event pairs, 3533 based on Foata normal form. 498/51291 useless extension candidates. Maximal degree in co-relation 42122. Up to 11308 conditions per place. [2023-11-29 20:29:08,484 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 334 selfloop transitions, 14 changer transitions 1114/1887 dead transitions. [2023-11-29 20:29:08,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 1887 transitions, 34351 flow [2023-11-29 20:29:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 20:29:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 20:29:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2827 transitions. [2023-11-29 20:29:08,486 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7896648044692738 [2023-11-29 20:29:08,486 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2827 transitions. [2023-11-29 20:29:08,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2827 transitions. [2023-11-29 20:29:08,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:29:08,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2827 transitions. [2023-11-29 20:29:08,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 282.7) internal successors, (2827), 10 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:08,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:08,491 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:08,491 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 188 predicate places. [2023-11-29 20:29:08,491 INFO L500 AbstractCegarLoop]: Abstraction has has 514 places, 1887 transitions, 34351 flow [2023-11-29 20:29:08,491 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.2857142857143) internal successors, (1962), 7 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:08,491 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:29:08,492 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:29:08,492 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 20:29:08,492 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-11-29 20:29:08,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:29:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1131089063, now seen corresponding path program 2 times [2023-11-29 20:29:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:29:08,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136181676] [2023-11-29 20:29:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:29:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:29:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:29:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 20:29:08,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:29:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136181676] [2023-11-29 20:29:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136181676] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:29:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864873277] [2023-11-29 20:29:08,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 20:29:08,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:29:08,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:29:08,789 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-11-29 20:29:08,789 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-11-29 20:29:08,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 20:29:08,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 20:29:08,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 20:29:08,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:29:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 20:29:09,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:29:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 20:29:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864873277] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 20:29:09,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 20:29:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 23 [2023-11-29 20:29:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243202147] [2023-11-29 20:29:09,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 20:29:09,270 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 20:29:09,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:29:09,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 20:29:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2023-11-29 20:29:09,273 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 358 [2023-11-29 20:29:09,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 1887 transitions, 34351 flow. Second operand has 23 states, 23 states have (on average 229.65217391304347) internal successors, (5282), 23 states have internal predecessors, (5282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:09,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:29:09,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 358 [2023-11-29 20:29:09,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:29:36,307 INFO L124 PetriNetUnfolderBase]: 31586/130233 cut-off events. [2023-11-29 20:29:36,307 INFO L125 PetriNetUnfolderBase]: For 1013400/1069826 co-relation queries the response was YES. [2023-11-29 20:29:37,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500428 conditions, 130233 events. 31586/130233 cut-off events. For 1013400/1069826 co-relation queries the response was YES. Maximal size of possible extension queue 2759. Compared 2068255 event pairs, 7739 based on Foata normal form. 1363/116165 useless extension candidates. Maximal degree in co-relation 78554. Up to 27287 conditions per place. [2023-11-29 20:29:37,848 INFO L140 encePairwiseOnDemand]: 316/358 looper letters, 1120 selfloop transitions, 136 changer transitions 1994/3457 dead transitions. [2023-11-29 20:29:37,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 3457 transitions, 71645 flow [2023-11-29 20:29:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-29 20:29:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2023-11-29 20:29:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 13865 transitions. [2023-11-29 20:29:37,855 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6349024635955673 [2023-11-29 20:29:37,855 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 13865 transitions. [2023-11-29 20:29:37,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 13865 transitions. [2023-11-29 20:29:37,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:29:37,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 13865 transitions. [2023-11-29 20:29:37,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 227.29508196721312) internal successors, (13865), 61 states have internal predecessors, (13865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:37,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 358.0) internal successors, (22196), 62 states have internal predecessors, (22196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:37,883 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 358.0) internal successors, (22196), 62 states have internal predecessors, (22196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:37,884 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 248 predicate places. [2023-11-29 20:29:37,884 INFO L500 AbstractCegarLoop]: Abstraction has has 574 places, 3457 transitions, 71645 flow [2023-11-29 20:29:37,884 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 229.65217391304347) internal successors, (5282), 23 states have internal predecessors, (5282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:37,885 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:29:37,885 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:29:37,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 20:29:38,089 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-11-29 20:29:38,090 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-11-29 20:29:38,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:29:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1657398731, now seen corresponding path program 3 times [2023-11-29 20:29:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:29:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92781547] [2023-11-29 20:29:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:29:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:29:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:29:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 20:29:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:29:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92781547] [2023-11-29 20:29:38,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92781547] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:29:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472631054] [2023-11-29 20:29:38,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 20:29:38,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:29:38,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:29:38,581 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-11-29 20:29:38,582 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-11-29 20:29:38,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 20:29:38,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 20:29:38,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 20:29:38,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:29:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 20:29:38,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:29:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 20:29:39,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472631054] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 20:29:39,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 20:29:39,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 25 [2023-11-29 20:29:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432120236] [2023-11-29 20:29:39,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 20:29:39,074 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 20:29:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:29:39,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 20:29:39,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2023-11-29 20:29:39,077 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 358 [2023-11-29 20:29:39,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 3457 transitions, 71645 flow. Second operand has 25 states, 25 states have (on average 221.92) internal successors, (5548), 25 states have internal predecessors, (5548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:29:39,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:29:39,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 358 [2023-11-29 20:29:39,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 20:30:27,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([937] L77-->L78-2: Formula: (= v_~n1~0_4 (+ v_~n3~0_4 v_~res3~0_1)) InVars {~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4, ~res3~0=v_~res3~0_1} AuxVars[] AssignedVars[~res3~0][4596], [162#L69-2true, 6738#(and (<= 1 ~n2~0) (<= ~n1~0 1)), 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 343#true, 7906#true, 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 7888#true, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 5135#true, 9395#true, 412#(<= 1 ~n1~0), 128#L52-9true, 2651#true, 207#L78-2true, 48#L102-4true]) [2023-11-29 20:30:27,762 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2023-11-29 20:30:27,762 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2023-11-29 20:30:27,762 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2023-11-29 20:30:27,762 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2023-11-29 20:30:27,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([887] L64-2-->L65: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~n3~0_3) (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~n2~0_6)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~n2~0=v_~n2~0_6, ~n3~0=v_~n3~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~n2~0=v_~n2~0_6, ~n3~0=v_~n3~0_3} AuxVars[] AssignedVars[][4598], [130#L77true, 99#L65true, 6738#(and (<= 1 ~n2~0) (<= ~n1~0 1)), 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 343#true, 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 7906#true, 7888#true, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 6447#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~n3~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~n2~0)), thread3Thread1of1ForFork1InUse, 5135#true, 9395#true, 412#(<= 1 ~n1~0), 128#L52-9true, 2651#true, 48#L102-4true]) [2023-11-29 20:30:27,762 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2023-11-29 20:30:27,762 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2023-11-29 20:30:27,762 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2023-11-29 20:30:27,762 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2023-11-29 20:30:27,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([888] L64-2-->L64-3: Formula: (or (<= v_~n3~0_2 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (<= v_~n2~0_5 |v_thread2Thread1of1ForFork0_~i~1#1_5|)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~n2~0=v_~n2~0_5, ~n3~0=v_~n3~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~n2~0=v_~n2~0_5, ~n3~0=v_~n3~0_2} AuxVars[] AssignedVars[][4597], [130#L77true, 6738#(and (<= 1 ~n2~0) (<= ~n1~0 1)), 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 343#true, 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 7906#true, 7888#true, 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 231#L64-3true, 9395#true, 5135#true, 412#(<= 1 ~n1~0), 128#L52-9true, 2651#true, 48#L102-4true]) [2023-11-29 20:30:27,837 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2023-11-29 20:30:27,837 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2023-11-29 20:30:27,837 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2023-11-29 20:30:27,837 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2023-11-29 20:30:35,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([887] L64-2-->L65: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~n3~0_3) (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~n2~0_6)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~n2~0=v_~n2~0_6, ~n3~0=v_~n3~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~n2~0=v_~n2~0_6, ~n3~0=v_~n3~0_3} AuxVars[] AssignedVars[][5027], [130#L77true, 99#L65true, 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 343#true, 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), thread1Thread1of1ForFork2InUse, 7888#true, thread2Thread1of1ForFork0InUse, 6447#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~n3~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~n2~0)), thread3Thread1of1ForFork1InUse, 5135#true, 412#(<= 1 ~n1~0), 9402#(<= 2 ~n1~0), 128#L52-9true, 6449#true, 2651#true, 48#L102-4true, 9326#(and (<= (+ ~n3~0 1) ~n1~0) (<= 2 ~n1~0))]) [2023-11-29 20:30:35,568 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2023-11-29 20:30:35,569 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-29 20:30:35,569 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-29 20:30:35,569 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-29 20:30:35,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([937] L77-->L78-2: Formula: (= v_~n1~0_4 (+ v_~n3~0_4 v_~res3~0_1)) InVars {~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4, ~res3~0=v_~res3~0_1} AuxVars[] AssignedVars[~res3~0][5025], [9345#(and (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0) (<= 2 ~n1~0)), 162#L69-2true, 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 343#true, 7888#true, thread1Thread1of1ForFork2InUse, 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 5135#true, 412#(<= 1 ~n1~0), 6449#true, 9402#(<= 2 ~n1~0), 128#L52-9true, 2651#true, 207#L78-2true, 48#L102-4true]) [2023-11-29 20:30:35,570 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2023-11-29 20:30:35,570 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-29 20:30:35,570 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-29 20:30:35,570 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-29 20:30:35,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([888] L64-2-->L64-3: Formula: (or (<= v_~n3~0_2 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (<= v_~n2~0_5 |v_thread2Thread1of1ForFork0_~i~1#1_5|)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~n2~0=v_~n2~0_5, ~n3~0=v_~n3~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~n2~0=v_~n2~0_5, ~n3~0=v_~n3~0_2} AuxVars[] AssignedVars[][5026], [130#L77true, 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 343#true, 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 7888#true, thread1Thread1of1ForFork2InUse, 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), thread2Thread1of1ForFork0InUse, 231#L64-3true, thread3Thread1of1ForFork1InUse, 5135#true, 412#(<= 1 ~n1~0), 6449#true, 128#L52-9true, 9402#(<= 2 ~n1~0), 2651#true, 48#L102-4true, 9326#(and (<= (+ ~n3~0 1) ~n1~0) (<= 2 ~n1~0))]) [2023-11-29 20:30:35,648 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2023-11-29 20:30:35,648 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-29 20:30:35,648 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-29 20:30:35,648 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-29 20:30:35,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] thread1EXIT-->L103-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|} AuxVars[] AssignedVars[][4825], [130#L77true, 162#L69-2true, 6738#(and (<= 1 ~n2~0) (<= ~n1~0 1)), 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 343#true, 7906#true, thread1Thread1of1ForFork2NotInUse, 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 7888#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 9395#true, 5135#true, 282#L103-2true, 412#(<= 1 ~n1~0), 2651#true]) [2023-11-29 20:30:35,759 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2023-11-29 20:30:35,759 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-29 20:30:35,759 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-29 20:30:35,759 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-29 20:30:41,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([887] L64-2-->L65: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~n3~0_3) (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~n2~0_6)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~n2~0=v_~n2~0_6, ~n3~0=v_~n3~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~n2~0=v_~n2~0_6, ~n3~0=v_~n3~0_3} AuxVars[] AssignedVars[][5304], [130#L77true, 99#L65true, 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 343#true, thread1Thread1of1ForFork2InUse, 9409#(and (<= 2 ~n3~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= 2 ~n1~0)), 7888#true, thread2Thread1of1ForFork0InUse, 7913#(<= 2 ~n1~0), 6447#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~n3~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~n2~0)), thread3Thread1of1ForFork1InUse, 5135#true, 412#(<= 1 ~n1~0), 6449#true, 128#L52-9true, 2651#true, 48#L102-4true]) [2023-11-29 20:30:41,060 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-11-29 20:30:41,060 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-29 20:30:41,060 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-29 20:30:41,060 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-29 20:30:41,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([937] L77-->L78-2: Formula: (= v_~n1~0_4 (+ v_~n3~0_4 v_~res3~0_1)) InVars {~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4, ~res3~0=v_~res3~0_1} AuxVars[] AssignedVars[~res3~0][5302], [162#L69-2true, 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 343#true, 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 9409#(and (<= 2 ~n3~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= 2 ~n1~0)), thread1Thread1of1ForFork2InUse, 7888#true, thread2Thread1of1ForFork0InUse, 7913#(<= 2 ~n1~0), thread3Thread1of1ForFork1InUse, 5135#true, 412#(<= 1 ~n1~0), 6449#true, 128#L52-9true, 207#L78-2true, 2651#true, 48#L102-4true]) [2023-11-29 20:30:41,062 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2023-11-29 20:30:41,062 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-11-29 20:30:41,062 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-11-29 20:30:41,062 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-11-29 20:30:41,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([888] L64-2-->L64-3: Formula: (or (<= v_~n3~0_2 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (<= v_~n2~0_5 |v_thread2Thread1of1ForFork0_~i~1#1_5|)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~n2~0=v_~n2~0_5, ~n3~0=v_~n3~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~n2~0=v_~n2~0_5, ~n3~0=v_~n3~0_2} AuxVars[] AssignedVars[][5303], [130#L77true, 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 343#true, 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 7888#true, 9409#(and (<= 2 ~n3~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= 2 ~n1~0)), 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), thread1Thread1of1ForFork2InUse, 7913#(<= 2 ~n1~0), thread2Thread1of1ForFork0InUse, 231#L64-3true, thread3Thread1of1ForFork1InUse, 5135#true, 412#(<= 1 ~n1~0), 128#L52-9true, 6449#true, 2651#true, 48#L102-4true]) [2023-11-29 20:30:41,186 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-11-29 20:30:41,186 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-29 20:30:41,186 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-29 20:30:41,186 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-29 20:30:41,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] thread1EXIT-->L103-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|} AuxVars[] AssignedVars[][5174], [130#L77true, 162#L69-2true, 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 343#true, 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 7888#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 5135#true, 282#L103-2true, 412#(<= 1 ~n1~0), 6449#true, 9402#(<= 2 ~n1~0), 2651#true, 9326#(and (<= (+ ~n3~0 1) ~n1~0) (<= 2 ~n1~0))]) [2023-11-29 20:30:41,215 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2023-11-29 20:30:41,215 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-11-29 20:30:41,215 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-11-29 20:30:41,215 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-11-29 20:30:43,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] thread1EXIT-->L103-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|} AuxVars[] AssignedVars[][5415], [130#L77true, 162#L69-2true, 5117#true, 2649#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 5115#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 343#true, thread1Thread1of1ForFork2NotInUse, 7888#true, 9409#(and (<= 2 ~n3~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= 2 ~n1~0)), 5162#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), thread2Thread1of1ForFork0InUse, 7913#(<= 2 ~n1~0), thread3Thread1of1ForFork1InUse, 5135#true, 282#L103-2true, 412#(<= 1 ~n1~0), 6449#true, 2651#true]) [2023-11-29 20:30:43,911 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2023-11-29 20:30:43,911 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2023-11-29 20:30:43,911 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2023-11-29 20:30:43,911 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2023-11-29 20:30:48,113 INFO L124 PetriNetUnfolderBase]: 56121/226823 cut-off events. [2023-11-29 20:30:48,113 INFO L125 PetriNetUnfolderBase]: For 1785468/1964819 co-relation queries the response was YES. [2023-11-29 20:30:50,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916717 conditions, 226823 events. 56121/226823 cut-off events. For 1785468/1964819 co-relation queries the response was YES. Maximal size of possible extension queue 4722. Compared 3847410 event pairs, 9818 based on Foata normal form. 3755/203042 useless extension candidates. Maximal degree in co-relation 215646. Up to 47172 conditions per place. [2023-11-29 20:30:51,678 INFO L140 encePairwiseOnDemand]: 309/358 looper letters, 2125 selfloop transitions, 471 changer transitions 3058/5853 dead transitions. [2023-11-29 20:30:51,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 5853 transitions, 131959 flow [2023-11-29 20:30:51,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2023-11-29 20:30:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2023-11-29 20:30:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 20123 transitions. [2023-11-29 20:30:51,690 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6176867824912518 [2023-11-29 20:30:51,690 INFO L72 ComplementDD]: Start complementDD. Operand 91 states and 20123 transitions. [2023-11-29 20:30:51,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 20123 transitions. [2023-11-29 20:30:51,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 20:30:51,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 91 states and 20123 transitions. [2023-11-29 20:30:51,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 92 states, 91 states have (on average 221.13186813186815) internal successors, (20123), 91 states have internal predecessors, (20123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:30:51,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 92 states, 92 states have (on average 358.0) internal successors, (32936), 92 states have internal predecessors, (32936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:30:51,772 INFO L81 ComplementDD]: Finished complementDD. Result has 92 states, 92 states have (on average 358.0) internal successors, (32936), 92 states have internal predecessors, (32936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:30:51,773 INFO L307 CegarLoopForPetriNet]: 326 programPoint places, 338 predicate places. [2023-11-29 20:30:51,773 INFO L500 AbstractCegarLoop]: Abstraction has has 664 places, 5853 transitions, 131959 flow [2023-11-29 20:30:51,774 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 221.92) internal successors, (5548), 25 states have internal predecessors, (5548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:30:51,774 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 20:30:51,774 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 20:30:51,785 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-11-29 20:30:51,974 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-11-29 20:30:51,975 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-11-29 20:30:51,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 20:30:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1139552222, now seen corresponding path program 1 times [2023-11-29 20:30:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 20:30:51,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208915076] [2023-11-29 20:30:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:30:51,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 20:30:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:30:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 20:30:52,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 20:30:52,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208915076] [2023-11-29 20:30:52,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208915076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 20:30:52,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349586275] [2023-11-29 20:30:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 20:30:52,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 20:30:52,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 20:30:52,448 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-11-29 20:30:52,449 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-11-29 20:30:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 20:30:52,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 20:30:52,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 20:30:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 20:30:52,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 20:30:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 20:30:53,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349586275] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 20:30:53,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 20:30:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 32 [2023-11-29 20:30:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353949001] [2023-11-29 20:30:53,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 20:30:53,414 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 20:30:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 20:30:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 20:30:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2023-11-29 20:30:53,418 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 358 [2023-11-29 20:30:53,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 5853 transitions, 131959 flow. Second operand has 32 states, 32 states have (on average 228.03125) internal successors, (7297), 32 states have internal predecessors, (7297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 20:30:53,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 20:30:53,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 358 [2023-11-29 20:30:53,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand