/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/test-context1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 23:23:13,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 23:23:13,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 23:23:13,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 23:23:13,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 23:23:13,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 23:23:13,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 23:23:13,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 23:23:13,648 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 23:23:13,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 23:23:13,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 23:23:13,651 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 23:23:13,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 23:23:13,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 23:23:13,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 23:23:13,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 23:23:13,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 23:23:13,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 23:23:13,653 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 23:23:13,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 23:23:13,653 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 23:23:13,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 23:23:13,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 23:23:13,654 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 23:23:13,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 23:23:13,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 23:23:13,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 23:23:13,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 23:23:13,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 23:23:13,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 23:23:13,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 23:23:13,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 23:23:13,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 23:23:13,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 23:23:13,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 23:23:13,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 23:23:13,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 23:23:13,839 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 23:23:13,840 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 23:23:13,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-context1.wvr.c [2023-11-29 23:23:14,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 23:23:14,829 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 23:23:14,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c [2023-11-29 23:23:14,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61222fc0/151c55c96a844fcd8e2a335e48208d08/FLAGf9aa14f24 [2023-11-29 23:23:14,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61222fc0/151c55c96a844fcd8e2a335e48208d08 [2023-11-29 23:23:14,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 23:23:14,859 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 23:23:14,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 23:23:14,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 23:23:14,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 23:23:14,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:23:14" (1/1) ... [2023-11-29 23:23:14,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1e68a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:14, skipping insertion in model container [2023-11-29 23:23:14,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:23:14" (1/1) ... [2023-11-29 23:23:14,884 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 23:23:15,002 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/test-context1.wvr.c[2459,2472] [2023-11-29 23:23:15,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 23:23:15,013 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 23:23:15,025 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/test-context1.wvr.c[2459,2472] [2023-11-29 23:23:15,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 23:23:15,032 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 23:23:15,032 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 23:23:15,036 INFO L206 MainTranslator]: Completed translation [2023-11-29 23:23:15,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15 WrapperNode [2023-11-29 23:23:15,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 23:23:15,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 23:23:15,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 23:23:15,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 23:23:15,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,061 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 137 [2023-11-29 23:23:15,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 23:23:15,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 23:23:15,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 23:23:15,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 23:23:15,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 23:23:15,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 23:23:15,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 23:23:15,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 23:23:15,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (1/1) ... [2023-11-29 23:23:15,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 23:23:15,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:15,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 23:23:15,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 23:23:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 23:23:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 23:23:15,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 23:23:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 23:23:15,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 23:23:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 23:23:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 23:23:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 23:23:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 23:23:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 23:23:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 23:23:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 23:23:15,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 23:23:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 23:23:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 23:23:15,132 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 23:23:15,216 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 23:23:15,217 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 23:23:15,430 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 23:23:15,510 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 23:23:15,511 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 23:23:15,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:23:15 BoogieIcfgContainer [2023-11-29 23:23:15,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 23:23:15,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 23:23:15,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 23:23:15,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 23:23:15,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:23:14" (1/3) ... [2023-11-29 23:23:15,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebc068f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:23:15, skipping insertion in model container [2023-11-29 23:23:15,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:23:15" (2/3) ... [2023-11-29 23:23:15,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebc068f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:23:15, skipping insertion in model container [2023-11-29 23:23:15,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:23:15" (3/3) ... [2023-11-29 23:23:15,518 INFO L112 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2023-11-29 23:23:15,530 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 23:23:15,530 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 23:23:15,531 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 23:23:15,582 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 23:23:15,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 119 transitions, 252 flow [2023-11-29 23:23:15,639 INFO L124 PetriNetUnfolderBase]: 9/117 cut-off events. [2023-11-29 23:23:15,640 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 23:23:15,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 117 events. 9/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-11-29 23:23:15,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 119 transitions, 252 flow [2023-11-29 23:23:15,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 108 transitions, 228 flow [2023-11-29 23:23:15,653 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 23:23:15,657 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;@2a6a9eeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 23:23:15,658 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-29 23:23:15,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 23:23:15,675 INFO L124 PetriNetUnfolderBase]: 9/107 cut-off events. [2023-11-29 23:23:15,676 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 23:23:15,676 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:15,676 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:23:15,677 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:15,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash -14756024, now seen corresponding path program 1 times [2023-11-29 23:23:15,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:15,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854794548] [2023-11-29 23:23:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:23:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:15,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854794548] [2023-11-29 23:23:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854794548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:23:15,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:23:15,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 23:23:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719531360] [2023-11-29 23:23:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:23:15,855 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 23:23:15,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 23:23:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 23:23:15,875 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 119 [2023-11-29 23:23:15,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 108 transitions, 228 flow. Second operand has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:15,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:15,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 119 [2023-11-29 23:23:15,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:15,938 INFO L124 PetriNetUnfolderBase]: 10/133 cut-off events. [2023-11-29 23:23:15,938 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 23:23:15,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 133 events. 10/133 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 149 event pairs, 0 based on Foata normal form. 13/137 useless extension candidates. Maximal degree in co-relation 80. Up to 17 conditions per place. [2023-11-29 23:23:15,940 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 6 selfloop transitions, 0 changer transitions 3/102 dead transitions. [2023-11-29 23:23:15,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 228 flow [2023-11-29 23:23:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 23:23:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 23:23:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 224 transitions. [2023-11-29 23:23:15,948 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2023-11-29 23:23:15,949 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 224 transitions. [2023-11-29 23:23:15,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 224 transitions. [2023-11-29 23:23:15,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:15,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 224 transitions. [2023-11-29 23:23:15,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 112.0) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:15,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:15,963 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:15,966 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2023-11-29 23:23:15,966 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 228 flow [2023-11-29 23:23:15,966 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:15,966 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:15,967 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:23:15,967 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 23:23:15,967 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:15,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1349704184, now seen corresponding path program 1 times [2023-11-29 23:23:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:15,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930458584] [2023-11-29 23:23:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:23:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930458584] [2023-11-29 23:23:16,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930458584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:23:16,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:23:16,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 23:23:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142310403] [2023-11-29 23:23:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:23:16,234 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 23:23:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:16,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 23:23:16,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 23:23:16,236 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 119 [2023-11-29 23:23:16,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:16,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 119 [2023-11-29 23:23:16,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:16,347 INFO L124 PetriNetUnfolderBase]: 11/148 cut-off events. [2023-11-29 23:23:16,347 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-29 23:23:16,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 148 events. 11/148 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 208 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 98. Up to 21 conditions per place. [2023-11-29 23:23:16,348 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 27 selfloop transitions, 2 changer transitions 8/110 dead transitions. [2023-11-29 23:23:16,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 332 flow [2023-11-29 23:23:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 23:23:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 23:23:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 619 transitions. [2023-11-29 23:23:16,355 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7430972388955582 [2023-11-29 23:23:16,355 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 619 transitions. [2023-11-29 23:23:16,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 619 transitions. [2023-11-29 23:23:16,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:16,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 619 transitions. [2023-11-29 23:23:16,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,359 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,359 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 7 predicate places. [2023-11-29 23:23:16,359 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 332 flow [2023-11-29 23:23:16,360 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,360 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:16,360 INFO L232 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] [2023-11-29 23:23:16,360 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 23:23:16,360 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:16,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -567634099, now seen corresponding path program 1 times [2023-11-29 23:23:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100639060] [2023-11-29 23:23:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:16,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:23:16,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:16,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100639060] [2023-11-29 23:23:16,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100639060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:23:16,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:23:16,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 23:23:16,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647542494] [2023-11-29 23:23:16,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:23:16,457 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 23:23:16,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:16,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 23:23:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 23:23:16,458 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2023-11-29 23:23:16,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:16,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2023-11-29 23:23:16,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:16,482 INFO L124 PetriNetUnfolderBase]: 8/154 cut-off events. [2023-11-29 23:23:16,483 INFO L125 PetriNetUnfolderBase]: For 89/93 co-relation queries the response was YES. [2023-11-29 23:23:16,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 154 events. 8/154 cut-off events. For 89/93 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 247 event pairs, 0 based on Foata normal form. 2/146 useless extension candidates. Maximal degree in co-relation 112. Up to 24 conditions per place. [2023-11-29 23:23:16,484 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 10 selfloop transitions, 2 changer transitions 10/114 dead transitions. [2023-11-29 23:23:16,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 114 transitions, 395 flow [2023-11-29 23:23:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 23:23:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 23:23:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-11-29 23:23:16,489 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9159663865546218 [2023-11-29 23:23:16,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-11-29 23:23:16,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-11-29 23:23:16,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:16,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-11-29 23:23:16,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,494 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,496 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 9 predicate places. [2023-11-29 23:23:16,496 INFO L500 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 395 flow [2023-11-29 23:23:16,496 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,496 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:16,497 INFO L232 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] [2023-11-29 23:23:16,497 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 23:23:16,497 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:16,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash 498222978, now seen corresponding path program 1 times [2023-11-29 23:23:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:16,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164613776] [2023-11-29 23:23:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:23:16,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:16,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164613776] [2023-11-29 23:23:16,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164613776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:23:16,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:23:16,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 23:23:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650112186] [2023-11-29 23:23:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:23:16,759 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 23:23:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:16,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 23:23:16,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 23:23:16,762 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 119 [2023-11-29 23:23:16,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 395 flow. Second operand has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:16,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 119 [2023-11-29 23:23:16,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:16,918 INFO L124 PetriNetUnfolderBase]: 8/211 cut-off events. [2023-11-29 23:23:16,918 INFO L125 PetriNetUnfolderBase]: For 194/200 co-relation queries the response was YES. [2023-11-29 23:23:16,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 211 events. 8/211 cut-off events. For 194/200 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 465 event pairs, 0 based on Foata normal form. 4/202 useless extension candidates. Maximal degree in co-relation 180. Up to 28 conditions per place. [2023-11-29 23:23:16,921 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 22 selfloop transitions, 12 changer transitions 18/126 dead transitions. [2023-11-29 23:23:16,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 126 transitions, 545 flow [2023-11-29 23:23:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 23:23:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 23:23:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1003 transitions. [2023-11-29 23:23:16,923 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7662337662337663 [2023-11-29 23:23:16,923 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1003 transitions. [2023-11-29 23:23:16,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1003 transitions. [2023-11-29 23:23:16,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:16,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1003 transitions. [2023-11-29 23:23:16,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,929 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,930 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 19 predicate places. [2023-11-29 23:23:16,930 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 126 transitions, 545 flow [2023-11-29 23:23:16,930 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:16,931 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:16,931 INFO L232 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] [2023-11-29 23:23:16,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 23:23:16,931 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:16,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:16,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1886407525, now seen corresponding path program 1 times [2023-11-29 23:23:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:16,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015225168] [2023-11-29 23:23:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:16,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:23:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:17,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015225168] [2023-11-29 23:23:17,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015225168] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145724754] [2023-11-29 23:23:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:17,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:17,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:17,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:17,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 23:23:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:17,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 23:23:17,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:17,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 23:23:17,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 23:23:17,675 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 11 treesize of output 11 [2023-11-29 23:23:17,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 23:23:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:23:18,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:18,046 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_66 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_66) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))) is different from false [2023-11-29 23:23:18,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:23:18,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 34 [2023-11-29 23:23:18,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 23:23:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:23:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145724754] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:18,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 25 [2023-11-29 23:23:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915198645] [2023-11-29 23:23:18,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:18,295 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 23:23:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 23:23:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2023-11-29 23:23:18,297 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 119 [2023-11-29 23:23:18,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 126 transitions, 545 flow. Second operand has 25 states, 25 states have (on average 56.48) internal successors, (1412), 25 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:18,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:18,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 119 [2023-11-29 23:23:18,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:18,848 INFO L124 PetriNetUnfolderBase]: 22/291 cut-off events. [2023-11-29 23:23:18,849 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2023-11-29 23:23:18,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 291 events. 22/291 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 862 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 254. Up to 40 conditions per place. [2023-11-29 23:23:18,850 INFO L140 encePairwiseOnDemand]: 99/119 looper letters, 53 selfloop transitions, 15 changer transitions 28/145 dead transitions. [2023-11-29 23:23:18,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 145 transitions, 823 flow [2023-11-29 23:23:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 23:23:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-29 23:23:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1336 transitions. [2023-11-29 23:23:18,853 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4677871148459384 [2023-11-29 23:23:18,853 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1336 transitions. [2023-11-29 23:23:18,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1336 transitions. [2023-11-29 23:23:18,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:18,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1336 transitions. [2023-11-29 23:23:18,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 55.666666666666664) internal successors, (1336), 24 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:18,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 119.0) internal successors, (2975), 25 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:18,859 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 119.0) internal successors, (2975), 25 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:18,860 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 42 predicate places. [2023-11-29 23:23:18,860 INFO L500 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 823 flow [2023-11-29 23:23:18,860 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 56.48) internal successors, (1412), 25 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:18,860 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:18,860 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 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] [2023-11-29 23:23:18,868 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-11-29 23:23:19,076 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:19,076 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:19,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:19,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1019967106, now seen corresponding path program 2 times [2023-11-29 23:23:19,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:19,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986252458] [2023-11-29 23:23:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:23:19,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986252458] [2023-11-29 23:23:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986252458] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304183467] [2023-11-29 23:23:19,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:23:19,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:19,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:19,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:19,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 23:23:19,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:23:19,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:19,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 23:23:19,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:23:19,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:23:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304183467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:19,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:19,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2023-11-29 23:23:19,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364431956] [2023-11-29 23:23:19,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:19,364 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 23:23:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:19,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 23:23:19,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 23:23:19,365 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2023-11-29 23:23:19,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 823 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:19,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:19,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2023-11-29 23:23:19,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:19,420 INFO L124 PetriNetUnfolderBase]: 41/479 cut-off events. [2023-11-29 23:23:19,420 INFO L125 PetriNetUnfolderBase]: For 1015/1025 co-relation queries the response was YES. [2023-11-29 23:23:19,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 479 events. 41/479 cut-off events. For 1015/1025 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2164 event pairs, 0 based on Foata normal form. 10/451 useless extension candidates. Maximal degree in co-relation 587. Up to 77 conditions per place. [2023-11-29 23:23:19,422 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 19 selfloop transitions, 10 changer transitions 33/164 dead transitions. [2023-11-29 23:23:19,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 164 transitions, 1168 flow [2023-11-29 23:23:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:23:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:23:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2023-11-29 23:23:19,423 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9180672268907563 [2023-11-29 23:23:19,423 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2023-11-29 23:23:19,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2023-11-29 23:23:19,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:19,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2023-11-29 23:23:19,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:19,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:19,425 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:19,426 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 45 predicate places. [2023-11-29 23:23:19,426 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 164 transitions, 1168 flow [2023-11-29 23:23:19,426 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:19,426 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:19,426 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2023-11-29 23:23:19,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 23:23:19,631 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 23:23:19,631 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:19,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash 263288861, now seen corresponding path program 3 times [2023-11-29 23:23:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:19,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991896045] [2023-11-29 23:23:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 23:23:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991896045] [2023-11-29 23:23:19,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991896045] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640540877] [2023-11-29 23:23:19,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:23:19,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:19,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:19,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 23:23:19,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 23:23:19,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:19,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 23:23:19,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 23:23:20,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:20,520 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-29 23:23:20,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2023-11-29 23:23:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 23:23:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640540877] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:20,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:20,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 12] total 33 [2023-11-29 23:23:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419011802] [2023-11-29 23:23:20,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:20,776 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 23:23:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 23:23:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 23:23:20,778 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 119 [2023-11-29 23:23:20,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 164 transitions, 1168 flow. Second operand has 33 states, 33 states have (on average 53.81818181818182) internal successors, (1776), 33 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:20,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:20,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 119 [2023-11-29 23:23:20,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:22,040 INFO L124 PetriNetUnfolderBase]: 84/922 cut-off events. [2023-11-29 23:23:22,041 INFO L125 PetriNetUnfolderBase]: For 2508/2552 co-relation queries the response was YES. [2023-11-29 23:23:22,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2659 conditions, 922 events. 84/922 cut-off events. For 2508/2552 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6013 event pairs, 0 based on Foata normal form. 11/859 useless extension candidates. Maximal degree in co-relation 662. Up to 172 conditions per place. [2023-11-29 23:23:22,043 INFO L140 encePairwiseOnDemand]: 87/119 looper letters, 74 selfloop transitions, 22 changer transitions 144/280 dead transitions. [2023-11-29 23:23:22,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 280 transitions, 2722 flow [2023-11-29 23:23:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-29 23:23:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-11-29 23:23:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 2979 transitions. [2023-11-29 23:23:22,049 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.43918620079610793 [2023-11-29 23:23:22,049 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 2979 transitions. [2023-11-29 23:23:22,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 2979 transitions. [2023-11-29 23:23:22,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:22,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 2979 transitions. [2023-11-29 23:23:22,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 52.26315789473684) internal successors, (2979), 57 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:22,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 119.0) internal successors, (6902), 58 states have internal predecessors, (6902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:22,061 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 119.0) internal successors, (6902), 58 states have internal predecessors, (6902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:22,062 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 101 predicate places. [2023-11-29 23:23:22,062 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 280 transitions, 2722 flow [2023-11-29 23:23:22,062 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 53.81818181818182) internal successors, (1776), 33 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:22,062 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:22,062 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2023-11-29 23:23:22,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 23:23:22,267 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:22,268 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:22,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash -227298958, now seen corresponding path program 4 times [2023-11-29 23:23:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595862409] [2023-11-29 23:23:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:22,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 23:23:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:22,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595862409] [2023-11-29 23:23:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595862409] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178694906] [2023-11-29 23:23:22,876 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 23:23:22,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:22,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:22,877 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:22,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 23:23:22,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 23:23:22,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:22,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 23:23:22,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 23:23:23,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:23,204 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 23:23:23,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 23:23:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 23:23:23,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178694906] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:23,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:23,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 22 [2023-11-29 23:23:23,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192241101] [2023-11-29 23:23:23,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:23,274 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 23:23:23,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:23,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 23:23:23,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2023-11-29 23:23:23,275 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 119 [2023-11-29 23:23:23,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 280 transitions, 2722 flow. Second operand has 22 states, 22 states have (on average 65.86363636363636) internal successors, (1449), 22 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:23,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:23,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 119 [2023-11-29 23:23:23,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:24,222 INFO L124 PetriNetUnfolderBase]: 158/1443 cut-off events. [2023-11-29 23:23:24,222 INFO L125 PetriNetUnfolderBase]: For 5319/5440 co-relation queries the response was YES. [2023-11-29 23:23:24,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4850 conditions, 1443 events. 158/1443 cut-off events. For 5319/5440 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 11396 event pairs, 0 based on Foata normal form. 18/1346 useless extension candidates. Maximal degree in co-relation 1256. Up to 306 conditions per place. [2023-11-29 23:23:24,228 INFO L140 encePairwiseOnDemand]: 99/119 looper letters, 97 selfloop transitions, 37 changer transitions 300/493 dead transitions. [2023-11-29 23:23:24,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 493 transitions, 5775 flow [2023-11-29 23:23:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-29 23:23:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-11-29 23:23:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 3757 transitions. [2023-11-29 23:23:24,233 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5443349753694581 [2023-11-29 23:23:24,233 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 3757 transitions. [2023-11-29 23:23:24,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 3757 transitions. [2023-11-29 23:23:24,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:24,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 3757 transitions. [2023-11-29 23:23:24,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 64.77586206896552) internal successors, (3757), 58 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:24,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 119.0) internal successors, (7021), 59 states have internal predecessors, (7021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:24,245 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 119.0) internal successors, (7021), 59 states have internal predecessors, (7021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:24,245 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 158 predicate places. [2023-11-29 23:23:24,245 INFO L500 AbstractCegarLoop]: Abstraction has has 264 places, 493 transitions, 5775 flow [2023-11-29 23:23:24,246 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 65.86363636363636) internal successors, (1449), 22 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:24,246 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:24,246 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2023-11-29 23:23:24,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 23:23:24,451 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:24,453 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:24,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash -862464538, now seen corresponding path program 5 times [2023-11-29 23:23:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490116574] [2023-11-29 23:23:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:24,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 23:23:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490116574] [2023-11-29 23:23:25,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490116574] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:25,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407884585] [2023-11-29 23:23:25,031 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 23:23:25,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:25,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:25,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:25,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 23:23:25,103 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 23:23:25,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:25,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 23:23:25,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:25,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 23:23:25,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 23:23:25,233 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 11 treesize of output 11 [2023-11-29 23:23:25,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-29 23:23:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 23:23:25,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:25,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:23:25,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 35 [2023-11-29 23:23:25,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2023-11-29 23:23:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 23:23:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407884585] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:26,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 40 [2023-11-29 23:23:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681979797] [2023-11-29 23:23:26,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:26,160 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 23:23:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:26,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 23:23:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 23:23:26,163 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 119 [2023-11-29 23:23:26,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 493 transitions, 5775 flow. Second operand has 40 states, 40 states have (on average 55.375) internal successors, (2215), 40 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:26,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:26,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 119 [2023-11-29 23:23:26,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:27,452 INFO L124 PetriNetUnfolderBase]: 163/1486 cut-off events. [2023-11-29 23:23:27,452 INFO L125 PetriNetUnfolderBase]: For 6838/6952 co-relation queries the response was YES. [2023-11-29 23:23:27,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5559 conditions, 1486 events. 163/1486 cut-off events. For 6838/6952 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11832 event pairs, 0 based on Foata normal form. 22/1389 useless extension candidates. Maximal degree in co-relation 1430. Up to 317 conditions per place. [2023-11-29 23:23:27,459 INFO L140 encePairwiseOnDemand]: 99/119 looper letters, 107 selfloop transitions, 38 changer transitions 305/503 dead transitions. [2023-11-29 23:23:27,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 503 transitions, 6797 flow [2023-11-29 23:23:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-29 23:23:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-29 23:23:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2622 transitions. [2023-11-29 23:23:27,463 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.46880028607187557 [2023-11-29 23:23:27,463 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2622 transitions. [2023-11-29 23:23:27,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2622 transitions. [2023-11-29 23:23:27,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:27,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2622 transitions. [2023-11-29 23:23:27,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 55.787234042553195) internal successors, (2622), 47 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:27,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 119.0) internal successors, (5712), 48 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:27,472 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 119.0) internal successors, (5712), 48 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:27,472 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 204 predicate places. [2023-11-29 23:23:27,472 INFO L500 AbstractCegarLoop]: Abstraction has has 310 places, 503 transitions, 6797 flow [2023-11-29 23:23:27,473 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 55.375) internal successors, (2215), 40 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:27,473 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:27,473 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 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] [2023-11-29 23:23:27,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 23:23:27,678 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:27,679 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:27,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2106755465, now seen corresponding path program 6 times [2023-11-29 23:23:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:27,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479402452] [2023-11-29 23:23:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 23:23:27,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:27,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479402452] [2023-11-29 23:23:27,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479402452] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:27,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478849666] [2023-11-29 23:23:27,870 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 23:23:27,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:27,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:27,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 23:23:28,008 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-29 23:23:28,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:28,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 23:23:28,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 23:23:28,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 23:23:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478849666] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:28,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:28,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2023-11-29 23:23:28,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645776481] [2023-11-29 23:23:28,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:28,610 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 23:23:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:28,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 23:23:28,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 23:23:28,612 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2023-11-29 23:23:28,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 503 transitions, 6797 flow. Second operand has 33 states, 33 states have (on average 88.75757575757575) internal successors, (2929), 33 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:28,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:28,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2023-11-29 23:23:28,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:29,471 INFO L124 PetriNetUnfolderBase]: 307/2853 cut-off events. [2023-11-29 23:23:29,471 INFO L125 PetriNetUnfolderBase]: For 17632/17828 co-relation queries the response was YES. [2023-11-29 23:23:29,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11193 conditions, 2853 events. 307/2853 cut-off events. For 17632/17828 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 27141 event pairs, 0 based on Foata normal form. 68/2687 useless extension candidates. Maximal degree in co-relation 3013. Up to 676 conditions per place. [2023-11-29 23:23:29,483 INFO L140 encePairwiseOnDemand]: 102/119 looper letters, 77 selfloop transitions, 78 changer transitions 360/623 dead transitions. [2023-11-29 23:23:29,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 623 transitions, 10343 flow [2023-11-29 23:23:29,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 23:23:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-29 23:23:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3389 transitions. [2023-11-29 23:23:29,487 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7494471472799646 [2023-11-29 23:23:29,487 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3389 transitions. [2023-11-29 23:23:29,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3389 transitions. [2023-11-29 23:23:29,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:29,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3389 transitions. [2023-11-29 23:23:29,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 89.1842105263158) internal successors, (3389), 38 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:29,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 119.0) internal successors, (4641), 39 states have internal predecessors, (4641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:29,496 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 119.0) internal successors, (4641), 39 states have internal predecessors, (4641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:29,497 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 241 predicate places. [2023-11-29 23:23:29,497 INFO L500 AbstractCegarLoop]: Abstraction has has 347 places, 623 transitions, 10343 flow [2023-11-29 23:23:29,498 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 88.75757575757575) internal successors, (2929), 33 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:29,498 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:29,498 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:23:29,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 23:23:29,703 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:29,703 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:29,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1901013479, now seen corresponding path program 7 times [2023-11-29 23:23:29,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901795108] [2023-11-29 23:23:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:29,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:23:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:30,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901795108] [2023-11-29 23:23:30,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901795108] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328339256] [2023-11-29 23:23:30,324 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 23:23:30,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:30,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:30,326 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:30,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 23:23:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:30,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 23:23:30,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:23:30,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:30,931 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 23:23:30,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 23:23:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 23:23:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328339256] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:31,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 11] total 37 [2023-11-29 23:23:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690585266] [2023-11-29 23:23:31,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:31,037 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 23:23:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 23:23:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 23:23:31,039 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 119 [2023-11-29 23:23:31,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 623 transitions, 10343 flow. Second operand has 37 states, 37 states have (on average 58.13513513513514) internal successors, (2151), 37 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:31,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:31,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 119 [2023-11-29 23:23:31,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:33,868 INFO L124 PetriNetUnfolderBase]: 538/4909 cut-off events. [2023-11-29 23:23:33,868 INFO L125 PetriNetUnfolderBase]: For 35903/36387 co-relation queries the response was YES. [2023-11-29 23:23:33,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21126 conditions, 4909 events. 538/4909 cut-off events. For 35903/36387 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 54579 event pairs, 0 based on Foata normal form. 64/4573 useless extension candidates. Maximal degree in co-relation 4983. Up to 1317 conditions per place. [2023-11-29 23:23:33,892 INFO L140 encePairwiseOnDemand]: 94/119 looper letters, 228 selfloop transitions, 118 changer transitions 762/1153 dead transitions. [2023-11-29 23:23:33,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 1153 transitions, 21382 flow [2023-11-29 23:23:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-11-29 23:23:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2023-11-29 23:23:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 7012 transitions. [2023-11-29 23:23:33,898 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4869782623793319 [2023-11-29 23:23:33,899 INFO L72 ComplementDD]: Start complementDD. Operand 121 states and 7012 transitions. [2023-11-29 23:23:33,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 7012 transitions. [2023-11-29 23:23:33,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:33,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 121 states and 7012 transitions. [2023-11-29 23:23:33,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 122 states, 121 states have (on average 57.950413223140494) internal successors, (7012), 121 states have internal predecessors, (7012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:33,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 122 states, 122 states have (on average 119.0) internal successors, (14518), 122 states have internal predecessors, (14518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:33,923 INFO L81 ComplementDD]: Finished complementDD. Result has 122 states, 122 states have (on average 119.0) internal successors, (14518), 122 states have internal predecessors, (14518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:33,924 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 361 predicate places. [2023-11-29 23:23:33,924 INFO L500 AbstractCegarLoop]: Abstraction has has 467 places, 1153 transitions, 21382 flow [2023-11-29 23:23:33,924 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 58.13513513513514) internal successors, (2151), 37 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:33,924 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:33,924 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:23:33,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 23:23:34,129 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:34,130 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:34,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash 257863429, now seen corresponding path program 8 times [2023-11-29 23:23:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:34,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714483636] [2023-11-29 23:23:34,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:34,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:23:35,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714483636] [2023-11-29 23:23:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714483636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585215704] [2023-11-29 23:23:35,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:23:35,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:35,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:35,007 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:35,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 23:23:35,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:23:35,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:35,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 23:23:35,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:35,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 23:23:35,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 23:23:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 23:23:35,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:35,790 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 8)))) is different from false [2023-11-29 23:23:35,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:23:35,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 35 [2023-11-29 23:23:35,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2023-11-29 23:23:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 23:23:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585215704] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:36,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 18] total 48 [2023-11-29 23:23:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496619938] [2023-11-29 23:23:36,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:36,136 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-29 23:23:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-29 23:23:36,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1979, Unknown=1, NotChecked=90, Total=2256 [2023-11-29 23:23:36,139 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 119 [2023-11-29 23:23:36,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 1153 transitions, 21382 flow. Second operand has 48 states, 48 states have (on average 52.104166666666664) internal successors, (2501), 48 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:36,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:36,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 119 [2023-11-29 23:23:36,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:39,124 INFO L124 PetriNetUnfolderBase]: 678/5538 cut-off events. [2023-11-29 23:23:39,124 INFO L125 PetriNetUnfolderBase]: For 53723/54925 co-relation queries the response was YES. [2023-11-29 23:23:39,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26775 conditions, 5538 events. 678/5538 cut-off events. For 53723/54925 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 62581 event pairs, 0 based on Foata normal form. 181/5276 useless extension candidates. Maximal degree in co-relation 6928. Up to 1599 conditions per place. [2023-11-29 23:23:39,156 INFO L140 encePairwiseOnDemand]: 92/119 looper letters, 255 selfloop transitions, 187 changer transitions 857/1341 dead transitions. [2023-11-29 23:23:39,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 1341 transitions, 27871 flow [2023-11-29 23:23:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-29 23:23:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-11-29 23:23:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 4095 transitions. [2023-11-29 23:23:39,165 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2023-11-29 23:23:39,165 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 4095 transitions. [2023-11-29 23:23:39,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 4095 transitions. [2023-11-29 23:23:39,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:39,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 4095 transitions. [2023-11-29 23:23:39,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 52.5) internal successors, (4095), 78 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:39,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 119.0) internal successors, (9401), 79 states have internal predecessors, (9401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:39,180 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 119.0) internal successors, (9401), 79 states have internal predecessors, (9401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:39,180 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 438 predicate places. [2023-11-29 23:23:39,180 INFO L500 AbstractCegarLoop]: Abstraction has has 544 places, 1341 transitions, 27871 flow [2023-11-29 23:23:39,181 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 52.104166666666664) internal successors, (2501), 48 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:39,181 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:39,186 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:23:39,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 23:23:39,390 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 23:23:39,391 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:39,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1633271660, now seen corresponding path program 9 times [2023-11-29 23:23:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:39,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912947355] [2023-11-29 23:23:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 23:23:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912947355] [2023-11-29 23:23:39,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912947355] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359057416] [2023-11-29 23:23:39,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:23:39,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:39,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:39,680 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:39,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 23:23:39,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 23:23:39,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:39,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 23:23:39,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 53 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 23:23:40,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:40,998 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-29 23:23:40,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2023-11-29 23:23:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 23:23:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359057416] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:41,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:41,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27, 22] total 56 [2023-11-29 23:23:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82188709] [2023-11-29 23:23:41,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:41,888 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-29 23:23:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:41,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-29 23:23:41,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2733, Unknown=0, NotChecked=0, Total=3080 [2023-11-29 23:23:41,891 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 119 [2023-11-29 23:23:41,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 1341 transitions, 27871 flow. Second operand has 56 states, 56 states have (on average 52.589285714285715) internal successors, (2945), 56 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:41,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:41,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 119 [2023-11-29 23:23:41,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:48,287 INFO L124 PetriNetUnfolderBase]: 988/8175 cut-off events. [2023-11-29 23:23:48,287 INFO L125 PetriNetUnfolderBase]: For 97315/99505 co-relation queries the response was YES. [2023-11-29 23:23:48,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42988 conditions, 8175 events. 988/8175 cut-off events. For 97315/99505 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 100052 event pairs, 0 based on Foata normal form. 416/7944 useless extension candidates. Maximal degree in co-relation 7407. Up to 2513 conditions per place. [2023-11-29 23:23:48,323 INFO L140 encePairwiseOnDemand]: 88/119 looper letters, 402 selfloop transitions, 47 changer transitions 2049/2538 dead transitions. [2023-11-29 23:23:48,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 2538 transitions, 55165 flow [2023-11-29 23:23:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2023-11-29 23:23:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2023-11-29 23:23:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 8909 transitions. [2023-11-29 23:23:48,330 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.44038556599110235 [2023-11-29 23:23:48,330 INFO L72 ComplementDD]: Start complementDD. Operand 170 states and 8909 transitions. [2023-11-29 23:23:48,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 8909 transitions. [2023-11-29 23:23:48,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:48,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 170 states and 8909 transitions. [2023-11-29 23:23:48,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 171 states, 170 states have (on average 52.40588235294118) internal successors, (8909), 170 states have internal predecessors, (8909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:48,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 171 states, 171 states have (on average 119.0) internal successors, (20349), 171 states have internal predecessors, (20349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:48,361 INFO L81 ComplementDD]: Finished complementDD. Result has 171 states, 171 states have (on average 119.0) internal successors, (20349), 171 states have internal predecessors, (20349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:48,362 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 607 predicate places. [2023-11-29 23:23:48,362 INFO L500 AbstractCegarLoop]: Abstraction has has 713 places, 2538 transitions, 55165 flow [2023-11-29 23:23:48,362 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 52.589285714285715) internal successors, (2945), 56 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:48,362 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:48,363 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:23:48,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-29 23:23:48,567 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 23:23:48,568 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:48,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 983412161, now seen corresponding path program 10 times [2023-11-29 23:23:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:48,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550632163] [2023-11-29 23:23:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 23:23:48,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550632163] [2023-11-29 23:23:48,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550632163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282320812] [2023-11-29 23:23:48,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 23:23:48,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:48,673 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:48,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 23:23:48,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 23:23:48,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:48,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 23:23:48,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 23:23:48,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 23:23:48,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282320812] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:48,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:48,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-29 23:23:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413034211] [2023-11-29 23:23:48,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:48,987 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 23:23:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 23:23:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 23:23:48,988 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2023-11-29 23:23:48,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 2538 transitions, 55165 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:48,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:48,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2023-11-29 23:23:48,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:23:52,212 INFO L124 PetriNetUnfolderBase]: 1539/13320 cut-off events. [2023-11-29 23:23:52,213 INFO L125 PetriNetUnfolderBase]: For 175475/178641 co-relation queries the response was YES. [2023-11-29 23:23:52,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72191 conditions, 13320 events. 1539/13320 cut-off events. For 175475/178641 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 180888 event pairs, 0 based on Foata normal form. 472/12730 useless extension candidates. Maximal degree in co-relation 13230. Up to 4240 conditions per place. [2023-11-29 23:23:52,270 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 172 selfloop transitions, 245 changer transitions 2487/3148 dead transitions. [2023-11-29 23:23:52,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 3148 transitions, 76417 flow [2023-11-29 23:23:52,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 23:23:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 23:23:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2023-11-29 23:23:52,271 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9201680672268907 [2023-11-29 23:23:52,271 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2023-11-29 23:23:52,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2023-11-29 23:23:52,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:23:52,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2023-11-29 23:23:52,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:52,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:52,273 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:52,273 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 612 predicate places. [2023-11-29 23:23:52,273 INFO L500 AbstractCegarLoop]: Abstraction has has 718 places, 3148 transitions, 76417 flow [2023-11-29 23:23:52,273 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:52,273 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:23:52,274 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:23:52,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 23:23:52,478 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 23:23:52,478 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:23:52,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:23:52,479 INFO L85 PathProgramCache]: Analyzing trace with hash -470957604, now seen corresponding path program 11 times [2023-11-29 23:23:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:23:52,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896429287] [2023-11-29 23:23:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:23:52,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:23:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:23:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:23:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:23:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896429287] [2023-11-29 23:23:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896429287] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:23:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146158908] [2023-11-29 23:23:53,315 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 23:23:53,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:23:53,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:23:53,316 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:23:53,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 23:23:53,419 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-29 23:23:53,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:23:53,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 23:23:53,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:23:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 23:23:53,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:23:53,978 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 23:23:53,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 23:23:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 23:23:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146158908] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:23:54,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:23:54,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 13] total 45 [2023-11-29 23:23:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438681992] [2023-11-29 23:23:54,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:23:54,216 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 23:23:54,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:23:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 23:23:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1774, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 23:23:54,219 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 119 [2023-11-29 23:23:54,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 3148 transitions, 76417 flow. Second operand has 45 states, 45 states have (on average 57.84444444444444) internal successors, (2603), 45 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:23:54,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:23:54,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 119 [2023-11-29 23:23:54,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:24:03,729 INFO L124 PetriNetUnfolderBase]: 1921/16362 cut-off events. [2023-11-29 23:24:03,729 INFO L125 PetriNetUnfolderBase]: For 243271/247679 co-relation queries the response was YES. [2023-11-29 23:24:03,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95735 conditions, 16362 events. 1921/16362 cut-off events. For 243271/247679 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 229454 event pairs, 0 based on Foata normal form. 777/15838 useless extension candidates. Maximal degree in co-relation 19004. Up to 5373 conditions per place. [2023-11-29 23:24:03,796 INFO L140 encePairwiseOnDemand]: 94/119 looper letters, 683 selfloop transitions, 370 changer transitions 3938/5036 dead transitions. [2023-11-29 23:24:03,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 897 places, 5036 transitions, 124300 flow [2023-11-29 23:24:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2023-11-29 23:24:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2023-11-29 23:24:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 10460 transitions. [2023-11-29 23:24:03,803 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.488328664799253 [2023-11-29 23:24:03,803 INFO L72 ComplementDD]: Start complementDD. Operand 180 states and 10460 transitions. [2023-11-29 23:24:03,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 10460 transitions. [2023-11-29 23:24:03,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:24:03,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 180 states and 10460 transitions. [2023-11-29 23:24:03,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 181 states, 180 states have (on average 58.111111111111114) internal successors, (10460), 180 states have internal predecessors, (10460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:03,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 181 states, 181 states have (on average 119.0) internal successors, (21539), 181 states have internal predecessors, (21539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:03,830 INFO L81 ComplementDD]: Finished complementDD. Result has 181 states, 181 states have (on average 119.0) internal successors, (21539), 181 states have internal predecessors, (21539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:03,830 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 791 predicate places. [2023-11-29 23:24:03,831 INFO L500 AbstractCegarLoop]: Abstraction has has 897 places, 5036 transitions, 124300 flow [2023-11-29 23:24:03,831 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 57.84444444444444) internal successors, (2603), 45 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:03,831 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:24:03,831 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:24:03,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-29 23:24:04,036 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 23:24:04,037 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:24:04,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:24:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1081725594, now seen corresponding path program 12 times [2023-11-29 23:24:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:24:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825487029] [2023-11-29 23:24:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:24:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:24:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:24:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:24:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:24:04,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825487029] [2023-11-29 23:24:04,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825487029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:24:04,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19942662] [2023-11-29 23:24:04,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 23:24:04,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:24:04,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:24:04,800 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:24:04,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 23:24:04,907 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-29 23:24:04,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:24:04,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 23:24:04,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:24:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 23:24:05,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:24:05,171 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 23:24:05,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 23:24:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 23:24:05,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19942662] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:24:05,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:24:05,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 33 [2023-11-29 23:24:05,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157908349] [2023-11-29 23:24:05,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:24:05,263 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 23:24:05,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:24:05,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 23:24:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 23:24:05,265 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 119 [2023-11-29 23:24:05,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 5036 transitions, 124300 flow. Second operand has 33 states, 33 states have (on average 57.75757575757576) internal successors, (1906), 33 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:05,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:24:05,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 119 [2023-11-29 23:24:05,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:24:16,220 INFO L124 PetriNetUnfolderBase]: 2065/17535 cut-off events. [2023-11-29 23:24:16,220 INFO L125 PetriNetUnfolderBase]: For 297407/301957 co-relation queries the response was YES. [2023-11-29 23:24:16,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109303 conditions, 17535 events. 2065/17535 cut-off events. For 297407/301957 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 249152 event pairs, 0 based on Foata normal form. 665/16811 useless extension candidates. Maximal degree in co-relation 22303. Up to 5775 conditions per place. [2023-11-29 23:24:16,292 INFO L140 encePairwiseOnDemand]: 94/119 looper letters, 595 selfloop transitions, 404 changer transitions 4313/5357 dead transitions. [2023-11-29 23:24:16,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1050 places, 5357 transitions, 143028 flow [2023-11-29 23:24:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2023-11-29 23:24:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2023-11-29 23:24:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 8938 transitions. [2023-11-29 23:24:16,298 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4877223616719415 [2023-11-29 23:24:16,298 INFO L72 ComplementDD]: Start complementDD. Operand 154 states and 8938 transitions. [2023-11-29 23:24:16,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 8938 transitions. [2023-11-29 23:24:16,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:24:16,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 154 states and 8938 transitions. [2023-11-29 23:24:16,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 155 states, 154 states have (on average 58.03896103896104) internal successors, (8938), 154 states have internal predecessors, (8938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:16,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 155 states, 155 states have (on average 119.0) internal successors, (18445), 155 states have internal predecessors, (18445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:16,317 INFO L81 ComplementDD]: Finished complementDD. Result has 155 states, 155 states have (on average 119.0) internal successors, (18445), 155 states have internal predecessors, (18445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:16,318 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 944 predicate places. [2023-11-29 23:24:16,318 INFO L500 AbstractCegarLoop]: Abstraction has has 1050 places, 5357 transitions, 143028 flow [2023-11-29 23:24:16,318 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 57.75757575757576) internal successors, (1906), 33 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:16,318 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:24:16,318 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:24:16,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-29 23:24:16,523 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 23:24:16,523 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:24:16,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:24:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1891045156, now seen corresponding path program 13 times [2023-11-29 23:24:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:24:16,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587435242] [2023-11-29 23:24:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:24:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:24:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:24:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:24:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:24:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587435242] [2023-11-29 23:24:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587435242] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:24:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038022355] [2023-11-29 23:24:17,314 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 23:24:17,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:24:17,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:24:17,315 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:24:17,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 23:24:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:24:17,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 23:24:17,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:24:17,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 23:24:17,515 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 23:24:17,515 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 11 treesize of output 11 [2023-11-29 23:24:18,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 23:24:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:24:18,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:24:18,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:24:18,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 35 [2023-11-29 23:24:18,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2023-11-29 23:24:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 23:24:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038022355] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:24:18,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:24:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 20] total 62 [2023-11-29 23:24:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887588140] [2023-11-29 23:24:18,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:24:18,883 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-29 23:24:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:24:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-29 23:24:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3488, Unknown=2, NotChecked=0, Total=3782 [2023-11-29 23:24:18,887 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 119 [2023-11-29 23:24:18,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1050 places, 5357 transitions, 143028 flow. Second operand has 62 states, 62 states have (on average 48.83870967741935) internal successors, (3028), 62 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:18,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:24:18,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 119 [2023-11-29 23:24:18,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:24:31,551 INFO L124 PetriNetUnfolderBase]: 2164/18274 cut-off events. [2023-11-29 23:24:31,551 INFO L125 PetriNetUnfolderBase]: For 352269/357014 co-relation queries the response was YES. [2023-11-29 23:24:31,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121362 conditions, 18274 events. 2164/18274 cut-off events. For 352269/357014 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 260649 event pairs, 0 based on Foata normal form. 585/17414 useless extension candidates. Maximal degree in co-relation 25357. Up to 6058 conditions per place. [2023-11-29 23:24:31,636 INFO L140 encePairwiseOnDemand]: 94/119 looper letters, 645 selfloop transitions, 436 changer transitions 4462/5583 dead transitions. [2023-11-29 23:24:31,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1146 places, 5583 transitions, 160180 flow [2023-11-29 23:24:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-11-29 23:24:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2023-11-29 23:24:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 4798 transitions. [2023-11-29 23:24:31,640 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.41566317248548906 [2023-11-29 23:24:31,640 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 4798 transitions. [2023-11-29 23:24:31,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 4798 transitions. [2023-11-29 23:24:31,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:24:31,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 4798 transitions. [2023-11-29 23:24:31,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 49.4639175257732) internal successors, (4798), 97 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:31,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 119.0) internal successors, (11662), 98 states have internal predecessors, (11662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:31,651 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 119.0) internal successors, (11662), 98 states have internal predecessors, (11662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:31,651 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 1040 predicate places. [2023-11-29 23:24:31,651 INFO L500 AbstractCegarLoop]: Abstraction has has 1146 places, 5583 transitions, 160180 flow [2023-11-29 23:24:31,652 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 48.83870967741935) internal successors, (3028), 62 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:31,652 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:24:31,652 INFO L232 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:24:31,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 23:24:31,856 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 23:24:31,857 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:24:31,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:24:31,857 INFO L85 PathProgramCache]: Analyzing trace with hash -26498207, now seen corresponding path program 14 times [2023-11-29 23:24:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:24:31,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193736857] [2023-11-29 23:24:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:24:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:24:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:24:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 23:24:32,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:24:32,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193736857] [2023-11-29 23:24:32,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193736857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:24:32,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251119173] [2023-11-29 23:24:32,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:24:32,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:24:32,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:24:32,128 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:24:32,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 23:24:32,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:24:32,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:24:32,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 23:24:32,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:24:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 23:24:32,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:24:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 23:24:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251119173] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:24:32,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:24:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 24 [2023-11-29 23:24:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792436677] [2023-11-29 23:24:32,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:24:32,495 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 23:24:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:24:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 23:24:32,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-11-29 23:24:32,497 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2023-11-29 23:24:32,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1146 places, 5583 transitions, 160180 flow. Second operand has 24 states, 24 states have (on average 89.20833333333333) internal successors, (2141), 24 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:32,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:24:32,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2023-11-29 23:24:32,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:24:52,092 INFO L124 PetriNetUnfolderBase]: 4396/36800 cut-off events. [2023-11-29 23:24:52,093 INFO L125 PetriNetUnfolderBase]: For 831752/841971 co-relation queries the response was YES. [2023-11-29 23:24:52,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249641 conditions, 36800 events. 4396/36800 cut-off events. For 831752/841971 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 579775 event pairs, 0 based on Foata normal form. 1599/35446 useless extension candidates. Maximal degree in co-relation 47864. Up to 12417 conditions per place. [2023-11-29 23:24:52,259 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 472 selfloop transitions, 752 changer transitions 6035/7694 dead transitions. [2023-11-29 23:24:52,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1213 places, 7694 transitions, 248048 flow [2023-11-29 23:24:52,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-29 23:24:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2023-11-29 23:24:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 6075 transitions. [2023-11-29 23:24:52,263 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7507414730598122 [2023-11-29 23:24:52,263 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 6075 transitions. [2023-11-29 23:24:52,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 6075 transitions. [2023-11-29 23:24:52,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:24:52,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 6075 transitions. [2023-11-29 23:24:52,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 89.33823529411765) internal successors, (6075), 68 states have internal predecessors, (6075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:52,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 119.0) internal successors, (8211), 69 states have internal predecessors, (8211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:52,272 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 119.0) internal successors, (8211), 69 states have internal predecessors, (8211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:52,272 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 1107 predicate places. [2023-11-29 23:24:52,272 INFO L500 AbstractCegarLoop]: Abstraction has has 1213 places, 7694 transitions, 248048 flow [2023-11-29 23:24:52,272 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 89.20833333333333) internal successors, (2141), 24 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:52,272 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:24:52,273 INFO L232 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:24:52,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-29 23:24:52,477 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:24:52,477 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:24:52,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:24:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1717293009, now seen corresponding path program 15 times [2023-11-29 23:24:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:24:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741711506] [2023-11-29 23:24:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:24:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:24:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:24:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:24:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:24:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741711506] [2023-11-29 23:24:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741711506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:24:53,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144653806] [2023-11-29 23:24:53,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:24:53,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:24:53,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:24:53,217 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:24:53,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 23:24:53,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 23:24:53,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:24:53,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 23:24:53,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:24:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:24:54,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:24:54,253 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 23:24:54,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 23:24:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-29 23:24:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144653806] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:24:54,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:24:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 15] total 44 [2023-11-29 23:24:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699456672] [2023-11-29 23:24:54,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:24:54,418 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 23:24:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:24:54,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 23:24:54,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1732, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 23:24:54,421 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 119 [2023-11-29 23:24:54,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1213 places, 7694 transitions, 248048 flow. Second operand has 44 states, 44 states have (on average 57.22727272727273) internal successors, (2518), 44 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:24:54,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:24:54,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 119 [2023-11-29 23:24:54,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:26:02,406 INFO L124 PetriNetUnfolderBase]: 6864/60505 cut-off events. [2023-11-29 23:26:02,406 INFO L125 PetriNetUnfolderBase]: For 1428674/1444946 co-relation queries the response was YES. [2023-11-29 23:26:02,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429299 conditions, 60505 events. 6864/60505 cut-off events. For 1428674/1444946 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 1044387 event pairs, 0 based on Foata normal form. 2566/58212 useless extension candidates. Maximal degree in co-relation 67240. Up to 20584 conditions per place. [2023-11-29 23:26:02,768 INFO L140 encePairwiseOnDemand]: 94/119 looper letters, 1425 selfloop transitions, 1043 changer transitions 11293/13806 dead transitions. [2023-11-29 23:26:02,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1472 places, 13806 transitions, 461357 flow [2023-11-29 23:26:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2023-11-29 23:26:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2023-11-29 23:26:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 15113 transitions. [2023-11-29 23:26:02,777 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.48846153846153845 [2023-11-29 23:26:02,778 INFO L72 ComplementDD]: Start complementDD. Operand 260 states and 15113 transitions. [2023-11-29 23:26:02,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 15113 transitions. [2023-11-29 23:26:02,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:26:02,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 260 states and 15113 transitions. [2023-11-29 23:26:02,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 261 states, 260 states have (on average 58.12692307692308) internal successors, (15113), 260 states have internal predecessors, (15113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:26:02,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 261 states, 261 states have (on average 119.0) internal successors, (31059), 261 states have internal predecessors, (31059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:26:02,815 INFO L81 ComplementDD]: Finished complementDD. Result has 261 states, 261 states have (on average 119.0) internal successors, (31059), 261 states have internal predecessors, (31059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:26:02,816 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 1366 predicate places. [2023-11-29 23:26:02,816 INFO L500 AbstractCegarLoop]: Abstraction has has 1472 places, 13806 transitions, 461357 flow [2023-11-29 23:26:02,816 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 57.22727272727273) internal successors, (2518), 44 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:26:02,816 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:26:02,816 INFO L232 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:26:02,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-29 23:26:03,022 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:26:03,023 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:26:03,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:26:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1630669245, now seen corresponding path program 16 times [2023-11-29 23:26:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:26:03,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389274768] [2023-11-29 23:26:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:26:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:26:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:26:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:26:04,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:26:04,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389274768] [2023-11-29 23:26:04,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389274768] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:26:04,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397283305] [2023-11-29 23:26:04,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 23:26:04,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:26:04,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:26:04,403 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:26:04,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 23:26:04,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 23:26:04,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:26:04,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 23:26:04,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:26:05,451 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 19 treesize of output 1 [2023-11-29 23:26:05,628 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-11-29 23:26:05,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 23:26:05,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 23:26:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:26:06,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:26:06,561 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_561)) (.cse1 (* c_~front~0 4))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_562) c_~queue~0.base) (+ c_~queue~0.offset .cse1 16)) 5) (not (= (select (select .cse0 c_~queue~0.base) (+ (* c_~size~0 4) c_~queue~0.offset .cse1 16)) 5))))) is different from false [2023-11-29 23:26:06,588 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_561)) (.cse1 (* c_~front~0 4))) (or (not (= 5 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret9#1.base|) (+ (* c_~size~0 4) .cse1 16 |c_ULTIMATE.start_main_#t~ret9#1.offset|)))) (= 5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_#t~ret9#1.base|) (+ .cse1 16 |c_ULTIMATE.start_main_#t~ret9#1.offset|)))))) is different from false [2023-11-29 23:26:06,603 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_561)) (.cse1 (* c_~front~0 4))) (or (not (= 5 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~size~0 4) .cse1 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (= 5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse1 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2023-11-29 23:26:06,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:26:06,682 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 62 treesize of output 50 [2023-11-29 23:26:06,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:26:06,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 172 [2023-11-29 23:26:06,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:26:06,698 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 57 treesize of output 48 [2023-11-29 23:26:06,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2023-11-29 23:26:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 100 refuted. 21 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 23:26:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397283305] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:26:06,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:26:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34, 24] total 78 [2023-11-29 23:26:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059612654] [2023-11-29 23:26:06,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:26:06,959 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-11-29 23:26:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:26:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-11-29 23:26:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=5173, Unknown=12, NotChecked=444, Total=6006 [2023-11-29 23:26:06,963 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 119 [2023-11-29 23:26:06,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1472 places, 13806 transitions, 461357 flow. Second operand has 78 states, 78 states have (on average 49.717948717948715) internal successors, (3878), 78 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:26:06,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:26:06,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 119 [2023-11-29 23:26:06,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:26:13,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4))) (and (= 5 (select (select |c_#memory_int| c_~queue~0.base) .cse0)) (= c_~queue~0.offset 0) (= 5 c_~x~0) (forall ((v_ArrVal_562 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_562) c_~queue~0.base) (+ c_~queue~0.offset .cse0 16)))))) is different from false [2023-11-29 23:26:16,957 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (and (= (select .cse0 (+ .cse1 4)) 5) (= 5 (select .cse0 .cse1)) (= c_~queue~0.offset 0) (= 5 c_~x~0) (forall ((v_ArrVal_562 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_562) c_~queue~0.base) (+ c_~queue~0.offset .cse1 16)))))) is different from false [2023-11-29 23:26:20,107 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4))) (and (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) 5) (= 5 c_~x~0) (forall ((v_ArrVal_562 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_562) c_~queue~0.base) (+ c_~queue~0.offset .cse0 16)))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) is different from false [2023-11-29 23:28:19,836 INFO L124 PetriNetUnfolderBase]: 7374/64022 cut-off events. [2023-11-29 23:28:19,836 INFO L125 PetriNetUnfolderBase]: For 1691119/1710393 co-relation queries the response was YES. [2023-11-29 23:28:19,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480543 conditions, 64022 events. 7374/64022 cut-off events. For 1691119/1710393 co-relation queries the response was YES. Maximal size of possible extension queue 2109. Compared 1110830 event pairs, 0 based on Foata normal form. 2630/61514 useless extension candidates. Maximal degree in co-relation 77805. Up to 21904 conditions per place. [2023-11-29 23:28:20,199 INFO L140 encePairwiseOnDemand]: 90/119 looper letters, 2311 selfloop transitions, 452 changer transitions 11955/14760 dead transitions. [2023-11-29 23:28:20,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1624 places, 14760 transitions, 522393 flow [2023-11-29 23:28:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2023-11-29 23:28:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2023-11-29 23:28:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 7731 transitions. [2023-11-29 23:28:20,204 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4246169055857637 [2023-11-29 23:28:20,204 INFO L72 ComplementDD]: Start complementDD. Operand 153 states and 7731 transitions. [2023-11-29 23:28:20,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 7731 transitions. [2023-11-29 23:28:20,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:28:20,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 153 states and 7731 transitions. [2023-11-29 23:28:20,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 154 states, 153 states have (on average 50.529411764705884) internal successors, (7731), 153 states have internal predecessors, (7731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:28:20,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 154 states, 154 states have (on average 119.0) internal successors, (18326), 154 states have internal predecessors, (18326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:28:20,220 INFO L81 ComplementDD]: Finished complementDD. Result has 154 states, 154 states have (on average 119.0) internal successors, (18326), 154 states have internal predecessors, (18326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:28:20,220 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 1518 predicate places. [2023-11-29 23:28:20,220 INFO L500 AbstractCegarLoop]: Abstraction has has 1624 places, 14760 transitions, 522393 flow [2023-11-29 23:28:20,221 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 49.717948717948715) internal successors, (3878), 78 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:28:20,221 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:28:20,221 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:28:20,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-29 23:28:20,426 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:28:20,427 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:28:20,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:28:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1167676238, now seen corresponding path program 17 times [2023-11-29 23:28:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:28:20,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730545536] [2023-11-29 23:28:20,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:28:20,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:28:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:28:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 52 proven. 105 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-29 23:28:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:28:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730545536] [2023-11-29 23:28:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730545536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:28:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926560314] [2023-11-29 23:28:20,754 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 23:28:20,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:28:20,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:28:20,755 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:28:20,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 23:28:20,884 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-11-29 23:28:20,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:28:20,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 23:28:20,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:28:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 72 proven. 50 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-29 23:28:21,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:28:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 72 proven. 50 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-29 23:28:21,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926560314] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:28:21,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:28:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 8] total 28 [2023-11-29 23:28:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248886311] [2023-11-29 23:28:21,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:28:21,206 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 23:28:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:28:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 23:28:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2023-11-29 23:28:21,208 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2023-11-29 23:28:21,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1624 places, 14760 transitions, 522393 flow. Second operand has 28 states, 28 states have (on average 89.03571428571429) internal successors, (2493), 28 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:28:21,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:28:21,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2023-11-29 23:28:21,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:32:47,884 INFO L124 PetriNetUnfolderBase]: 14073/119180 cut-off events. [2023-11-29 23:32:47,884 INFO L125 PetriNetUnfolderBase]: For 3650005/3693125 co-relation queries the response was YES. [2023-11-29 23:32:48,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919674 conditions, 119180 events. 14073/119180 cut-off events. For 3650005/3693125 co-relation queries the response was YES. Maximal size of possible extension queue 3415. Compared 2216895 event pairs, 0 based on Foata normal form. 7509/117075 useless extension candidates. Maximal degree in co-relation 148549. Up to 41308 conditions per place. [2023-11-29 23:32:48,708 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 1201 selfloop transitions, 2012 changer transitions 16761/21019 dead transitions. [2023-11-29 23:32:48,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1710 places, 21019 transitions, 822423 flow [2023-11-29 23:32:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-29 23:32:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-11-29 23:32:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 7776 transitions. [2023-11-29 23:32:48,712 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.751086641553173 [2023-11-29 23:32:48,712 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 7776 transitions. [2023-11-29 23:32:48,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 7776 transitions. [2023-11-29 23:32:48,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:32:48,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 7776 transitions. [2023-11-29 23:32:48,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 89.37931034482759) internal successors, (7776), 87 states have internal predecessors, (7776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:32:48,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 119.0) internal successors, (10472), 88 states have internal predecessors, (10472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:32:48,722 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 119.0) internal successors, (10472), 88 states have internal predecessors, (10472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:32:48,723 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, 1604 predicate places. [2023-11-29 23:32:48,723 INFO L500 AbstractCegarLoop]: Abstraction has has 1710 places, 21019 transitions, 822423 flow [2023-11-29 23:32:48,723 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 89.03571428571429) internal successors, (2493), 28 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:32:48,723 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:32:48,723 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:32:48,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 23:32:48,928 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:32:48,928 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:32:48,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:32:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1028445126, now seen corresponding path program 18 times [2023-11-29 23:32:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:32:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001888480] [2023-11-29 23:32:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:32:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:32:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:32:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 23:32:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:32:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001888480] [2023-11-29 23:32:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001888480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:32:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475889916] [2023-11-29 23:32:49,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 23:32:49,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:32:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:32:49,436 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:32:49,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 23:32:49,847 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-11-29 23:32:49,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:32:49,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 23:32:49,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:32:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 40 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:32:51,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:32:51,897 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-29 23:32:51,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2023-11-29 23:32:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 40 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:32:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475889916] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:32:54,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:32:54,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 39, 34] total 84 [2023-11-29 23:32:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178142732] [2023-11-29 23:32:54,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:32:54,313 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-11-29 23:32:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:32:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-11-29 23:32:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=6257, Unknown=0, NotChecked=0, Total=6972 [2023-11-29 23:32:54,318 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 119 [2023-11-29 23:32:54,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1710 places, 21019 transitions, 822423 flow. Second operand has 84 states, 84 states have (on average 51.726190476190474) internal successors, (4345), 84 states have internal predecessors, (4345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:32:54,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:32:54,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 119 [2023-11-29 23:32:54,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-29 23:36:49,932 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 23:36:49,932 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-11-29 23:36:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2023-11-29 23:36:50,098 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-29 23:36:50,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 23:36:50,298 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:36:50,298 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (84states, 49/119 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 438541 conditions, 58283 events (7146/58282 cut-off events. For 1898430/1919438 co-relation queries the response was YES. Maximal size of possible extension queue 4225. Compared 1087673 event pairs, 0 based on Foata normal form. 3286/60146 useless extension candidates. Maximal degree in co-relation 78168. Up to 17864 conditions per place.). [2023-11-29 23:36:50,300 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-29 23:36:50,300 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-29 23:36:50,300 INFO L457 BasicCegarLoop]: Path program histogram: [18, 1, 1, 1, 1] [2023-11-29 23:36:50,303 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 23:36:50,303 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 23:36:50,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:36:50 BasicIcfg [2023-11-29 23:36:50,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 23:36:50,305 INFO L158 Benchmark]: Toolchain (without parser) took 815446.29ms. Allocated memory was 572.5MB in the beginning and 4.1GB in the end (delta: 3.5GB). Free memory was 528.3MB in the beginning and 639.3MB in the end (delta: -111.1MB). Peak memory consumption was 3.6GB. Max. memory is 16.0GB. [2023-11-29 23:36:50,305 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 398.5MB. Free memory was 349.5MB in the beginning and 349.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 23:36:50,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.06ms. Allocated memory is still 572.5MB. Free memory was 527.8MB in the beginning and 516.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-29 23:36:50,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.41ms. Allocated memory is still 572.5MB. Free memory was 516.3MB in the beginning and 514.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 23:36:50,306 INFO L158 Benchmark]: Boogie Preprocessor took 15.98ms. Allocated memory is still 572.5MB. Free memory was 514.6MB in the beginning and 512.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:36:50,306 INFO L158 Benchmark]: RCFGBuilder took 434.14ms. Allocated memory is still 572.5MB. Free memory was 512.9MB in the beginning and 489.8MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-29 23:36:50,306 INFO L158 Benchmark]: TraceAbstraction took 814791.22ms. Allocated memory was 572.5MB in the beginning and 4.1GB in the end (delta: 3.5GB). Free memory was 489.0MB in the beginning and 639.3MB in the end (delta: -150.4MB). Peak memory consumption was 3.6GB. Max. memory is 16.0GB. [2023-11-29 23:36:50,307 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.09ms. Allocated memory is still 398.5MB. Free memory was 349.5MB in the beginning and 349.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 176.06ms. Allocated memory is still 572.5MB. Free memory was 527.8MB in the beginning and 516.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 23.41ms. Allocated memory is still 572.5MB. Free memory was 516.3MB in the beginning and 514.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 15.98ms. Allocated memory is still 572.5MB. Free memory was 514.6MB in the beginning and 512.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 434.14ms. Allocated memory is still 572.5MB. Free memory was 512.9MB in the beginning and 489.8MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 814791.22ms. Allocated memory was 572.5MB in the beginning and 4.1GB in the end (delta: 3.5GB). Free memory was 489.0MB in the beginning and 639.3MB in the end (delta: -150.4MB). Peak memory consumption was 3.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (84states, 49/119 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 438541 conditions, 58283 events (7146/58282 cut-off events. For 1898430/1919438 co-relation queries the response was YES. Maximal size of possible extension queue 4225. Compared 1087673 event pairs, 0 based on Foata normal form. 3286/60146 useless extension candidates. Maximal degree in co-relation 78168. Up to 17864 conditions per place.). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (84states, 49/119 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 438541 conditions, 58283 events (7146/58282 cut-off events. For 1898430/1919438 co-relation queries the response was YES. Maximal size of possible extension queue 4225. Compared 1087673 event pairs, 0 based on Foata normal form. 3286/60146 useless extension candidates. Maximal degree in co-relation 78168. Up to 17864 conditions per place.). - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (84states, 49/119 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 438541 conditions, 58283 events (7146/58282 cut-off events. For 1898430/1919438 co-relation queries the response was YES. Maximal size of possible extension queue 4225. Compared 1087673 event pairs, 0 based on Foata normal form. 3286/60146 useless extension candidates. Maximal degree in co-relation 78168. Up to 17864 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 131 locations, 3 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: 814.7s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 779.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 18760 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18760 mSDsluCounter, 15182 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2562 IncrementalHoareTripleChecker+Unchecked, 14444 mSDsCounter, 947 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35710 IncrementalHoareTripleChecker+Invalid, 39245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 947 mSolverCounterUnsat, 738 mSDtfsCounter, 35710 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7027 GetRequests, 4639 SyntacticMatches, 31 SemanticMatches, 2357 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 168300 ImplicationChecksByTransitivity, 42.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822423occurred in iteration=21, InterpolantAutomatonStates: 1625, 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.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 5344 NumberOfCodeBlocks, 5295 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 7784 ConstructedInterpolants, 212 QuantifiedInterpolants, 63393 SizeOfPredicates, 248 NumberOfNonLiveVariables, 5607 ConjunctsInSsa, 577 ConjunctsInUnsatCore, 58 InterpolantComputations, 4 PerfectInterpolantSequences, 1904/5271 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