/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:22:40,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:22:40,924 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:22:40,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:22:40,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:22:40,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:22:40,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:22:40,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:22:40,959 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:22:40,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:22:40,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:22:40,964 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:22:40,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:22:40,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:22:40,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:22:40,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:22:40,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:22:40,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:22:40,966 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:22:40,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:22:40,967 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:22:40,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:22:40,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:22:40,968 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:22:40,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:22:40,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:22:40,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:22:40,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:22:40,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:22:40,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:22:40,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:22:40,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:22:40,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:22:40,971 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:22:41,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:22:41,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:22:41,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:22:41,260 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:22:41,261 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:22:41,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-12-09 15:22:42,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:22:42,613 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:22:42,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-12-09 15:22:42,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/494c593ca/21ea40602b394989bd782811d14b6816/FLAGd92e169d9 [2023-12-09 15:22:42,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/494c593ca/21ea40602b394989bd782811d14b6816 [2023-12-09 15:22:42,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:22:42,632 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:22:42,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:22:42,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:22:42,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:22:42,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4572f94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42, skipping insertion in model container [2023-12-09 15:22:42,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,663 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:22:42,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4643,4656] [2023-12-09 15:22:42,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:22:42,812 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:22:42,836 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4643,4656] [2023-12-09 15:22:42,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:22:42,846 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:22:42,847 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:22:42,853 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:22:42,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42 WrapperNode [2023-12-09 15:22:42,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:22:42,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:22:42,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:22:42,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:22:42,860 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:22:42" (1/1) ... [2023-12-09 15:22:42,868 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:22:42" (1/1) ... [2023-12-09 15:22:42,916 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 352 [2023-12-09 15:22:42,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:22:42,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:22:42,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:22:42,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:22:42,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:22:42,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:22:42,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:22:42,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:22:42,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (1/1) ... [2023-12-09 15:22:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:22:42,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:22:43,005 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:22:43,025 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:22:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:22:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:22:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:22:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:22:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:22:43,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:22:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:22:43,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:22:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:22:43,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:22:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:22:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:22:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:22:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:22:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:22:43,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:22:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:22:43,039 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:22:43,151 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:22:43,153 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:22:43,637 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:22:43,819 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:22:43,820 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-09 15:22:43,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:22:43 BoogieIcfgContainer [2023-12-09 15:22:43,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:22:43,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:22:43,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:22:43,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:22:43,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:22:42" (1/3) ... [2023-12-09 15:22:43,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58fa0d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:22:43, skipping insertion in model container [2023-12-09 15:22:43,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:22:42" (2/3) ... [2023-12-09 15:22:43,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58fa0d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:22:43, skipping insertion in model container [2023-12-09 15:22:43,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:22:43" (3/3) ... [2023-12-09 15:22:43,829 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-12-09 15:22:43,844 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:22:43,844 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:22:43,844 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:22:43,923 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:22:43,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 270 transitions, 561 flow [2023-12-09 15:22:44,106 INFO L124 PetriNetUnfolderBase]: 19/267 cut-off events. [2023-12-09 15:22:44,107 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:22:44,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 267 events. 19/267 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 153 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 228. Up to 2 conditions per place. [2023-12-09 15:22:44,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 270 transitions, 561 flow [2023-12-09 15:22:44,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 256 transitions, 530 flow [2023-12-09 15:22:44,128 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:22:44,133 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;@4dd0e4c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:22:44,133 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:22:44,183 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:22:44,183 INFO L124 PetriNetUnfolderBase]: 19/255 cut-off events. [2023-12-09 15:22:44,183 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:22:44,183 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:44,184 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] [2023-12-09 15:22:44,185 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:44,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1899501368, now seen corresponding path program 1 times [2023-12-09 15:22:44,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:44,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871320799] [2023-12-09 15:22:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:44,568 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:22:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871320799] [2023-12-09 15:22:44,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871320799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:44,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:44,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 15:22:44,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288075904] [2023-12-09 15:22:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:44,580 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 15:22:44,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 15:22:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 15:22:44,609 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 270 [2023-12-09 15:22:44,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 256 transitions, 530 flow. Second operand has 2 states, 2 states have (on average 246.5) internal successors, (493), 2 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:22:44,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:44,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 270 [2023-12-09 15:22:44,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:44,870 INFO L124 PetriNetUnfolderBase]: 157/725 cut-off events. [2023-12-09 15:22:44,870 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-12-09 15:22:44,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 725 events. 157/725 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3319 event pairs, 86 based on Foata normal form. 114/777 useless extension candidates. Maximal degree in co-relation 755. Up to 230 conditions per place. [2023-12-09 15:22:44,880 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 14 selfloop transitions, 0 changer transitions 7/243 dead transitions. [2023-12-09 15:22:44,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 243 transitions, 532 flow [2023-12-09 15:22:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 15:22:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 15:22:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 511 transitions. [2023-12-09 15:22:44,897 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9462962962962963 [2023-12-09 15:22:44,898 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 511 transitions. [2023-12-09 15:22:44,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 511 transitions. [2023-12-09 15:22:44,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:44,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 511 transitions. [2023-12-09 15:22:44,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 255.5) internal successors, (511), 2 states have internal predecessors, (511), 0 states have call successors, (0), 0 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:22:44,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 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:22:44,912 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 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:22:44,917 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 1 predicate places. [2023-12-09 15:22:44,918 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 532 flow [2023-12-09 15:22:44,918 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 246.5) internal successors, (493), 2 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:22:44,919 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:44,919 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] [2023-12-09 15:22:44,919 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:22:44,921 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:44,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1429981142, now seen corresponding path program 1 times [2023-12-09 15:22:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141710797] [2023-12-09 15:22:44,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:44,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:45,536 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:22:45,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:45,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141710797] [2023-12-09 15:22:45,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141710797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:45,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:45,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:22:45,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23486758] [2023-12-09 15:22:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:45,539 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:22:45,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:45,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:22:45,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:22:45,542 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 270 [2023-12-09 15:22:45,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 243 transitions, 532 flow. Second operand has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 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:22:45,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:45,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 270 [2023-12-09 15:22:45,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:45,802 INFO L124 PetriNetUnfolderBase]: 170/782 cut-off events. [2023-12-09 15:22:45,802 INFO L125 PetriNetUnfolderBase]: For 215/243 co-relation queries the response was YES. [2023-12-09 15:22:45,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 782 events. 170/782 cut-off events. For 215/243 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3808 event pairs, 39 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 1032. Up to 252 conditions per place. [2023-12-09 15:22:45,809 INFO L140 encePairwiseOnDemand]: 256/270 looper letters, 62 selfloop transitions, 4 changer transitions 12/256 dead transitions. [2023-12-09 15:22:45,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 256 transitions, 747 flow [2023-12-09 15:22:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:22:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:22:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1416 transitions. [2023-12-09 15:22:45,832 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7492063492063492 [2023-12-09 15:22:45,832 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1416 transitions. [2023-12-09 15:22:45,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1416 transitions. [2023-12-09 15:22:45,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:45,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1416 transitions. [2023-12-09 15:22:45,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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:22:45,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:45,841 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:45,842 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 7 predicate places. [2023-12-09 15:22:45,842 INFO L500 AbstractCegarLoop]: Abstraction has has 254 places, 256 transitions, 747 flow [2023-12-09 15:22:45,843 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 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:22:45,843 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:45,843 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] [2023-12-09 15:22:45,844 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:22:45,844 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:45,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2063833253, now seen corresponding path program 1 times [2023-12-09 15:22:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344914566] [2023-12-09 15:22:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:22:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:46,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344914566] [2023-12-09 15:22:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344914566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:46,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:22:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210895670] [2023-12-09 15:22:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:46,037 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:22:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:22:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:22:46,039 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 270 [2023-12-09 15:22:46,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 256 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 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:22:46,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:46,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 270 [2023-12-09 15:22:46,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:46,195 INFO L124 PetriNetUnfolderBase]: 147/761 cut-off events. [2023-12-09 15:22:46,195 INFO L125 PetriNetUnfolderBase]: For 397/469 co-relation queries the response was YES. [2023-12-09 15:22:46,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 761 events. 147/761 cut-off events. For 397/469 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3570 event pairs, 47 based on Foata normal form. 12/708 useless extension candidates. Maximal degree in co-relation 1117. Up to 232 conditions per place. [2023-12-09 15:22:46,203 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 32 selfloop transitions, 2 changer transitions 12/264 dead transitions. [2023-12-09 15:22:46,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 264 transitions, 880 flow [2023-12-09 15:22:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:22:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:22:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2023-12-09 15:22:46,206 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9160493827160494 [2023-12-09 15:22:46,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 742 transitions. [2023-12-09 15:22:46,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 742 transitions. [2023-12-09 15:22:46,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:46,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 742 transitions. [2023-12-09 15:22:46,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 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:22:46,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:22:46,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:22:46,212 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 9 predicate places. [2023-12-09 15:22:46,212 INFO L500 AbstractCegarLoop]: Abstraction has has 256 places, 264 transitions, 880 flow [2023-12-09 15:22:46,213 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 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:22:46,213 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:46,213 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] [2023-12-09 15:22:46,213 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:22:46,213 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:46,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1591684886, now seen corresponding path program 1 times [2023-12-09 15:22:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:46,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094275466] [2023-12-09 15:22:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:46,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:22:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:46,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094275466] [2023-12-09 15:22:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094275466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:46,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:46,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:22:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140503713] [2023-12-09 15:22:46,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:46,354 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:22:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:46,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:22:46,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:22:46,357 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 270 [2023-12-09 15:22:46,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 264 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 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:22:46,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:46,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 270 [2023-12-09 15:22:46,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:46,532 INFO L124 PetriNetUnfolderBase]: 169/742 cut-off events. [2023-12-09 15:22:46,533 INFO L125 PetriNetUnfolderBase]: For 631/717 co-relation queries the response was YES. [2023-12-09 15:22:46,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 742 events. 169/742 cut-off events. For 631/717 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3283 event pairs, 21 based on Foata normal form. 10/698 useless extension candidates. Maximal degree in co-relation 1469. Up to 265 conditions per place. [2023-12-09 15:22:46,540 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 31 selfloop transitions, 2 changer transitions 14/265 dead transitions. [2023-12-09 15:22:46,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 265 transitions, 957 flow [2023-12-09 15:22:46,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:22:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:22:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2023-12-09 15:22:46,543 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9197530864197531 [2023-12-09 15:22:46,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 745 transitions. [2023-12-09 15:22:46,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 745 transitions. [2023-12-09 15:22:46,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:46,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 745 transitions. [2023-12-09 15:22:46,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 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:22:46,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:22:46,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:22:46,550 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 11 predicate places. [2023-12-09 15:22:46,550 INFO L500 AbstractCegarLoop]: Abstraction has has 258 places, 265 transitions, 957 flow [2023-12-09 15:22:46,550 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 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:22:46,551 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:46,551 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] [2023-12-09 15:22:46,551 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:22:46,551 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:46,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash -465486615, now seen corresponding path program 1 times [2023-12-09 15:22:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19805560] [2023-12-09 15:22:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:22:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:46,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19805560] [2023-12-09 15:22:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19805560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:22:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578736661] [2023-12-09 15:22:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:46,705 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:22:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:46,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:22:46,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:22:46,708 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 270 [2023-12-09 15:22:46,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 265 transitions, 957 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 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:22:46,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:46,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 270 [2023-12-09 15:22:46,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:46,822 INFO L124 PetriNetUnfolderBase]: 76/469 cut-off events. [2023-12-09 15:22:46,822 INFO L125 PetriNetUnfolderBase]: For 625/785 co-relation queries the response was YES. [2023-12-09 15:22:46,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 469 events. 76/469 cut-off events. For 625/785 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1299 event pairs, 15 based on Foata normal form. 3/429 useless extension candidates. Maximal degree in co-relation 860. Up to 123 conditions per place. [2023-12-09 15:22:46,826 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 23 selfloop transitions, 2 changer transitions 16/259 dead transitions. [2023-12-09 15:22:46,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 945 flow [2023-12-09 15:22:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:22:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:22:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2023-12-09 15:22:46,829 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9098765432098765 [2023-12-09 15:22:46,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2023-12-09 15:22:46,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2023-12-09 15:22:46,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:46,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2023-12-09 15:22:46,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 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:22:46,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:22:46,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:22:46,834 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 13 predicate places. [2023-12-09 15:22:46,834 INFO L500 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 945 flow [2023-12-09 15:22:46,835 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 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:22:46,835 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:46,835 INFO L233 CegarLoopForPetriNet]: trace histogram [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] [2023-12-09 15:22:46,836 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:22:46,836 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:46,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1846529259, now seen corresponding path program 1 times [2023-12-09 15:22:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405656432] [2023-12-09 15:22:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:22:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:47,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405656432] [2023-12-09 15:22:47,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405656432] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:22:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053623516] [2023-12-09 15:22:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:47,060 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:22:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:22:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:22:47,063 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 270 [2023-12-09 15:22:47,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 945 flow. Second operand has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 0 states have call successors, (0), 0 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:22:47,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:47,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 270 [2023-12-09 15:22:47,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:47,276 INFO L124 PetriNetUnfolderBase]: 78/641 cut-off events. [2023-12-09 15:22:47,277 INFO L125 PetriNetUnfolderBase]: For 1031/1237 co-relation queries the response was YES. [2023-12-09 15:22:47,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 641 events. 78/641 cut-off events. For 1031/1237 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1905 event pairs, 15 based on Foata normal form. 3/591 useless extension candidates. Maximal degree in co-relation 977. Up to 155 conditions per place. [2023-12-09 15:22:47,281 INFO L140 encePairwiseOnDemand]: 259/270 looper letters, 64 selfloop transitions, 8 changer transitions 56/303 dead transitions. [2023-12-09 15:22:47,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 303 transitions, 1353 flow [2023-12-09 15:22:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:22:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:22:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1861 transitions. [2023-12-09 15:22:47,285 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7658436213991769 [2023-12-09 15:22:47,285 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1861 transitions. [2023-12-09 15:22:47,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1861 transitions. [2023-12-09 15:22:47,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:47,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1861 transitions. [2023-12-09 15:22:47,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 206.77777777777777) internal successors, (1861), 9 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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:22:47,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:47,295 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:47,295 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 21 predicate places. [2023-12-09 15:22:47,295 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 303 transitions, 1353 flow [2023-12-09 15:22:47,296 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 0 states have call successors, (0), 0 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:22:47,296 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:47,297 INFO L233 CegarLoopForPetriNet]: trace histogram [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] [2023-12-09 15:22:47,297 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:22:47,297 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:47,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash -574478198, now seen corresponding path program 1 times [2023-12-09 15:22:47,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:47,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154245833] [2023-12-09 15:22:47,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:22:47,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154245833] [2023-12-09 15:22:47,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154245833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:47,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:47,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:22:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226092797] [2023-12-09 15:22:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:47,532 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:22:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:47,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:22:47,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:22:47,534 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 270 [2023-12-09 15:22:47,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 303 transitions, 1353 flow. Second operand has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 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:22:47,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:47,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 270 [2023-12-09 15:22:47,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:47,810 INFO L124 PetriNetUnfolderBase]: 86/921 cut-off events. [2023-12-09 15:22:47,810 INFO L125 PetriNetUnfolderBase]: For 1883/2135 co-relation queries the response was YES. [2023-12-09 15:22:47,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 921 events. 86/921 cut-off events. For 1883/2135 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3651 event pairs, 17 based on Foata normal form. 3/855 useless extension candidates. Maximal degree in co-relation 1094. Up to 200 conditions per place. [2023-12-09 15:22:47,816 INFO L140 encePairwiseOnDemand]: 259/270 looper letters, 68 selfloop transitions, 8 changer transitions 118/369 dead transitions. [2023-12-09 15:22:47,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 369 transitions, 2233 flow [2023-12-09 15:22:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:22:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:22:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1852 transitions. [2023-12-09 15:22:47,820 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7621399176954733 [2023-12-09 15:22:47,820 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1852 transitions. [2023-12-09 15:22:47,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1852 transitions. [2023-12-09 15:22:47,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:47,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1852 transitions. [2023-12-09 15:22:47,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 205.77777777777777) internal successors, (1852), 9 states have internal predecessors, (1852), 0 states have call successors, (0), 0 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:22:47,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:47,859 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:47,859 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 29 predicate places. [2023-12-09 15:22:47,860 INFO L500 AbstractCegarLoop]: Abstraction has has 276 places, 369 transitions, 2233 flow [2023-12-09 15:22:47,860 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 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:22:47,860 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:47,860 INFO L233 CegarLoopForPetriNet]: trace histogram [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] [2023-12-09 15:22:47,861 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:22:47,861 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:47,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1805569218, now seen corresponding path program 1 times [2023-12-09 15:22:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654470432] [2023-12-09 15:22:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:22:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654470432] [2023-12-09 15:22:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654470432] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:22:48,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241332878] [2023-12-09 15:22:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:48,112 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:22:48,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:48,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:22:48,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:22:48,114 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 270 [2023-12-09 15:22:48,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 369 transitions, 2233 flow. Second operand has 6 states, 6 states have (on average 204.16666666666666) internal successors, (1225), 6 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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:22:48,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:48,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 270 [2023-12-09 15:22:48,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:48,483 INFO L124 PetriNetUnfolderBase]: 90/1245 cut-off events. [2023-12-09 15:22:48,483 INFO L125 PetriNetUnfolderBase]: For 3629/3927 co-relation queries the response was YES. [2023-12-09 15:22:48,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 1245 events. 90/1245 cut-off events. For 3629/3927 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6342 event pairs, 17 based on Foata normal form. 2/1162 useless extension candidates. Maximal degree in co-relation 1546. Up to 240 conditions per place. [2023-12-09 15:22:48,489 INFO L140 encePairwiseOnDemand]: 259/270 looper letters, 72 selfloop transitions, 8 changer transitions 178/433 dead transitions. [2023-12-09 15:22:48,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 433 transitions, 3515 flow [2023-12-09 15:22:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:22:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:22:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1833 transitions. [2023-12-09 15:22:48,493 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.754320987654321 [2023-12-09 15:22:48,493 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1833 transitions. [2023-12-09 15:22:48,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1833 transitions. [2023-12-09 15:22:48,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:48,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1833 transitions. [2023-12-09 15:22:48,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 203.66666666666666) internal successors, (1833), 9 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:22:48,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:48,502 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:48,503 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 37 predicate places. [2023-12-09 15:22:48,503 INFO L500 AbstractCegarLoop]: Abstraction has has 284 places, 433 transitions, 3515 flow [2023-12-09 15:22:48,504 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.16666666666666) internal successors, (1225), 6 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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:22:48,504 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:48,504 INFO L233 CegarLoopForPetriNet]: trace histogram [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] [2023-12-09 15:22:48,504 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:22:48,504 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:48,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash -116726906, now seen corresponding path program 1 times [2023-12-09 15:22:48,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:48,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723737571] [2023-12-09 15:22:48,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:22:48,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723737571] [2023-12-09 15:22:48,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723737571] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:22:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067409596] [2023-12-09 15:22:48,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:48,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:22:48,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:22:48,828 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:22:48,871 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:22:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:49,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:22:49,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:22:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-09 15:22:49,339 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:22:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067409596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:49,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:22:49,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-12-09 15:22:49,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385921586] [2023-12-09 15:22:49,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:49,341 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:22:49,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:49,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:22:49,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:22:49,343 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 270 [2023-12-09 15:22:49,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 433 transitions, 3515 flow. Second operand has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:22:49,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:49,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 270 [2023-12-09 15:22:49,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:49,654 INFO L124 PetriNetUnfolderBase]: 149/1520 cut-off events. [2023-12-09 15:22:49,654 INFO L125 PetriNetUnfolderBase]: For 6264/6992 co-relation queries the response was YES. [2023-12-09 15:22:49,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4995 conditions, 1520 events. 149/1520 cut-off events. For 6264/6992 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8079 event pairs, 21 based on Foata normal form. 11/1416 useless extension candidates. Maximal degree in co-relation 2459. Up to 347 conditions per place. [2023-12-09 15:22:49,664 INFO L140 encePairwiseOnDemand]: 265/270 looper letters, 40 selfloop transitions, 12 changer transitions 183/465 dead transitions. [2023-12-09 15:22:49,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 465 transitions, 4349 flow [2023-12-09 15:22:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:22:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:22:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 992 transitions. [2023-12-09 15:22:49,666 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2023-12-09 15:22:49,667 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 992 transitions. [2023-12-09 15:22:49,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 992 transitions. [2023-12-09 15:22:49,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:49,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 992 transitions. [2023-12-09 15:22:49,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:49,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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:22:49,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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:22:49,672 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 40 predicate places. [2023-12-09 15:22:49,672 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 465 transitions, 4349 flow [2023-12-09 15:22:49,673 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:22:49,673 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:49,673 INFO L233 CegarLoopForPetriNet]: trace histogram [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] [2023-12-09 15:22:49,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:22:49,880 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:22:49,881 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:49,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -868073189, now seen corresponding path program 1 times [2023-12-09 15:22:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416144044] [2023-12-09 15:22:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:22:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416144044] [2023-12-09 15:22:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416144044] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:22:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629858654] [2023-12-09 15:22:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:50,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:22:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:22:50,273 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:22:50,276 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:22:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:50,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:22:50,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:22:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:22:50,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:22:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:22:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629858654] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:22:51,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:22:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-12-09 15:22:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630946307] [2023-12-09 15:22:51,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:22:51,115 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-09 15:22:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-09 15:22:51,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:22:51,121 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 270 [2023-12-09 15:22:51,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 465 transitions, 4349 flow. Second operand has 19 states, 19 states have (on average 195.05263157894737) internal successors, (3706), 19 states have internal predecessors, (3706), 0 states have call successors, (0), 0 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:22:51,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:51,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 270 [2023-12-09 15:22:51,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:51,951 INFO L124 PetriNetUnfolderBase]: 160/2002 cut-off events. [2023-12-09 15:22:51,952 INFO L125 PetriNetUnfolderBase]: For 9565/10357 co-relation queries the response was YES. [2023-12-09 15:22:51,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6892 conditions, 2002 events. 160/2002 cut-off events. For 9565/10357 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12268 event pairs, 21 based on Foata normal form. 3/1865 useless extension candidates. Maximal degree in co-relation 2674. Up to 469 conditions per place. [2023-12-09 15:22:51,961 INFO L140 encePairwiseOnDemand]: 250/270 looper letters, 95 selfloop transitions, 22 changer transitions 304/591 dead transitions. [2023-12-09 15:22:51,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 591 transitions, 6783 flow [2023-12-09 15:22:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-09 15:22:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-09 15:22:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4156 transitions. [2023-12-09 15:22:51,972 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7329805996472664 [2023-12-09 15:22:51,972 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4156 transitions. [2023-12-09 15:22:51,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4156 transitions. [2023-12-09 15:22:51,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:51,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4156 transitions. [2023-12-09 15:22:51,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 197.9047619047619) internal successors, (4156), 21 states have internal predecessors, (4156), 0 states have call successors, (0), 0 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:22:51,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 270.0) internal successors, (5940), 22 states have internal predecessors, (5940), 0 states have call successors, (0), 0 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:22:51,991 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 270.0) internal successors, (5940), 22 states have internal predecessors, (5940), 0 states have call successors, (0), 0 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:22:51,992 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 60 predicate places. [2023-12-09 15:22:51,992 INFO L500 AbstractCegarLoop]: Abstraction has has 307 places, 591 transitions, 6783 flow [2023-12-09 15:22:51,993 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 195.05263157894737) internal successors, (3706), 19 states have internal predecessors, (3706), 0 states have call successors, (0), 0 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:22:51,993 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:51,994 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:52,001 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:22:52,199 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,SelfDestructingSolverStorable9 [2023-12-09 15:22:52,200 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:52,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash -988129652, now seen corresponding path program 2 times [2023-12-09 15:22:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:52,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225033413] [2023-12-09 15:22:52,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-09 15:22:52,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225033413] [2023-12-09 15:22:52,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225033413] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:22:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18047721] [2023-12-09 15:22:52,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:22:52,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:22:52,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:22:52,537 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:22:52,561 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:22:52,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:22:52,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:22:52,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:22:52,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:22:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-09 15:22:53,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:22:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-09 15:22:53,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18047721] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:22:53,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:22:53,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-12-09 15:22:53,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486907869] [2023-12-09 15:22:53,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:22:53,361 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-09 15:22:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:53,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-09 15:22:53,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:22:53,365 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 270 [2023-12-09 15:22:53,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 591 transitions, 6783 flow. Second operand has 19 states, 19 states have (on average 194.94736842105263) internal successors, (3704), 19 states have internal predecessors, (3704), 0 states have call successors, (0), 0 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:22:53,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:53,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 270 [2023-12-09 15:22:53,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:54,384 INFO L124 PetriNetUnfolderBase]: 202/2818 cut-off events. [2023-12-09 15:22:54,384 INFO L125 PetriNetUnfolderBase]: For 16855/18031 co-relation queries the response was YES. [2023-12-09 15:22:54,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10458 conditions, 2818 events. 202/2818 cut-off events. For 16855/18031 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20176 event pairs, 22 based on Foata normal form. 49/2681 useless extension candidates. Maximal degree in co-relation 4004. Up to 657 conditions per place. [2023-12-09 15:22:54,398 INFO L140 encePairwiseOnDemand]: 251/270 looper letters, 99 selfloop transitions, 23 changer transitions 483/775 dead transitions. [2023-12-09 15:22:54,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 775 transitions, 10957 flow [2023-12-09 15:22:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-09 15:22:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-12-09 15:22:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3349 transitions. [2023-12-09 15:22:54,404 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7296296296296296 [2023-12-09 15:22:54,405 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3349 transitions. [2023-12-09 15:22:54,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3349 transitions. [2023-12-09 15:22:54,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:54,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3349 transitions. [2023-12-09 15:22:54,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 197.0) internal successors, (3349), 17 states have internal predecessors, (3349), 0 states have call successors, (0), 0 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:22:54,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 270.0) internal successors, (4860), 18 states have internal predecessors, (4860), 0 states have call successors, (0), 0 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:22:54,419 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 270.0) internal successors, (4860), 18 states have internal predecessors, (4860), 0 states have call successors, (0), 0 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:22:54,420 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, 76 predicate places. [2023-12-09 15:22:54,420 INFO L500 AbstractCegarLoop]: Abstraction has has 323 places, 775 transitions, 10957 flow [2023-12-09 15:22:54,421 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 194.94736842105263) internal successors, (3704), 19 states have internal predecessors, (3704), 0 states have call successors, (0), 0 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:22:54,421 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:54,422 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:22:54,436 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:22:54,626 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:22:54,627 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:54,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash 706254394, now seen corresponding path program 3 times [2023-12-09 15:22:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:54,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802790570] [2023-12-09 15:22:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:54,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:23:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:04,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:23:04,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802790570] [2023-12-09 15:23:04,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802790570] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:23:04,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84774052] [2023-12-09 15:23:04,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:23:04,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:23:04,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:23:04,341 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:23:04,348 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:23:04,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-09 15:23:04,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:23:04,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 109 conjunts are in the unsatisfiable core [2023-12-09 15:23:04,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:23:04,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 12 treesize of output 9 [2023-12-09 15:23:04,721 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-09 15:23:04,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-09 15:23:05,423 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-12-09 15:23:05,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2023-12-09 15:23:07,005 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-12-09 15:23:07,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2023-12-09 15:23:08,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:23:08,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-12-09 15:23:08,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-09 15:23:09,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:23:09,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:23:10,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:23:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:23:11,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:24:31,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:31,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-12-09 15:24:31,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:31,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 17453 treesize of output 16206 [2023-12-09 15:24:31,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:31,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3173 treesize of output 2855 [2023-12-09 15:24:31,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:31,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2773 treesize of output 2055 [2023-12-09 15:24:31,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:31,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1973 treesize of output 1855 [2023-12-09 15:24:56,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:56,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 165 [2023-12-09 15:24:56,850 INFO L349 Elim1Store]: treesize reduction 18, result has 92.5 percent of original size [2023-12-09 15:24:56,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108503 treesize of output 100275 [2023-12-09 15:24:57,649 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:24:57,655 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:24:57,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:57,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 6215 treesize of output 5604 [2023-12-09 15:24:57,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:24:57,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:24:57,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:57,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 5415 treesize of output 5204 [2023-12-09 15:24:58,135 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:24:58,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:24:58,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:24:58,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 5015 treesize of output 3604 Received shutdown request... [2023-12-09 15:26:54,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-09 15:26:54,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-09 15:26:54,060 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:26:54,060 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:26:54,241 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:54,242 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 256 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-62-4-5-3-6-6-5-6-4-8-3-7-3-3-3-3-2-2-2-1 context. [2023-12-09 15:26:54,243 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-12-09 15:26:54,244 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 15:26:54,244 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-12-09 15:26:54,244 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:54,248 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:26:54,248 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:26:54,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:26:54 BasicIcfg [2023-12-09 15:26:54,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:26:54,251 INFO L158 Benchmark]: Toolchain (without parser) took 251619.31ms. Allocated memory was 185.6MB in the beginning and 1.1GB in the end (delta: 879.8MB). Free memory was 137.4MB in the beginning and 733.2MB in the end (delta: -595.8MB). Peak memory consumption was 722.4MB. Max. memory is 8.0GB. [2023-12-09 15:26:54,251 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 185.6MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:26:54,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.96ms. Allocated memory is still 185.6MB. Free memory was 137.4MB in the beginning and 124.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-09 15:26:54,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.50ms. Allocated memory is still 185.6MB. Free memory was 124.3MB in the beginning and 121.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:26:54,252 INFO L158 Benchmark]: Boogie Preprocessor took 53.72ms. Allocated memory is still 185.6MB. Free memory was 121.7MB in the beginning and 119.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-09 15:26:54,252 INFO L158 Benchmark]: RCFGBuilder took 849.70ms. Allocated memory is still 185.6MB. Free memory was 119.0MB in the beginning and 155.1MB in the end (delta: -36.1MB). Peak memory consumption was 60.9MB. Max. memory is 8.0GB. [2023-12-09 15:26:54,253 INFO L158 Benchmark]: TraceAbstraction took 250427.41ms. Allocated memory was 185.6MB in the beginning and 1.1GB in the end (delta: 879.8MB). Free memory was 154.6MB in the beginning and 733.2MB in the end (delta: -578.6MB). Peak memory consumption was 738.0MB. Max. memory is 8.0GB. [2023-12-09 15:26:54,254 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 185.6MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.96ms. Allocated memory is still 185.6MB. Free memory was 137.4MB in the beginning and 124.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.50ms. Allocated memory is still 185.6MB. Free memory was 124.3MB in the beginning and 121.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.72ms. Allocated memory is still 185.6MB. Free memory was 121.7MB in the beginning and 119.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 849.70ms. Allocated memory is still 185.6MB. Free memory was 119.0MB in the beginning and 155.1MB in the end (delta: -36.1MB). Peak memory consumption was 60.9MB. Max. memory is 8.0GB. * TraceAbstraction took 250427.41ms. Allocated memory was 185.6MB in the beginning and 1.1GB in the end (delta: 879.8MB). Free memory was 154.6MB in the beginning and 733.2MB in the end (delta: -578.6MB). Peak memory consumption was 738.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 256 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-62-4-5-3-6-6-5-6-4-8-3-7-3-3-3-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 256 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-62-4-5-3-6-6-5-6-4-8-3-7-3-3-3-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 256 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-62-4-5-3-6-6-5-6-4-8-3-7-3-3-3-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 256 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-62-4-5-3-6-6-5-6-4-8-3-7-3-3-3-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 287 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 250.3s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 549 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 549 mSDsluCounter, 873 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 614 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1746 IncrementalHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 259 mSDtfsCounter, 1746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1308 GetRequests, 1201 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10957occurred in iteration=11, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 3095 NumberOfCodeBlocks, 3095 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3565 ConstructedInterpolants, 0 QuantifiedInterpolants, 8343 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1653 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 101/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown