/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/parallel-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:19:08,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:19:08,363 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:19:08,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:19:08,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:19:08,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:19:08,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:19:08,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:19:08,390 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:19:08,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:19:08,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:19:08,393 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:19:08,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:19:08,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:19:08,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:19:08,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:19:08,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:19:08,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:19:08,395 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:19:08,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:19:08,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:19:08,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:19:08,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:19:08,397 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:19:08,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:19:08,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:19:08,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:19:08,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:19:08,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:19:08,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:19:08,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:19:08,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:19:08,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:19:08,399 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:19:08,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:19:08,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:19:08,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:19:08,620 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:19:08,620 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:19:08,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2023-12-09 15:19:09,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:19:09,872 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:19:09,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2023-12-09 15:19:09,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2acdb83/5c07150cd69641dea9d7831d5990b90c/FLAG8d59c76d4 [2023-12-09 15:19:09,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2acdb83/5c07150cd69641dea9d7831d5990b90c [2023-12-09 15:19:09,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:19:09,908 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:19:09,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:19:09,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:19:09,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:19:09,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:19:09" (1/1) ... [2023-12-09 15:19:09,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418f590a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:09, skipping insertion in model container [2023-12-09 15:19:09,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:19:09" (1/1) ... [2023-12-09 15:19:09,943 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:19:10,094 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/parallel-parallel-sum-2.wvr.c[4303,4316] [2023-12-09 15:19:10,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:19:10,115 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:19:10,150 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/parallel-parallel-sum-2.wvr.c[4303,4316] [2023-12-09 15:19:10,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:19:10,162 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:19:10,162 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:19:10,167 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:19:10,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10 WrapperNode [2023-12-09 15:19:10,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:19:10,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:19:10,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:19:10,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:19:10,173 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:19:10" (1/1) ... [2023-12-09 15:19:10,186 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:19:10" (1/1) ... [2023-12-09 15:19:10,225 INFO L138 Inliner]: procedures = 29, calls = 88, calls flagged for inlining = 22, calls inlined = 32, statements flattened = 409 [2023-12-09 15:19:10,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:19:10,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:19:10,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:19:10,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:19:10,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:19:10,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:19:10,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:19:10,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:19:10,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (1/1) ... [2023-12-09 15:19:10,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:19:10,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:10,326 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:19:10,349 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:19:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:19:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:19:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:19:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:19:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:19:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:19:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:19:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:19:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:19:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:19:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-09 15:19:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-09 15:19:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:19:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-12-09 15:19:10,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-12-09 15:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-12-09 15:19:10,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-12-09 15:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:19:10,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:19:10,359 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:19:10,450 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:19:10,451 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:19:10,814 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:19:10,919 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:19:10,920 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-09 15:19:10,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:19:10 BoogieIcfgContainer [2023-12-09 15:19:10,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:19:10,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:19:10,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:19:10,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:19:10,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:19:09" (1/3) ... [2023-12-09 15:19:10,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404943aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:19:10, skipping insertion in model container [2023-12-09 15:19:10,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:10" (2/3) ... [2023-12-09 15:19:10,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404943aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:19:10, skipping insertion in model container [2023-12-09 15:19:10,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:19:10" (3/3) ... [2023-12-09 15:19:10,926 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2023-12-09 15:19:10,940 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:19:10,940 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:19:10,940 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:19:11,089 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-12-09 15:19:11,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 331 transitions, 728 flow [2023-12-09 15:19:11,241 INFO L124 PetriNetUnfolderBase]: 21/285 cut-off events. [2023-12-09 15:19:11,242 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-09 15:19:11,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 285 events. 21/285 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 325 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 243. Up to 3 conditions per place. [2023-12-09 15:19:11,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 331 transitions, 728 flow [2023-12-09 15:19:11,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 276 transitions, 600 flow [2023-12-09 15:19:11,268 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:19:11,273 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;@1d31dd73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:19:11,274 INFO L363 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-12-09 15:19:11,319 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:19:11,319 INFO L124 PetriNetUnfolderBase]: 21/275 cut-off events. [2023-12-09 15:19:11,319 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-09 15:19:11,319 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:11,320 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:11,320 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:11,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash 864518925, now seen corresponding path program 1 times [2023-12-09 15:19:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:11,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561474504] [2023-12-09 15:19:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:11,617 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:19:11,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:11,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561474504] [2023-12-09 15:19:11,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561474504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:11,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:11,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 15:19:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861395964] [2023-12-09 15:19:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:11,626 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 15:19:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 15:19:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 15:19:11,649 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 335 [2023-12-09 15:19:11,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 600 flow. Second operand has 2 states, 2 states have (on average 293.0) internal successors, (586), 2 states have internal predecessors, (586), 0 states have call successors, (0), 0 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:19:11,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:11,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 335 [2023-12-09 15:19:11,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:12,313 INFO L124 PetriNetUnfolderBase]: 1314/3588 cut-off events. [2023-12-09 15:19:12,313 INFO L125 PetriNetUnfolderBase]: For 1072/1072 co-relation queries the response was YES. [2023-12-09 15:19:12,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6155 conditions, 3588 events. 1314/3588 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 26010 event pairs, 568 based on Foata normal form. 606/3559 useless extension candidates. Maximal degree in co-relation 5796. Up to 1657 conditions per place. [2023-12-09 15:19:12,350 INFO L140 encePairwiseOnDemand]: 323/335 looper letters, 26 selfloop transitions, 0 changer transitions 5/264 dead transitions. [2023-12-09 15:19:12,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 264 transitions, 628 flow [2023-12-09 15:19:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 15:19:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 15:19:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 606 transitions. [2023-12-09 15:19:12,365 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9044776119402985 [2023-12-09 15:19:12,366 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 606 transitions. [2023-12-09 15:19:12,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 606 transitions. [2023-12-09 15:19:12,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:12,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 606 transitions. [2023-12-09 15:19:12,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 303.0) internal successors, (606), 2 states have internal predecessors, (606), 0 states have call successors, (0), 0 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:19:12,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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:19:12,377 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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:19:12,380 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 1 predicate places. [2023-12-09 15:19:12,381 INFO L500 AbstractCegarLoop]: Abstraction has has 275 places, 264 transitions, 628 flow [2023-12-09 15:19:12,381 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 293.0) internal successors, (586), 2 states have internal predecessors, (586), 0 states have call successors, (0), 0 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:19:12,381 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:12,381 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:12,382 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:19:12,382 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:12,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1336876846, now seen corresponding path program 1 times [2023-12-09 15:19:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381650407] [2023-12-09 15:19:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:13,502 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:19:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381650407] [2023-12-09 15:19:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381650407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:13,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-09 15:19:13,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144547258] [2023-12-09 15:19:13,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:13,504 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-09 15:19:13,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-09 15:19:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-09 15:19:13,507 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 335 [2023-12-09 15:19:13,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 264 transitions, 628 flow. Second operand has 13 states, 13 states have (on average 218.6153846153846) internal successors, (2842), 13 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:19:13,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:13,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 335 [2023-12-09 15:19:13,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:15,146 INFO L124 PetriNetUnfolderBase]: 3012/7511 cut-off events. [2023-12-09 15:19:15,146 INFO L125 PetriNetUnfolderBase]: For 4416/4768 co-relation queries the response was YES. [2023-12-09 15:19:15,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 7511 events. 3012/7511 cut-off events. For 4416/4768 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 61828 event pairs, 668 based on Foata normal form. 116/6486 useless extension candidates. Maximal degree in co-relation 13142. Up to 3651 conditions per place. [2023-12-09 15:19:15,197 INFO L140 encePairwiseOnDemand]: 316/335 looper letters, 120 selfloop transitions, 9 changer transitions 112/410 dead transitions. [2023-12-09 15:19:15,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 410 transitions, 1792 flow [2023-12-09 15:19:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-09 15:19:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-09 15:19:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4294 transitions. [2023-12-09 15:19:15,204 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6746268656716418 [2023-12-09 15:19:15,204 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4294 transitions. [2023-12-09 15:19:15,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4294 transitions. [2023-12-09 15:19:15,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:15,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4294 transitions. [2023-12-09 15:19:15,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 226.0) internal successors, (4294), 19 states have internal predecessors, (4294), 0 states have call successors, (0), 0 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:19:15,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 335.0) internal successors, (6700), 20 states have internal predecessors, (6700), 0 states have call successors, (0), 0 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:19:15,224 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 335.0) internal successors, (6700), 20 states have internal predecessors, (6700), 0 states have call successors, (0), 0 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:19:15,225 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 19 predicate places. [2023-12-09 15:19:15,225 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 410 transitions, 1792 flow [2023-12-09 15:19:15,226 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 218.6153846153846) internal successors, (2842), 13 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:19:15,226 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:15,227 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:15,227 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:19:15,227 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:15,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2053968197, now seen corresponding path program 1 times [2023-12-09 15:19:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39768065] [2023-12-09 15:19:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:19:15,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39768065] [2023-12-09 15:19:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39768065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:15,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:15,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:19:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146950454] [2023-12-09 15:19:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:15,861 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:19:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:19:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:19:15,863 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 335 [2023-12-09 15:19:15,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 410 transitions, 1792 flow. Second operand has 10 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 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:19:15,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:15,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 335 [2023-12-09 15:19:15,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:17,553 INFO L124 PetriNetUnfolderBase]: 3693/9335 cut-off events. [2023-12-09 15:19:17,553 INFO L125 PetriNetUnfolderBase]: For 9643/10971 co-relation queries the response was YES. [2023-12-09 15:19:17,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26038 conditions, 9335 events. 3693/9335 cut-off events. For 9643/10971 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 82045 event pairs, 468 based on Foata normal form. 81/7982 useless extension candidates. Maximal degree in co-relation 19846. Up to 4484 conditions per place. [2023-12-09 15:19:17,621 INFO L140 encePairwiseOnDemand]: 317/335 looper letters, 124 selfloop transitions, 12 changer transitions 161/499 dead transitions. [2023-12-09 15:19:17,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 499 transitions, 3002 flow [2023-12-09 15:19:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-09 15:19:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-12-09 15:19:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3485 transitions. [2023-12-09 15:19:17,626 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7430703624733476 [2023-12-09 15:19:17,626 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3485 transitions. [2023-12-09 15:19:17,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3485 transitions. [2023-12-09 15:19:17,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:17,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3485 transitions. [2023-12-09 15:19:17,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 248.92857142857142) internal successors, (3485), 14 states have internal predecessors, (3485), 0 states have call successors, (0), 0 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:19:17,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 0 states have call successors, (0), 0 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:19:17,639 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 0 states have call successors, (0), 0 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:19:17,639 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 32 predicate places. [2023-12-09 15:19:17,639 INFO L500 AbstractCegarLoop]: Abstraction has has 306 places, 499 transitions, 3002 flow [2023-12-09 15:19:17,640 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 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:19:17,640 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:17,640 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:17,640 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:19:17,641 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:17,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash -748075625, now seen corresponding path program 2 times [2023-12-09 15:19:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119960650] [2023-12-09 15:19:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:19:18,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:18,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119960650] [2023-12-09 15:19:18,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119960650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:18,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:18,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:19:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179841461] [2023-12-09 15:19:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:18,117 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:19:18,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:18,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:19:18,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:19:18,119 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 335 [2023-12-09 15:19:18,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 499 transitions, 3002 flow. Second operand has 10 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 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:19:18,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:18,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 335 [2023-12-09 15:19:18,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:19,835 INFO L124 PetriNetUnfolderBase]: 3693/9307 cut-off events. [2023-12-09 15:19:19,835 INFO L125 PetriNetUnfolderBase]: For 15216/16958 co-relation queries the response was YES. [2023-12-09 15:19:19,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30556 conditions, 9307 events. 3693/9307 cut-off events. For 15216/16958 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 81777 event pairs, 465 based on Foata normal form. 104/7994 useless extension candidates. Maximal degree in co-relation 23374. Up to 4484 conditions per place. [2023-12-09 15:19:19,906 INFO L140 encePairwiseOnDemand]: 317/335 looper letters, 123 selfloop transitions, 14 changer transitions 169/508 dead transitions. [2023-12-09 15:19:19,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 508 transitions, 3673 flow [2023-12-09 15:19:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-09 15:19:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-12-09 15:19:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3482 transitions. [2023-12-09 15:19:19,912 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7424307036247335 [2023-12-09 15:19:19,912 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3482 transitions. [2023-12-09 15:19:19,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3482 transitions. [2023-12-09 15:19:19,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:19,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3482 transitions. [2023-12-09 15:19:19,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 248.71428571428572) internal successors, (3482), 14 states have internal predecessors, (3482), 0 states have call successors, (0), 0 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:19:19,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 0 states have call successors, (0), 0 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:19:19,926 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 0 states have call successors, (0), 0 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:19:19,927 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 45 predicate places. [2023-12-09 15:19:19,927 INFO L500 AbstractCegarLoop]: Abstraction has has 319 places, 508 transitions, 3673 flow [2023-12-09 15:19:19,928 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 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:19:19,928 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:19,928 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:19,928 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:19:19,929 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:19,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -856657859, now seen corresponding path program 1 times [2023-12-09 15:19:19,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:19,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639980754] [2023-12-09 15:19:19,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639980754] [2023-12-09 15:19:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639980754] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:20,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218718385] [2023-12-09 15:19:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:20,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:19:20,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:20,439 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:19:20,443 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:19:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:20,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-09 15:19:20,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:19:21,029 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:19:21,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:19:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:19:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218718385] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:19:21,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 8] total 23 [2023-12-09 15:19:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115531248] [2023-12-09 15:19:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:21,210 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:19:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:19:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2023-12-09 15:19:21,212 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 335 [2023-12-09 15:19:21,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 508 transitions, 3673 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 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:19:21,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:21,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 335 [2023-12-09 15:19:21,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:23,102 INFO L124 PetriNetUnfolderBase]: 5246/12030 cut-off events. [2023-12-09 15:19:23,102 INFO L125 PetriNetUnfolderBase]: For 34440/36494 co-relation queries the response was YES. [2023-12-09 15:19:23,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47505 conditions, 12030 events. 5246/12030 cut-off events. For 34440/36494 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 105835 event pairs, 457 based on Foata normal form. 6/10191 useless extension candidates. Maximal degree in co-relation 37745. Up to 6007 conditions per place. [2023-12-09 15:19:23,219 INFO L140 encePairwiseOnDemand]: 319/335 looper letters, 247 selfloop transitions, 18 changer transitions 275/737 dead transitions. [2023-12-09 15:19:23,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 737 transitions, 7173 flow [2023-12-09 15:19:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:19:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:19:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2735 transitions. [2023-12-09 15:19:23,223 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7421981004070556 [2023-12-09 15:19:23,224 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2735 transitions. [2023-12-09 15:19:23,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2735 transitions. [2023-12-09 15:19:23,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:23,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2735 transitions. [2023-12-09 15:19:23,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 248.63636363636363) internal successors, (2735), 11 states have internal predecessors, (2735), 0 states have call successors, (0), 0 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:19:23,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 335.0) internal successors, (4020), 12 states have internal predecessors, (4020), 0 states have call successors, (0), 0 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:19:23,244 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 335.0) internal successors, (4020), 12 states have internal predecessors, (4020), 0 states have call successors, (0), 0 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:19:23,245 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 55 predicate places. [2023-12-09 15:19:23,246 INFO L500 AbstractCegarLoop]: Abstraction has has 329 places, 737 transitions, 7173 flow [2023-12-09 15:19:23,246 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 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:19:23,246 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:23,246 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:19:23,452 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:19:23,453 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:23,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash 36927202, now seen corresponding path program 1 times [2023-12-09 15:19:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052926587] [2023-12-09 15:19:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:24,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:24,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052926587] [2023-12-09 15:19:24,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052926587] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:24,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441853496] [2023-12-09 15:19:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:24,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:19:24,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:24,153 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:19:24,181 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:19:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:24,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-09 15:19:24,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:19:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:19:24,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:19:24,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441853496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:24,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:19:24,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-12-09 15:19:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350595837] [2023-12-09 15:19:24,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:24,592 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:19:24,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:24,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:19:24,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:19:24,594 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 335 [2023-12-09 15:19:24,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 737 transitions, 7173 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 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:19:24,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:24,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 335 [2023-12-09 15:19:24,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:26,725 INFO L124 PetriNetUnfolderBase]: 5223/11423 cut-off events. [2023-12-09 15:19:26,725 INFO L125 PetriNetUnfolderBase]: For 40340/42037 co-relation queries the response was YES. [2023-12-09 15:19:26,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53871 conditions, 11423 events. 5223/11423 cut-off events. For 40340/42037 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 96557 event pairs, 395 based on Foata normal form. 63/9793 useless extension candidates. Maximal degree in co-relation 42735. Up to 6522 conditions per place. [2023-12-09 15:19:26,944 INFO L140 encePairwiseOnDemand]: 315/335 looper letters, 276 selfloop transitions, 15 changer transitions 353/841 dead transitions. [2023-12-09 15:19:26,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 841 transitions, 9780 flow [2023-12-09 15:19:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:19:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:19:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3644 transitions. [2023-12-09 15:19:26,950 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7251741293532338 [2023-12-09 15:19:26,950 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3644 transitions. [2023-12-09 15:19:26,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3644 transitions. [2023-12-09 15:19:26,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:26,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3644 transitions. [2023-12-09 15:19:26,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 242.93333333333334) internal successors, (3644), 15 states have internal predecessors, (3644), 0 states have call successors, (0), 0 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:19:26,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 335.0) internal successors, (5360), 16 states have internal predecessors, (5360), 0 states have call successors, (0), 0 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:19:26,962 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 335.0) internal successors, (5360), 16 states have internal predecessors, (5360), 0 states have call successors, (0), 0 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:19:26,963 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 69 predicate places. [2023-12-09 15:19:26,963 INFO L500 AbstractCegarLoop]: Abstraction has has 343 places, 841 transitions, 9780 flow [2023-12-09 15:19:26,964 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 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:19:26,964 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:26,964 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:26,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:19:27,170 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:19:27,171 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:27,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1884158370, now seen corresponding path program 2 times [2023-12-09 15:19:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054164357] [2023-12-09 15:19:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054164357] [2023-12-09 15:19:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054164357] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167812346] [2023-12-09 15:19:27,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:19:27,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:19:27,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:27,629 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:19:27,652 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:19:27,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:19:27,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:19:27,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-09 15:19:27,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:19:28,162 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:19:28,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:19:28,349 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:19:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167812346] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:19:28,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:19:28,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 23 [2023-12-09 15:19:28,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857841675] [2023-12-09 15:19:28,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:19:28,351 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-09 15:19:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-09 15:19:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-12-09 15:19:28,356 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 335 [2023-12-09 15:19:28,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 841 transitions, 9780 flow. Second operand has 23 states, 23 states have (on average 219.30434782608697) internal successors, (5044), 23 states have internal predecessors, (5044), 0 states have call successors, (0), 0 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:19:28,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:28,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 335 [2023-12-09 15:19:28,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:31,665 INFO L124 PetriNetUnfolderBase]: 4790/11155 cut-off events. [2023-12-09 15:19:31,665 INFO L125 PetriNetUnfolderBase]: For 46375/49204 co-relation queries the response was YES. [2023-12-09 15:19:31,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57072 conditions, 11155 events. 4790/11155 cut-off events. For 46375/49204 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 95899 event pairs, 433 based on Foata normal form. 250/9773 useless extension candidates. Maximal degree in co-relation 49582. Up to 5690 conditions per place. [2023-12-09 15:19:31,770 INFO L140 encePairwiseOnDemand]: 301/335 looper letters, 248 selfloop transitions, 34 changer transitions 468/923 dead transitions. [2023-12-09 15:19:31,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 923 transitions, 12338 flow [2023-12-09 15:19:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-09 15:19:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-12-09 15:19:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 8190 transitions. [2023-12-09 15:19:31,782 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6607503025413474 [2023-12-09 15:19:31,782 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 8190 transitions. [2023-12-09 15:19:31,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 8190 transitions. [2023-12-09 15:19:31,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:31,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 8190 transitions. [2023-12-09 15:19:31,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 221.35135135135135) internal successors, (8190), 37 states have internal predecessors, (8190), 0 states have call successors, (0), 0 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:19:31,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 335.0) internal successors, (12730), 38 states have internal predecessors, (12730), 0 states have call successors, (0), 0 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:19:31,808 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 335.0) internal successors, (12730), 38 states have internal predecessors, (12730), 0 states have call successors, (0), 0 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:19:31,809 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 102 predicate places. [2023-12-09 15:19:31,809 INFO L500 AbstractCegarLoop]: Abstraction has has 376 places, 923 transitions, 12338 flow [2023-12-09 15:19:31,810 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 219.30434782608697) internal successors, (5044), 23 states have internal predecessors, (5044), 0 states have call successors, (0), 0 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:19:31,810 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:31,810 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:31,830 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:19:32,015 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:19:32,016 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:32,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 671877501, now seen corresponding path program 3 times [2023-12-09 15:19:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732977417] [2023-12-09 15:19:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732977417] [2023-12-09 15:19:32,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732977417] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812096065] [2023-12-09 15:19:32,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:19:32,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:19:32,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:32,640 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:19:32,660 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:19:32,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:19:32,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:19:32,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-09 15:19:32,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:19:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:19:33,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:19:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812096065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:19:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-12-09 15:19:33,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713225123] [2023-12-09 15:19:33,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:33,083 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:19:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:33,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:19:33,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-12-09 15:19:33,085 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 335 [2023-12-09 15:19:33,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 923 transitions, 12338 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 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:19:33,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:33,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 335 [2023-12-09 15:19:33,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:35,190 INFO L124 PetriNetUnfolderBase]: 4580/10550 cut-off events. [2023-12-09 15:19:35,191 INFO L125 PetriNetUnfolderBase]: For 51134/54151 co-relation queries the response was YES. [2023-12-09 15:19:35,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60756 conditions, 10550 events. 4580/10550 cut-off events. For 51134/54151 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 89062 event pairs, 391 based on Foata normal form. 111/9148 useless extension candidates. Maximal degree in co-relation 52590. Up to 5385 conditions per place. [2023-12-09 15:19:35,286 INFO L140 encePairwiseOnDemand]: 314/335 looper letters, 188 selfloop transitions, 12 changer transitions 535/936 dead transitions. [2023-12-09 15:19:35,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 936 transitions, 14049 flow [2023-12-09 15:19:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:19:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:19:35,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2941 transitions. [2023-12-09 15:19:35,289 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7315920398009951 [2023-12-09 15:19:35,289 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2941 transitions. [2023-12-09 15:19:35,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2941 transitions. [2023-12-09 15:19:35,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:35,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2941 transitions. [2023-12-09 15:19:35,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 245.08333333333334) internal successors, (2941), 12 states have internal predecessors, (2941), 0 states have call successors, (0), 0 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:19:35,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 335.0) internal successors, (4355), 13 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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:19:35,295 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 335.0) internal successors, (4355), 13 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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:19:35,295 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 112 predicate places. [2023-12-09 15:19:35,295 INFO L500 AbstractCegarLoop]: Abstraction has has 386 places, 936 transitions, 14049 flow [2023-12-09 15:19:35,296 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 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:19:35,296 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:35,296 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:35,304 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:19:35,504 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:19:35,505 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:35,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:35,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1106664551, now seen corresponding path program 1 times [2023-12-09 15:19:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:35,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20421448] [2023-12-09 15:19:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:36,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:36,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20421448] [2023-12-09 15:19:36,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20421448] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:36,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751018282] [2023-12-09 15:19:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:36,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:19:36,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:36,034 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:19:36,035 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:19:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:36,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-09 15:19:36,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:19:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:19:36,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:19:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751018282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:19:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-12-09 15:19:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363079801] [2023-12-09 15:19:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:36,708 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:19:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:19:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2023-12-09 15:19:36,710 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 335 [2023-12-09 15:19:36,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 936 transitions, 14049 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 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:19:36,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:36,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 335 [2023-12-09 15:19:36,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:39,298 INFO L124 PetriNetUnfolderBase]: 5005/12038 cut-off events. [2023-12-09 15:19:39,298 INFO L125 PetriNetUnfolderBase]: For 75069/79282 co-relation queries the response was YES. [2023-12-09 15:19:39,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73103 conditions, 12038 events. 5005/12038 cut-off events. For 75069/79282 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 106618 event pairs, 266 based on Foata normal form. 49/10420 useless extension candidates. Maximal degree in co-relation 63998. Up to 5874 conditions per place. [2023-12-09 15:19:39,408 INFO L140 encePairwiseOnDemand]: 315/335 looper letters, 255 selfloop transitions, 18 changer transitions 624/1100 dead transitions. [2023-12-09 15:19:39,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1100 transitions, 18618 flow [2023-12-09 15:19:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:19:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 15:19:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3190 transitions. [2023-12-09 15:19:39,410 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7324913892078071 [2023-12-09 15:19:39,411 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3190 transitions. [2023-12-09 15:19:39,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3190 transitions. [2023-12-09 15:19:39,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:39,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3190 transitions. [2023-12-09 15:19:39,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 245.3846153846154) internal successors, (3190), 13 states have internal predecessors, (3190), 0 states have call successors, (0), 0 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:19:39,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 335.0) internal successors, (4690), 14 states have internal predecessors, (4690), 0 states have call successors, (0), 0 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:19:39,418 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 335.0) internal successors, (4690), 14 states have internal predecessors, (4690), 0 states have call successors, (0), 0 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:19:39,418 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 124 predicate places. [2023-12-09 15:19:39,418 INFO L500 AbstractCegarLoop]: Abstraction has has 398 places, 1100 transitions, 18618 flow [2023-12-09 15:19:39,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 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:19:39,419 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:39,419 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:39,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-09 15:19:39,627 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:19:39,628 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:39,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash -338035767, now seen corresponding path program 2 times [2023-12-09 15:19:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943518348] [2023-12-09 15:19:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:19:40,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943518348] [2023-12-09 15:19:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943518348] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849424016] [2023-12-09 15:19:40,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:19:40,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:19:40,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:40,121 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:19:40,123 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:19:40,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:19:40,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:19:40,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-09 15:19:40,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:19:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:19:40,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:19:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:19:40,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849424016] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:40,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:19:40,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 35 [2023-12-09 15:19:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024434377] [2023-12-09 15:19:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:40,912 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-09 15:19:40,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-09 15:19:40,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2023-12-09 15:19:40,915 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 335 [2023-12-09 15:19:40,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 1100 transitions, 18618 flow. Second operand has 13 states, 13 states have (on average 226.84615384615384) internal successors, (2949), 13 states have internal predecessors, (2949), 0 states have call successors, (0), 0 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:19:40,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:40,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 335 [2023-12-09 15:19:40,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:43,978 INFO L124 PetriNetUnfolderBase]: 5087/11584 cut-off events. [2023-12-09 15:19:43,978 INFO L125 PetriNetUnfolderBase]: For 90712/95272 co-relation queries the response was YES. [2023-12-09 15:19:44,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80443 conditions, 11584 events. 5087/11584 cut-off events. For 90712/95272 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 99773 event pairs, 175 based on Foata normal form. 114/10067 useless extension candidates. Maximal degree in co-relation 71202. Up to 6109 conditions per place. [2023-12-09 15:19:44,115 INFO L140 encePairwiseOnDemand]: 310/335 looper letters, 224 selfloop transitions, 20 changer transitions 812/1238 dead transitions. [2023-12-09 15:19:44,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 1238 transitions, 23521 flow [2023-12-09 15:19:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-09 15:19:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-09 15:19:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4407 transitions. [2023-12-09 15:19:44,119 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6923802042419481 [2023-12-09 15:19:44,119 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4407 transitions. [2023-12-09 15:19:44,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4407 transitions. [2023-12-09 15:19:44,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:44,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4407 transitions. [2023-12-09 15:19:44,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 231.94736842105263) internal successors, (4407), 19 states have internal predecessors, (4407), 0 states have call successors, (0), 0 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:19:44,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 335.0) internal successors, (6700), 20 states have internal predecessors, (6700), 0 states have call successors, (0), 0 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:19:44,139 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 335.0) internal successors, (6700), 20 states have internal predecessors, (6700), 0 states have call successors, (0), 0 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:19:44,139 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 142 predicate places. [2023-12-09 15:19:44,140 INFO L500 AbstractCegarLoop]: Abstraction has has 416 places, 1238 transitions, 23521 flow [2023-12-09 15:19:44,140 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 226.84615384615384) internal successors, (2949), 13 states have internal predecessors, (2949), 0 states have call successors, (0), 0 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:19:44,140 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:44,141 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-09 15:19:44,349 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:19:44,349 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:19:44,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash -398408715, now seen corresponding path program 1 times [2023-12-09 15:19:44,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:44,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532082880] [2023-12-09 15:19:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532082880] [2023-12-09 15:19:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532082880] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541417620] [2023-12-09 15:19:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:47,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:19:47,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:47,004 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:19:47,005 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:19:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:47,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-09 15:19:47,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:19:48,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:19:48,949 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:19:49,679 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:19:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:49,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:19:50,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:19:50,238 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 62 treesize of output 43 [2023-12-09 15:19:50,242 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 20 treesize of output 13 [2023-12-09 15:19:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541417620] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:19:51,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:19:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 29] total 84 [2023-12-09 15:19:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079760143] [2023-12-09 15:19:51,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:19:51,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-12-09 15:19:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-12-09 15:19:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=6538, Unknown=1, NotChecked=0, Total=6972 [2023-12-09 15:19:51,329 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 335 [2023-12-09 15:19:51,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 1238 transitions, 23521 flow. Second operand has 84 states, 84 states have (on average 163.08333333333334) internal successors, (13699), 84 states have internal predecessors, (13699), 0 states have call successors, (0), 0 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:19:51,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:51,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 335 [2023-12-09 15:19:51,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:04,607 INFO L124 PetriNetUnfolderBase]: 107459/204140 cut-off events. [2023-12-09 15:21:04,607 INFO L125 PetriNetUnfolderBase]: For 1851564/1885307 co-relation queries the response was YES. [2023-12-09 15:21:07,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298919 conditions, 204140 events. 107459/204140 cut-off events. For 1851564/1885307 co-relation queries the response was YES. Maximal size of possible extension queue 4484. Compared 2284713 event pairs, 4518 based on Foata normal form. 1058/186278 useless extension candidates. Maximal degree in co-relation 744495. Up to 87226 conditions per place. [2023-12-09 15:21:09,351 INFO L140 encePairwiseOnDemand]: 270/335 looper letters, 1256 selfloop transitions, 314 changer transitions 3727/5425 dead transitions. [2023-12-09 15:21:09,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 5425 transitions, 112148 flow [2023-12-09 15:21:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2023-12-09 15:21:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2023-12-09 15:21:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 25415 transitions. [2023-12-09 15:21:09,393 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5160930043659254 [2023-12-09 15:21:09,393 INFO L72 ComplementDD]: Start complementDD. Operand 147 states and 25415 transitions. [2023-12-09 15:21:09,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 25415 transitions. [2023-12-09 15:21:09,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:09,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 147 states and 25415 transitions. [2023-12-09 15:21:09,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 148 states, 147 states have (on average 172.89115646258503) internal successors, (25415), 147 states have internal predecessors, (25415), 0 states have call successors, (0), 0 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:21:09,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 148 states, 148 states have (on average 335.0) internal successors, (49580), 148 states have internal predecessors, (49580), 0 states have call successors, (0), 0 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:21:09,557 INFO L81 ComplementDD]: Finished complementDD. Result has 148 states, 148 states have (on average 335.0) internal successors, (49580), 148 states have internal predecessors, (49580), 0 states have call successors, (0), 0 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:21:09,557 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 288 predicate places. [2023-12-09 15:21:09,557 INFO L500 AbstractCegarLoop]: Abstraction has has 562 places, 5425 transitions, 112148 flow [2023-12-09 15:21:09,559 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 163.08333333333334) internal successors, (13699), 84 states have internal predecessors, (13699), 0 states have call successors, (0), 0 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:21:09,559 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:09,559 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,579 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:21:09,760 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:21:09,761 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-09 15:21:09,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1209050500, now seen corresponding path program 1 times [2023-12-09 15:21:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:09,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845801728] [2023-12-09 15:21:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:09,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:21:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845801728] [2023-12-09 15:21:10,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845801728] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:21:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628271817] [2023-12-09 15:21:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:21:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:21:10,936 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:21:10,964 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:21:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:11,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-09 15:21:11,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:21:12,602 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:21:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:13,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:21:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:21:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628271817] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:21:14,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:21:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 33, 19] total 54 [2023-12-09 15:21:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350263053] [2023-12-09 15:21:14,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:21:14,120 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-09 15:21:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:14,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-09 15:21:14,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2580, Unknown=0, NotChecked=0, Total=2862 [2023-12-09 15:21:14,126 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 335 [2023-12-09 15:21:14,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 5425 transitions, 112148 flow. Second operand has 54 states, 54 states have (on average 177.5185185185185) internal successors, (9586), 54 states have internal predecessors, (9586), 0 states have call successors, (0), 0 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:21:14,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:14,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 335 [2023-12-09 15:21:14,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand