/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:30:46,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:30:46,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:30:46,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:30:46,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:30:46,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:30:46,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:30:46,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:30:46,458 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:30:46,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:30:46,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:30:46,462 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:30:46,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:30:46,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:30:46,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:30:46,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:30:46,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:30:46,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:30:46,464 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:30:46,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:30:46,465 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:30:46,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:30:46,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:30:46,466 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:30:46,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:30:46,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:30:46,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:30:46,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:30:46,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:30:46,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:30:46,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:30:46,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:30:46,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:30:46,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:30:46,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:30:46,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:30:46,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:30:46,736 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:30:46,737 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:30:46,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-12-09 15:30:47,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:30:48,069 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:30:48,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-12-09 15:30:48,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad01c63d3/4fb40d36893b448f885e608008cfa2df/FLAGf044df72e [2023-12-09 15:30:48,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad01c63d3/4fb40d36893b448f885e608008cfa2df [2023-12-09 15:30:48,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:30:48,095 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:30:48,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:30:48,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:30:48,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:30:48,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0dab12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48, skipping insertion in model container [2023-12-09 15:30:48,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,126 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:30:48,258 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/popl20-more-sum-array-hom.wvr.c[2435,2448] [2023-12-09 15:30:48,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:30:48,271 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:30:48,289 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/popl20-more-sum-array-hom.wvr.c[2435,2448] [2023-12-09 15:30:48,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:30:48,303 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:30:48,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48 WrapperNode [2023-12-09 15:30:48,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:30:48,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:30:48,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:30:48,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:30:48,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,333 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-12-09 15:30:48,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:30:48,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:30:48,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:30:48,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:30:48,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:30:48,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:30:48,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:30:48,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:30:48,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (1/1) ... [2023-12-09 15:30:48,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:30:48,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:30:48,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:30:48,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:30:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:30:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:30:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:30:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:30:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:30:48,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:30:48,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:30:48,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:30:48,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:30:48,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:30:48,464 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:30:48,584 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:30:48,586 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:30:48,805 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:30:48,815 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:30:48,815 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:30:48,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:30:48 BoogieIcfgContainer [2023-12-09 15:30:48,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:30:48,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:30:48,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:30:48,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:30:48,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:30:48" (1/3) ... [2023-12-09 15:30:48,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517b9cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:30:48, skipping insertion in model container [2023-12-09 15:30:48,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:30:48" (2/3) ... [2023-12-09 15:30:48,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517b9cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:30:48, skipping insertion in model container [2023-12-09 15:30:48,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:30:48" (3/3) ... [2023-12-09 15:30:48,826 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2023-12-09 15:30:48,840 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:30:48,840 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:30:48,840 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:30:48,903 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:30:48,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 166 transitions, 353 flow [2023-12-09 15:30:49,039 INFO L124 PetriNetUnfolderBase]: 12/163 cut-off events. [2023-12-09 15:30:49,039 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:30:49,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 163 events. 12/163 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 121. Up to 2 conditions per place. [2023-12-09 15:30:49,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 166 transitions, 353 flow [2023-12-09 15:30:49,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 152 transitions, 322 flow [2023-12-09 15:30:49,062 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:30:49,067 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;@2ab492ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:30:49,068 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:30:49,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:30:49,109 INFO L124 PetriNetUnfolderBase]: 12/151 cut-off events. [2023-12-09 15:30:49,109 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:30:49,109 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:30:49,110 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:30:49,111 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:30:49,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:30:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1216935869, now seen corresponding path program 1 times [2023-12-09 15:30:49,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:30:49,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672341739] [2023-12-09 15:30:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:49,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:30:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:30:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:30:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:30:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672341739] [2023-12-09 15:30:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672341739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:30:50,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:30:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:30:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192376062] [2023-12-09 15:30:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:30:50,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:30:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:30:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:30:50,274 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 166 [2023-12-09 15:30:50,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 152 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:50,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:50,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 166 [2023-12-09 15:30:50,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:30:50,552 INFO L124 PetriNetUnfolderBase]: 54/437 cut-off events. [2023-12-09 15:30:50,552 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-12-09 15:30:50,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 437 events. 54/437 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1767 event pairs, 7 based on Foata normal form. 64/460 useless extension candidates. Maximal degree in co-relation 337. Up to 54 conditions per place. [2023-12-09 15:30:50,562 INFO L140 encePairwiseOnDemand]: 145/166 looper letters, 59 selfloop transitions, 9 changer transitions 11/183 dead transitions. [2023-12-09 15:30:50,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 183 transitions, 578 flow [2023-12-09 15:30:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:30:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:30:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1387 transitions. [2023-12-09 15:30:50,580 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7595837897042717 [2023-12-09 15:30:50,581 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1387 transitions. [2023-12-09 15:30:50,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1387 transitions. [2023-12-09 15:30:50,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:30:50,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1387 transitions. [2023-12-09 15:30:50,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.0909090909091) internal successors, (1387), 11 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:50,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:50,601 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:50,608 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 10 predicate places. [2023-12-09 15:30:50,608 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 183 transitions, 578 flow [2023-12-09 15:30:50,609 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:50,609 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:30:50,609 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:30:50,609 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:30:50,610 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:30:50,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:30:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash 238623233, now seen corresponding path program 1 times [2023-12-09 15:30:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:30:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693421360] [2023-12-09 15:30:50,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:30:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:30:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:30:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:30:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693421360] [2023-12-09 15:30:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693421360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:30:50,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:30:50,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:30:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443802257] [2023-12-09 15:30:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:30:50,799 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:30:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:50,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:30:50,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:30:50,801 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 166 [2023-12-09 15:30:50,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 183 transitions, 578 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:50,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:50,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 166 [2023-12-09 15:30:50,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:30:51,077 INFO L124 PetriNetUnfolderBase]: 314/1196 cut-off events. [2023-12-09 15:30:51,077 INFO L125 PetriNetUnfolderBase]: For 595/608 co-relation queries the response was YES. [2023-12-09 15:30:51,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 1196 events. 314/1196 cut-off events. For 595/608 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7822 event pairs, 115 based on Foata normal form. 1/1034 useless extension candidates. Maximal degree in co-relation 1096. Up to 311 conditions per place. [2023-12-09 15:30:51,090 INFO L140 encePairwiseOnDemand]: 153/166 looper letters, 61 selfloop transitions, 14 changer transitions 12/215 dead transitions. [2023-12-09 15:30:51,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 215 transitions, 878 flow [2023-12-09 15:30:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:30:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:30:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1298 transitions. [2023-12-09 15:30:51,094 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7819277108433735 [2023-12-09 15:30:51,094 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1298 transitions. [2023-12-09 15:30:51,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1298 transitions. [2023-12-09 15:30:51,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:30:51,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1298 transitions. [2023-12-09 15:30:51,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 129.8) internal successors, (1298), 10 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:51,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:51,101 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:51,102 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 19 predicate places. [2023-12-09 15:30:51,102 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 215 transitions, 878 flow [2023-12-09 15:30:51,103 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:51,103 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:30:51,104 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:30:51,104 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:30:51,105 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:30:51,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:30:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1455536581, now seen corresponding path program 1 times [2023-12-09 15:30:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:30:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974084341] [2023-12-09 15:30:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:51,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:30:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:30:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:30:51,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:30:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974084341] [2023-12-09 15:30:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974084341] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:30:51,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:30:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:30:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422278968] [2023-12-09 15:30:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:30:51,599 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:30:51,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:51,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:30:51,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:30:51,604 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 166 [2023-12-09 15:30:51,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 215 transitions, 878 flow. Second operand has 11 states, 11 states have (on average 98.81818181818181) internal successors, (1087), 11 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:51,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:51,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 166 [2023-12-09 15:30:51,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:30:52,590 INFO L124 PetriNetUnfolderBase]: 1736/4179 cut-off events. [2023-12-09 15:30:52,590 INFO L125 PetriNetUnfolderBase]: For 3650/3951 co-relation queries the response was YES. [2023-12-09 15:30:52,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9479 conditions, 4179 events. 1736/4179 cut-off events. For 3650/3951 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 35500 event pairs, 1167 based on Foata normal form. 0/3350 useless extension candidates. Maximal degree in co-relation 7615. Up to 1971 conditions per place. [2023-12-09 15:30:52,626 INFO L140 encePairwiseOnDemand]: 149/166 looper letters, 113 selfloop transitions, 18 changer transitions 18/241 dead transitions. [2023-12-09 15:30:52,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 241 transitions, 1265 flow [2023-12-09 15:30:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:30:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:30:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1515 transitions. [2023-12-09 15:30:52,631 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2023-12-09 15:30:52,631 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1515 transitions. [2023-12-09 15:30:52,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1515 transitions. [2023-12-09 15:30:52,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:30:52,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1515 transitions. [2023-12-09 15:30:52,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.0) internal successors, (1515), 15 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:52,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:52,640 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:52,642 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 33 predicate places. [2023-12-09 15:30:52,642 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 241 transitions, 1265 flow [2023-12-09 15:30:52,642 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 98.81818181818181) internal successors, (1087), 11 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:52,642 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:30:52,642 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:30:52,643 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:30:52,643 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:30:52,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:30:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1596356011, now seen corresponding path program 1 times [2023-12-09 15:30:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:30:52,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159399108] [2023-12-09 15:30:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:30:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:30:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:30:53,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:30:53,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159399108] [2023-12-09 15:30:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159399108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:30:53,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:30:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:30:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721643876] [2023-12-09 15:30:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:30:53,037 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:30:53,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:30:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:30:53,041 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 166 [2023-12-09 15:30:53,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 241 transitions, 1265 flow. Second operand has 11 states, 11 states have (on average 99.72727272727273) internal successors, (1097), 11 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:53,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:53,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 166 [2023-12-09 15:30:53,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:30:54,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] thread1EXIT-->L85-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem16#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][198], [thread2Thread1of1ForFork2InUse, 4#L85-2true, thread1Thread1of1ForFork1NotInUse, 235#true, 114#L56-5true, 185#true, thread3Thread1of1ForFork0InUse, 61#L64-5true, 167#true, 203#true]) [2023-12-09 15:30:54,002 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-12-09 15:30:54,002 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-12-09 15:30:54,002 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-12-09 15:30:54,002 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-12-09 15:30:54,020 INFO L124 PetriNetUnfolderBase]: 2206/4678 cut-off events. [2023-12-09 15:30:54,020 INFO L125 PetriNetUnfolderBase]: For 8901/9924 co-relation queries the response was YES. [2023-12-09 15:30:54,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13666 conditions, 4678 events. 2206/4678 cut-off events. For 8901/9924 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 38337 event pairs, 1378 based on Foata normal form. 2/3586 useless extension candidates. Maximal degree in co-relation 11949. Up to 2470 conditions per place. [2023-12-09 15:30:54,070 INFO L140 encePairwiseOnDemand]: 149/166 looper letters, 86 selfloop transitions, 10 changer transitions 58/245 dead transitions. [2023-12-09 15:30:54,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 245 transitions, 1614 flow [2023-12-09 15:30:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-09 15:30:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-12-09 15:30:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1433 transitions. [2023-12-09 15:30:54,075 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6166092943201377 [2023-12-09 15:30:54,076 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1433 transitions. [2023-12-09 15:30:54,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1433 transitions. [2023-12-09 15:30:54,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:30:54,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1433 transitions. [2023-12-09 15:30:54,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 102.35714285714286) internal successors, (1433), 14 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:54,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 166.0) internal successors, (2490), 15 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:54,086 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 166.0) internal successors, (2490), 15 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:54,087 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 46 predicate places. [2023-12-09 15:30:54,088 INFO L500 AbstractCegarLoop]: Abstraction has has 196 places, 245 transitions, 1614 flow [2023-12-09 15:30:54,089 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 99.72727272727273) internal successors, (1097), 11 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:54,089 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:30:54,089 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:30:54,089 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:30:54,090 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:30:54,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:30:54,090 INFO L85 PathProgramCache]: Analyzing trace with hash -363581912, now seen corresponding path program 1 times [2023-12-09 15:30:54,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:30:54,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295292377] [2023-12-09 15:30:54,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:30:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:30:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:54,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:30:54,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295292377] [2023-12-09 15:30:54,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295292377] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:30:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280132642] [2023-12-09 15:30:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:54,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:30:54,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:30:54,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:30:54,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:30:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:30:54,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:30:54,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:30:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:54,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:30:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:54,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280132642] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:30:54,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:30:54,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-12-09 15:30:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785478474] [2023-12-09 15:30:54,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:30:54,853 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:30:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:54,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:30:54,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:30:54,855 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-12-09 15:30:54,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 245 transitions, 1614 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:54,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:54,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-12-09 15:30:54,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:30:55,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L48-6-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][187], [116#L49true, thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 156#L64-6true, 185#true, thread3Thread1of1ForFork0InUse, 44#L57true, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 167#true, 203#true]) [2023-12-09 15:30:55,672 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-12-09 15:30:55,672 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-09 15:30:55,672 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-12-09 15:30:55,672 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-12-09 15:30:55,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L48-6-->L48-7: Formula: (<= v_~N~0_1 v_thread1Thread1of1ForFork1_~i~0_5) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][188], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 156#L64-6true, 185#true, thread3Thread1of1ForFork0InUse, 44#L57true, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 144#L48-7true, 167#true, 203#true]) [2023-12-09 15:30:55,673 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-12-09 15:30:55,673 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-09 15:30:55,673 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-12-09 15:30:55,673 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-12-09 15:30:55,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L64-6-->L65: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_4) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][189], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 185#true, 15#L48-5true, 44#L57true, thread3Thread1of1ForFork0InUse, 67#L84-4true, 36#L65true, 167#true, 203#true, 1043#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0))]) [2023-12-09 15:30:55,673 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-12-09 15:30:55,673 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-12-09 15:30:55,673 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-12-09 15:30:55,673 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-12-09 15:30:55,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L64-6-->L64-7: Formula: (<= v_~N~0_3 v_thread3Thread1of1ForFork0_~i~2_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][190], [thread2Thread1of1ForFork2InUse, 27#L64-7true, thread1Thread1of1ForFork1InUse, 15#L48-5true, 185#true, 44#L57true, thread3Thread1of1ForFork0InUse, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 167#true, 203#true]) [2023-12-09 15:30:55,674 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-12-09 15:30:55,674 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-12-09 15:30:55,674 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-12-09 15:30:55,674 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-12-09 15:30:55,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L48-6-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][187], [116#L49true, thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 185#true, 156#L64-6true, thread3Thread1of1ForFork0InUse, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 19#L57-1true, 167#true, 203#true]) [2023-12-09 15:30:55,708 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-12-09 15:30:55,708 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-09 15:30:55,708 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-09 15:30:55,708 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-09 15:30:55,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L48-6-->L48-7: Formula: (<= v_~N~0_1 v_thread1Thread1of1ForFork1_~i~0_5) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][188], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 185#true, 156#L64-6true, thread3Thread1of1ForFork0InUse, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 19#L57-1true, 144#L48-7true, 167#true, 203#true]) [2023-12-09 15:30:55,708 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-12-09 15:30:55,709 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-09 15:30:55,709 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-09 15:30:55,709 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-09 15:30:55,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L64-6-->L65: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_4) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][189], [thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, 235#true, 185#true, 15#L48-5true, thread3Thread1of1ForFork0InUse, 67#L84-4true, 36#L65true, 19#L57-1true, 167#true, 1043#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), 203#true]) [2023-12-09 15:30:55,709 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-12-09 15:30:55,709 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-12-09 15:30:55,709 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-09 15:30:55,709 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-12-09 15:30:55,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L64-6-->L64-7: Formula: (<= v_~N~0_3 v_thread3Thread1of1ForFork0_~i~2_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][190], [thread2Thread1of1ForFork2InUse, 27#L64-7true, thread1Thread1of1ForFork1InUse, 185#true, 15#L48-5true, thread3Thread1of1ForFork0InUse, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 19#L57-1true, 167#true, 203#true]) [2023-12-09 15:30:55,709 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-12-09 15:30:55,710 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-12-09 15:30:55,710 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-12-09 15:30:55,710 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-09 15:30:55,958 INFO L124 PetriNetUnfolderBase]: 3969/7513 cut-off events. [2023-12-09 15:30:55,958 INFO L125 PetriNetUnfolderBase]: For 15826/18678 co-relation queries the response was YES. [2023-12-09 15:30:55,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27495 conditions, 7513 events. 3969/7513 cut-off events. For 15826/18678 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 59670 event pairs, 871 based on Foata normal form. 30/5779 useless extension candidates. Maximal degree in co-relation 25430. Up to 4478 conditions per place. [2023-12-09 15:30:56,037 INFO L140 encePairwiseOnDemand]: 149/166 looper letters, 131 selfloop transitions, 27 changer transitions 60/337 dead transitions. [2023-12-09 15:30:56,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 337 transitions, 2830 flow [2023-12-09 15:30:56,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:30:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:30:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1261 transitions. [2023-12-09 15:30:56,041 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7596385542168674 [2023-12-09 15:30:56,041 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1261 transitions. [2023-12-09 15:30:56,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1261 transitions. [2023-12-09 15:30:56,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:30:56,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1261 transitions. [2023-12-09 15:30:56,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:56,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:56,048 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:56,049 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 55 predicate places. [2023-12-09 15:30:56,050 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 337 transitions, 2830 flow [2023-12-09 15:30:56,050 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:56,050 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:30:56,050 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:30:56,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:30:56,256 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:30:56,257 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:30:56,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:30:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1754565882, now seen corresponding path program 2 times [2023-12-09 15:30:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:30:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211020424] [2023-12-09 15:30:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:30:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:30:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:56,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:30:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211020424] [2023-12-09 15:30:56,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211020424] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:30:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345929789] [2023-12-09 15:30:56,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:30:56,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:30:56,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:30:56,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:30:56,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:30:56,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:30:56,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:30:56,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:30:56,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:30:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:56,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:30:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:56,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345929789] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:30:56,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:30:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-12-09 15:30:56,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797954658] [2023-12-09 15:30:56,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:30:56,935 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:30:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:56,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:30:56,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:30:56,937 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-12-09 15:30:56,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 337 transitions, 2830 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:56,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:56,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-12-09 15:30:56,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:30:58,456 INFO L124 PetriNetUnfolderBase]: 3996/8245 cut-off events. [2023-12-09 15:30:58,456 INFO L125 PetriNetUnfolderBase]: For 19189/22136 co-relation queries the response was YES. [2023-12-09 15:30:58,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34412 conditions, 8245 events. 3996/8245 cut-off events. For 19189/22136 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 70758 event pairs, 727 based on Foata normal form. 205/6848 useless extension candidates. Maximal degree in co-relation 31892. Up to 4681 conditions per place. [2023-12-09 15:30:58,544 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 211 selfloop transitions, 35 changer transitions 61/426 dead transitions. [2023-12-09 15:30:58,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 426 transitions, 4363 flow [2023-12-09 15:30:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:30:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:30:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1374 transitions. [2023-12-09 15:30:58,548 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7524644030668127 [2023-12-09 15:30:58,548 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1374 transitions. [2023-12-09 15:30:58,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1374 transitions. [2023-12-09 15:30:58,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:30:58,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1374 transitions. [2023-12-09 15:30:58,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:58,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:58,555 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:58,557 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 65 predicate places. [2023-12-09 15:30:58,558 INFO L500 AbstractCegarLoop]: Abstraction has has 215 places, 426 transitions, 4363 flow [2023-12-09 15:30:58,558 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:58,558 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:30:58,558 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:30:58,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:30:58,763 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-09 15:30:58,764 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:30:58,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:30:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1818984000, now seen corresponding path program 3 times [2023-12-09 15:30:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:30:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781939115] [2023-12-09 15:30:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:30:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:30:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:30:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781939115] [2023-12-09 15:30:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781939115] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:30:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925743247] [2023-12-09 15:30:58,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:30:58,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:30:58,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:30:58,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:30:58,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:30:59,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:30:59,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:30:59,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:30:59,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:30:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:59,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:30:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:59,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925743247] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:30:59,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:30:59,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-12-09 15:30:59,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744199678] [2023-12-09 15:30:59,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:30:59,396 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:30:59,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:59,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:30:59,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:30:59,398 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-12-09 15:30:59,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 426 transitions, 4363 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:59,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:59,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-12-09 15:30:59,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:31:01,203 INFO L124 PetriNetUnfolderBase]: 5491/11445 cut-off events. [2023-12-09 15:31:01,203 INFO L125 PetriNetUnfolderBase]: For 31446/35612 co-relation queries the response was YES. [2023-12-09 15:31:01,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55505 conditions, 11445 events. 5491/11445 cut-off events. For 31446/35612 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 103389 event pairs, 665 based on Foata normal form. 117/9540 useless extension candidates. Maximal degree in co-relation 52397. Up to 6656 conditions per place. [2023-12-09 15:31:01,477 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 439 selfloop transitions, 61 changer transitions 66/685 dead transitions. [2023-12-09 15:31:01,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 685 transitions, 8767 flow [2023-12-09 15:31:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:31:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 15:31:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1628 transitions. [2023-12-09 15:31:01,481 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7544022242817423 [2023-12-09 15:31:01,481 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1628 transitions. [2023-12-09 15:31:01,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1628 transitions. [2023-12-09 15:31:01,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:31:01,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1628 transitions. [2023-12-09 15:31:01,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 125.23076923076923) internal successors, (1628), 13 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:01,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 166.0) internal successors, (2324), 14 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:01,489 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 166.0) internal successors, (2324), 14 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:01,489 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 77 predicate places. [2023-12-09 15:31:01,490 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 685 transitions, 8767 flow [2023-12-09 15:31:01,490 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:01,490 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:31:01,490 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:31:01,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:31:01,696 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:01,696 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:31:01,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:31:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash -738511726, now seen corresponding path program 4 times [2023-12-09 15:31:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:31:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442912831] [2023-12-09 15:31:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:31:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:31:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442912831] [2023-12-09 15:31:01,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442912831] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106069167] [2023-12-09 15:31:01,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:31:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:31:01,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:31:01,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:31:01,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:31:01,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:31:01,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:31:01,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:31:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:02,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:31:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:02,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106069167] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:02,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:31:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2023-12-09 15:31:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734800883] [2023-12-09 15:31:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:31:02,368 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:31:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:31:02,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:31:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-09 15:31:02,370 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-12-09 15:31:02,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 685 transitions, 8767 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:02,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:31:02,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-12-09 15:31:02,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:31:04,478 INFO L124 PetriNetUnfolderBase]: 5922/12473 cut-off events. [2023-12-09 15:31:04,479 INFO L125 PetriNetUnfolderBase]: For 43768/50038 co-relation queries the response was YES. [2023-12-09 15:31:04,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68709 conditions, 12473 events. 5922/12473 cut-off events. For 43768/50038 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 115714 event pairs, 697 based on Foata normal form. 383/10691 useless extension candidates. Maximal degree in co-relation 64913. Up to 7087 conditions per place. [2023-12-09 15:31:04,602 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 486 selfloop transitions, 73 changer transitions 67/745 dead transitions. [2023-12-09 15:31:04,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 745 transitions, 10863 flow [2023-12-09 15:31:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:31:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:31:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1390 transitions. [2023-12-09 15:31:04,606 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7612267250821467 [2023-12-09 15:31:04,606 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1390 transitions. [2023-12-09 15:31:04,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1390 transitions. [2023-12-09 15:31:04,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:31:04,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1390 transitions. [2023-12-09 15:31:04,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.36363636363636) internal successors, (1390), 11 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:04,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:04,613 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:04,614 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 87 predicate places. [2023-12-09 15:31:04,615 INFO L500 AbstractCegarLoop]: Abstraction has has 237 places, 745 transitions, 10863 flow [2023-12-09 15:31:04,615 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:04,615 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:31:04,615 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:31:04,623 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-12-09 15:31:04,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:04,820 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:31:04,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:31:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -949544852, now seen corresponding path program 5 times [2023-12-09 15:31:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:31:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976181007] [2023-12-09 15:31:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:31:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:31:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976181007] [2023-12-09 15:31:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976181007] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085474292] [2023-12-09 15:31:04,982 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:31:04,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:04,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:31:04,984 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:31:05,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:31:05,088 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:31:05,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:31:05,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:31:05,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:31:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:05,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:31:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:05,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085474292] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:31:05,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:31:05,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2023-12-09 15:31:05,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737678633] [2023-12-09 15:31:05,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:31:05,260 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:31:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:31:05,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:31:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:31:05,262 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 166 [2023-12-09 15:31:05,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 745 transitions, 10863 flow. Second operand has 16 states, 16 states have (on average 114.125) internal successors, (1826), 16 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:05,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:31:05,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 166 [2023-12-09 15:31:05,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:31:08,871 INFO L124 PetriNetUnfolderBase]: 9449/18309 cut-off events. [2023-12-09 15:31:08,871 INFO L125 PetriNetUnfolderBase]: For 59900/67463 co-relation queries the response was YES. [2023-12-09 15:31:08,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103810 conditions, 18309 events. 9449/18309 cut-off events. For 59900/67463 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 164698 event pairs, 702 based on Foata normal form. 404/16611 useless extension candidates. Maximal degree in co-relation 99225. Up to 8466 conditions per place. [2023-12-09 15:31:09,064 INFO L140 encePairwiseOnDemand]: 143/166 looper letters, 797 selfloop transitions, 314 changer transitions 74/1299 dead transitions. [2023-12-09 15:31:09,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1299 transitions, 20408 flow [2023-12-09 15:31:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-09 15:31:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-12-09 15:31:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3798 transitions. [2023-12-09 15:31:09,074 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7380489700738437 [2023-12-09 15:31:09,074 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3798 transitions. [2023-12-09 15:31:09,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3798 transitions. [2023-12-09 15:31:09,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:31:09,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3798 transitions. [2023-12-09 15:31:09,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 122.51612903225806) internal successors, (3798), 31 states have internal predecessors, (3798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:09,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 166.0) internal successors, (5312), 32 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:09,104 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 166.0) internal successors, (5312), 32 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:09,105 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 117 predicate places. [2023-12-09 15:31:09,105 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 1299 transitions, 20408 flow [2023-12-09 15:31:09,106 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 114.125) internal successors, (1826), 16 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:09,106 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:31:09,106 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:31:09,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 15:31:09,312 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:09,312 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:31:09,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:31:09,313 INFO L85 PathProgramCache]: Analyzing trace with hash 738365578, now seen corresponding path program 6 times [2023-12-09 15:31:09,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:31:09,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890292663] [2023-12-09 15:31:09,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:09,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:31:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:09,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:31:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890292663] [2023-12-09 15:31:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890292663] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912604992] [2023-12-09 15:31:09,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-09 15:31:09,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:09,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:31:09,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:31:09,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 15:31:09,699 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-12-09 15:31:09,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:31:09,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:31:09,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:31:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:09,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:31:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912604992] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:10,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:31:10,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2023-12-09 15:31:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779286045] [2023-12-09 15:31:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:31:10,067 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:31:10,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:31:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:31:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-12-09 15:31:10,069 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-12-09 15:31:10,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 1299 transitions, 20408 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:10,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:31:10,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-12-09 15:31:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:31:13,606 INFO L124 PetriNetUnfolderBase]: 9372/18217 cut-off events. [2023-12-09 15:31:13,607 INFO L125 PetriNetUnfolderBase]: For 70660/79841 co-relation queries the response was YES. [2023-12-09 15:31:13,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114215 conditions, 18217 events. 9372/18217 cut-off events. For 70660/79841 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 164268 event pairs, 748 based on Foata normal form. 450/16580 useless extension candidates. Maximal degree in co-relation 103573. Up to 8409 conditions per place. [2023-12-09 15:31:13,804 INFO L140 encePairwiseOnDemand]: 149/166 looper letters, 792 selfloop transitions, 200 changer transitions 59/1253 dead transitions. [2023-12-09 15:31:13,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1253 transitions, 21656 flow [2023-12-09 15:31:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:31:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:31:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1260 transitions. [2023-12-09 15:31:13,806 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7590361445783133 [2023-12-09 15:31:13,806 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1260 transitions. [2023-12-09 15:31:13,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1260 transitions. [2023-12-09 15:31:13,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:31:13,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1260 transitions. [2023-12-09 15:31:13,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:13,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:13,810 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:13,811 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 126 predicate places. [2023-12-09 15:31:13,811 INFO L500 AbstractCegarLoop]: Abstraction has has 276 places, 1253 transitions, 21656 flow [2023-12-09 15:31:13,811 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:13,811 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:31:13,811 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:31:13,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-09 15:31:14,022 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:14,023 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:31:14,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:31:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 33721068, now seen corresponding path program 1 times [2023-12-09 15:31:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:31:14,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111157924] [2023-12-09 15:31:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:31:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:31:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111157924] [2023-12-09 15:31:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111157924] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774225227] [2023-12-09 15:31:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:14,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:31:14,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:31:14,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 15:31:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:14,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:31:14,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:31:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:14,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:31:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774225227] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:31:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-12-09 15:31:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155877739] [2023-12-09 15:31:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:31:14,560 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:31:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:31:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:31:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:31:14,562 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 166 [2023-12-09 15:31:14,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1253 transitions, 21656 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:14,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:31:14,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 166 [2023-12-09 15:31:14,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:31:17,104 INFO L124 PetriNetUnfolderBase]: 7583/14451 cut-off events. [2023-12-09 15:31:17,104 INFO L125 PetriNetUnfolderBase]: For 67110/72258 co-relation queries the response was YES. [2023-12-09 15:31:17,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94678 conditions, 14451 events. 7583/14451 cut-off events. For 67110/72258 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 121925 event pairs, 579 based on Foata normal form. 44/13000 useless extension candidates. Maximal degree in co-relation 90699. Up to 6469 conditions per place. [2023-12-09 15:31:17,230 INFO L140 encePairwiseOnDemand]: 155/166 looper letters, 483 selfloop transitions, 101 changer transitions 57/1135 dead transitions. [2023-12-09 15:31:17,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1135 transitions, 20110 flow [2023-12-09 15:31:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:31:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:31:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2023-12-09 15:31:17,233 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7943201376936316 [2023-12-09 15:31:17,233 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2023-12-09 15:31:17,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2023-12-09 15:31:17,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:31:17,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2023-12-09 15:31:17,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:17,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 166.0) internal successors, (1328), 8 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:17,237 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 166.0) internal successors, (1328), 8 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:17,237 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 130 predicate places. [2023-12-09 15:31:17,237 INFO L500 AbstractCegarLoop]: Abstraction has has 280 places, 1135 transitions, 20110 flow [2023-12-09 15:31:17,238 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:17,238 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:31:17,238 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:31:17,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 15:31:17,443 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:17,444 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:31:17,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:31:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash 607402708, now seen corresponding path program 1 times [2023-12-09 15:31:17,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:31:17,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310061660] [2023-12-09 15:31:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:17,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:31:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:18,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:31:18,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310061660] [2023-12-09 15:31:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310061660] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:18,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452956291] [2023-12-09 15:31:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:18,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:18,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:31:18,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:31:18,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-09 15:31:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:18,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-09 15:31:18,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:31:19,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:31:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:19,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:31:19,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:31:19,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2023-12-09 15:31:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:20,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452956291] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:31:20,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:31:20,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 12] total 31 [2023-12-09 15:31:20,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795660099] [2023-12-09 15:31:20,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:31:20,311 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-09 15:31:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:31:20,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-09 15:31:20,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2023-12-09 15:31:20,314 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 166 [2023-12-09 15:31:20,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 1135 transitions, 20110 flow. Second operand has 31 states, 31 states have (on average 82.90322580645162) internal successors, (2570), 31 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:20,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:31:20,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 166 [2023-12-09 15:31:20,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:31:29,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L56-3-->L56-4: Formula: (= |v_thread2Thread1of1ForFork2_#t~post3_1| v_thread2Thread1of1ForFork2_~i~1_11) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3][2110], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 29#L56-4true, 3409#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3394#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 4993#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 47#L49-2true, 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 115#L68true, 271#(<= 1 ~N~0), 185#true, 2603#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0))]) [2023-12-09 15:31:29,707 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:31:29,707 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:31:29,707 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:31:29,707 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:31:30,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 |v_thread1Thread1of1ForFork1_#t~post1_1|) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1][771], [thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, 235#true, thread3Thread1of1ForFork0InUse, 3409#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3394#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 145#L48-4true, 4993#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 115#L68true, 271#(<= 1 ~N~0), 185#true, 2603#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 127#L57-2true]) [2023-12-09 15:31:30,018 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2023-12-09 15:31:30,018 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2023-12-09 15:31:30,018 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2023-12-09 15:31:30,018 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2023-12-09 15:31:30,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L56-3-->L56-4: Formula: (= |v_thread2Thread1of1ForFork2_#t~post3_1| v_thread2Thread1of1ForFork2_~i~1_11) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3][2110], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 3409#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 29#L56-4true, 3394#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 80#L48-3true, 4993#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 167#true, 203#true, 57#L85-1true, 115#L68true, 271#(<= 1 ~N~0), 185#true, 2603#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0))]) [2023-12-09 15:31:30,161 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:31:30,161 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:31:30,161 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:31:30,161 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:31:30,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 |v_thread1Thread1of1ForFork1_#t~post1_1|) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1][771], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 3394#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 3409#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 122#L56-3true, 145#L48-4true, 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 4993#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 115#L68true, 271#(<= 1 ~N~0), 185#true, 2603#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0))]) [2023-12-09 15:31:30,161 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:31:30,162 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:31:30,162 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:31:30,162 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:31:31,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L56-3-->L56-4: Formula: (= |v_thread2Thread1of1ForFork2_#t~post3_1| v_thread2Thread1of1ForFork2_~i~1_11) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3][2483], [3408#(<= 1 ~N~0), 1836#(<= 1 ~N~0), thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 29#L56-4true, 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 47#L49-2true, 1041#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 27#L64-7true, 3400#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 4999#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 185#true, 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2)]) [2023-12-09 15:31:31,964 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2023-12-09 15:31:31,964 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-12-09 15:31:31,964 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-12-09 15:31:31,964 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-12-09 15:31:32,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L56-3-->L56-4: Formula: (= |v_thread2Thread1of1ForFork2_#t~post3_1| v_thread2Thread1of1ForFork2_~i~1_11) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3][2483], [1836#(<= 1 ~N~0), 3408#(<= 1 ~N~0), thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 29#L56-4true, 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 80#L48-3true, 1041#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 167#true, 203#true, 57#L85-1true, 27#L64-7true, 185#true, 3400#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 4999#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2)]) [2023-12-09 15:31:32,348 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-12-09 15:31:32,348 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-12-09 15:31:32,348 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-12-09 15:31:32,348 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-12-09 15:31:32,522 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 |v_thread1Thread1of1ForFork1_#t~post1_1|) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1][230], [1836#(<= 1 ~N~0), 3408#(<= 1 ~N~0), thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 145#L48-4true, 122#L56-3true, 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 1041#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 27#L64-7true, 185#true, 4999#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 3400#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2)]) [2023-12-09 15:31:32,522 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is not cut-off event [2023-12-09 15:31:32,522 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2023-12-09 15:31:32,522 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2023-12-09 15:31:32,522 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2023-12-09 15:31:33,371 INFO L124 PetriNetUnfolderBase]: 38087/62760 cut-off events. [2023-12-09 15:31:33,371 INFO L125 PetriNetUnfolderBase]: For 300723/307360 co-relation queries the response was YES. [2023-12-09 15:31:33,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398741 conditions, 62760 events. 38087/62760 cut-off events. For 300723/307360 co-relation queries the response was YES. Maximal size of possible extension queue 2504. Compared 557875 event pairs, 2442 based on Foata normal form. 215/56934 useless extension candidates. Maximal degree in co-relation 362241. Up to 24715 conditions per place. [2023-12-09 15:31:34,338 INFO L140 encePairwiseOnDemand]: 135/166 looper letters, 2026 selfloop transitions, 265 changer transitions 70/2694 dead transitions. [2023-12-09 15:31:34,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 2694 transitions, 50635 flow [2023-12-09 15:31:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-09 15:31:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-12-09 15:31:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3346 transitions. [2023-12-09 15:31:34,343 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5304375396322131 [2023-12-09 15:31:34,343 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3346 transitions. [2023-12-09 15:31:34,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3346 transitions. [2023-12-09 15:31:34,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:31:34,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3346 transitions. [2023-12-09 15:31:34,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 88.05263157894737) internal successors, (3346), 38 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:34,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 166.0) internal successors, (6474), 39 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:34,357 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 166.0) internal successors, (6474), 39 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:34,357 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 167 predicate places. [2023-12-09 15:31:34,357 INFO L500 AbstractCegarLoop]: Abstraction has has 317 places, 2694 transitions, 50635 flow [2023-12-09 15:31:34,358 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 82.90322580645162) internal successors, (2570), 31 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:34,358 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:31:34,358 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:31:34,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-09 15:31:34,564 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-09 15:31:34,564 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:31:34,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:31:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1370539680, now seen corresponding path program 1 times [2023-12-09 15:31:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:31:34,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602112096] [2023-12-09 15:31:34,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:31:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:31:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:31:36,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602112096] [2023-12-09 15:31:36,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602112096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:36,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888361239] [2023-12-09 15:31:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:36,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:36,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:31:36,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:31:36,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-09 15:31:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:37,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-09 15:31:37,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:31:38,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:31:38,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-12-09 15:31:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:31:38,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:31:38,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:31:38,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2023-12-09 15:31:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:31:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888361239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:31:40,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:31:40,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 27, 21] total 73 [2023-12-09 15:31:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006042923] [2023-12-09 15:31:40,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:31:40,233 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-12-09 15:31:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:31:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-12-09 15:31:40,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=4422, Unknown=0, NotChecked=0, Total=5256 [2023-12-09 15:31:40,239 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 166 [2023-12-09 15:31:40,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 2694 transitions, 50635 flow. Second operand has 73 states, 73 states have (on average 50.534246575342465) internal successors, (3689), 73 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:40,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:31:40,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 166 [2023-12-09 15:31:40,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:33,797 INFO L124 PetriNetUnfolderBase]: 88704/137533 cut-off events. [2023-12-09 15:32:33,798 INFO L125 PetriNetUnfolderBase]: For 834161/835731 co-relation queries the response was YES. [2023-12-09 15:32:34,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936524 conditions, 137533 events. 88704/137533 cut-off events. For 834161/835731 co-relation queries the response was YES. Maximal size of possible extension queue 5962. Compared 1247972 event pairs, 7647 based on Foata normal form. 174/126690 useless extension candidates. Maximal degree in co-relation 723102. Up to 59621 conditions per place. [2023-12-09 15:32:36,119 INFO L140 encePairwiseOnDemand]: 116/166 looper letters, 6565 selfloop transitions, 1219 changer transitions 105/7934 dead transitions. [2023-12-09 15:32:36,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 7934 transitions, 159937 flow [2023-12-09 15:32:36,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-12-09 15:32:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2023-12-09 15:32:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 5663 transitions. [2023-12-09 15:32:36,127 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.341144578313253 [2023-12-09 15:32:36,128 INFO L72 ComplementDD]: Start complementDD. Operand 100 states and 5663 transitions. [2023-12-09 15:32:36,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 5663 transitions. [2023-12-09 15:32:36,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:36,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 100 states and 5663 transitions. [2023-12-09 15:32:36,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 101 states, 100 states have (on average 56.63) internal successors, (5663), 100 states have internal predecessors, (5663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:32:36,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 101 states, 101 states have (on average 166.0) internal successors, (16766), 101 states have internal predecessors, (16766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:32:36,158 INFO L81 ComplementDD]: Finished complementDD. Result has 101 states, 101 states have (on average 166.0) internal successors, (16766), 101 states have internal predecessors, (16766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:32:36,159 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 266 predicate places. [2023-12-09 15:32:36,159 INFO L500 AbstractCegarLoop]: Abstraction has has 416 places, 7934 transitions, 159937 flow [2023-12-09 15:32:36,160 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 50.534246575342465) internal successors, (3689), 73 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:32:36,160 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:36,160 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:32:36,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-09 15:32:36,365 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-09 15:32:36,365 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:32:36,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:36,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1698572326, now seen corresponding path program 2 times [2023-12-09 15:32:36,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:36,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687956579] [2023-12-09 15:32:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:32:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687956579] [2023-12-09 15:32:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687956579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:32:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530706134] [2023-12-09 15:32:38,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:32:38,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:32:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:32:38,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:32:38,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-09 15:32:38,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:32:38,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:32:38,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-09 15:32:38,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:32:39,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:32:39,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:32:39,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:32:39,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2023-12-09 15:32:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:40,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:32:40,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:32:40,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 48 [2023-12-09 15:32:40,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-09 15:32:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:41,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530706134] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:32:41,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:32:41,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 26, 25] total 76 [2023-12-09 15:32:41,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080822934] [2023-12-09 15:32:41,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:32:41,872 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-12-09 15:32:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:41,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-12-09 15:32:41,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=689, Invalid=5005, Unknown=6, NotChecked=0, Total=5700 [2023-12-09 15:32:41,877 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 166 [2023-12-09 15:32:41,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 7934 transitions, 159937 flow. Second operand has 76 states, 76 states have (on average 47.43421052631579) internal successors, (3605), 76 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:32:41,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:41,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 166 [2023-12-09 15:32:41,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand