/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:55:44,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:55:44,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 14:55:44,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:55:44,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:55:44,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:55:44,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:55:44,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:55:44,593 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:55:44,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:55:44,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:55:44,597 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:55:44,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:55:44,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:55:44,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:55:44,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:55:44,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:55:44,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:55:44,598 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:55:44,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:55:44,599 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:55:44,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:55:44,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:55:44,600 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:55:44,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:55:44,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:55:44,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:55:44,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:55:44,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:55:44,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:55:44,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:55:44,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:55:44,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:55:44,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 14:55:44,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:55:44,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:55:44,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:55:44,821 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:55:44,821 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:55:44,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2023-12-09 14:55:46,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:55:46,225 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:55:46,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2023-12-09 14:55:46,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9241bc59c/4c0415a84fb64afdb18989b6e18af936/FLAG063511151 [2023-12-09 14:55:46,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9241bc59c/4c0415a84fb64afdb18989b6e18af936 [2023-12-09 14:55:46,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:55:46,265 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:55:46,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:55:46,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:55:46,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:55:46,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758bac2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46, skipping insertion in model container [2023-12-09 14:55:46,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,315 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:55:46,582 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2023-12-09 14:55:46,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:55:46,601 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:55:46,644 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2023-12-09 14:55:46,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:55:46,685 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:55:46,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46 WrapperNode [2023-12-09 14:55:46,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:55:46,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:55:46,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:55:46,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:55:46,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,720 INFO L138 Inliner]: procedures = 165, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2023-12-09 14:55:46,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:55:46,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:55:46,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:55:46,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:55:46,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:55:46,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:55:46,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:55:46,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:55:46,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (1/1) ... [2023-12-09 14:55:46,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:55:46,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:55:46,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 14:55:46,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 14:55:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-09 14:55:46,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-09 14:55:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:55:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 14:55:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:55:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:55:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:55:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:55:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 14:55:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:55:46,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:55:46,805 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 14:55:46,892 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:55:46,893 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:55:47,078 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:55:47,097 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:55:47,098 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-09 14:55:47,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:55:47 BoogieIcfgContainer [2023-12-09 14:55:47,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:55:47,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:55:47,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:55:47,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:55:47,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:55:46" (1/3) ... [2023-12-09 14:55:47,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bee63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:55:47, skipping insertion in model container [2023-12-09 14:55:47,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:46" (2/3) ... [2023-12-09 14:55:47,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bee63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:55:47, skipping insertion in model container [2023-12-09 14:55:47,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:55:47" (3/3) ... [2023-12-09 14:55:47,108 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2023-12-09 14:55:47,122 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:55:47,122 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-09 14:55:47,122 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:55:47,188 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:47,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 146 flow [2023-12-09 14:55:47,270 INFO L124 PetriNetUnfolderBase]: 5/107 cut-off events. [2023-12-09 14:55:47,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:47,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 107 events. 5/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 53. Up to 4 conditions per place. [2023-12-09 14:55:47,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 146 flow [2023-12-09 14:55:47,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 146 flow [2023-12-09 14:55:47,294 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:47,299 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;@4caa22a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:47,299 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 14:55:47,316 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:47,316 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-09 14:55:47,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:47,317 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:47,317 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:47,318 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 14:55:47,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash -108932933, now seen corresponding path program 1 times [2023-12-09 14:55:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:47,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52007031] [2023-12-09 14:55:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:47,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:47,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52007031] [2023-12-09 14:55:47,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52007031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:47,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:47,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:47,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961473878] [2023-12-09 14:55:47,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:47,511 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:55:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:47,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:55:47,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:55:47,532 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 71 [2023-12-09 14:55:47,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:47,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 71 [2023-12-09 14:55:47,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:47,575 INFO L124 PetriNetUnfolderBase]: 4/125 cut-off events. [2023-12-09 14:55:47,575 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:55:47,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 125 events. 4/125 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 4 based on Foata normal form. 9/124 useless extension candidates. Maximal degree in co-relation 85. Up to 16 conditions per place. [2023-12-09 14:55:47,576 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 5 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2023-12-09 14:55:47,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 146 flow [2023-12-09 14:55:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:55:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:55:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 130 transitions. [2023-12-09 14:55:47,586 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2023-12-09 14:55:47,586 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 130 transitions. [2023-12-09 14:55:47,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 130 transitions. [2023-12-09 14:55:47,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:47,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 130 transitions. [2023-12-09 14:55:47,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,593 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,599 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, -1 predicate places. [2023-12-09 14:55:47,599 INFO L500 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 146 flow [2023-12-09 14:55:47,599 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,599 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:47,599 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:47,600 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:55:47,600 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 14:55:47,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1785069473, now seen corresponding path program 1 times [2023-12-09 14:55:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691725316] [2023-12-09 14:55:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:47,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691725316] [2023-12-09 14:55:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691725316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:47,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:47,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:55:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62501860] [2023-12-09 14:55:47,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:47,763 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:47,764 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 71 [2023-12-09 14:55:47,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:47,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 71 [2023-12-09 14:55:47,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:47,815 INFO L124 PetriNetUnfolderBase]: 31/230 cut-off events. [2023-12-09 14:55:47,815 INFO L125 PetriNetUnfolderBase]: For 21/33 co-relation queries the response was YES. [2023-12-09 14:55:47,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 230 events. 31/230 cut-off events. For 21/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 843 event pairs, 13 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 288. Up to 52 conditions per place. [2023-12-09 14:55:47,816 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 14 selfloop transitions, 4 changer transitions 6/76 dead transitions. [2023-12-09 14:55:47,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 222 flow [2023-12-09 14:55:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-12-09 14:55:47,818 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8544600938967136 [2023-12-09 14:55:47,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-12-09 14:55:47,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-12-09 14:55:47,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:47,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-12-09 14:55:47,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,821 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 1 predicate places. [2023-12-09 14:55:47,822 INFO L500 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 222 flow [2023-12-09 14:55:47,822 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,822 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:47,822 INFO L233 CegarLoopForPetriNet]: trace histogram [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] [2023-12-09 14:55:47,822 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 14:55:47,822 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 14:55:47,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1465462335, now seen corresponding path program 1 times [2023-12-09 14:55:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353901775] [2023-12-09 14:55:47,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:47,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:47,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:47,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:47,860 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:47,861 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-09 14:55:47,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-09 14:55:47,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-12-09 14:55:47,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-09 14:55:47,863 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 14:55:47,863 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:55:47,864 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:47,865 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 14:55:47,877 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:47,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 86 transitions, 182 flow [2023-12-09 14:55:47,906 INFO L124 PetriNetUnfolderBase]: 8/160 cut-off events. [2023-12-09 14:55:47,907 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:55:47,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 160 events. 8/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 389 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 108. Up to 6 conditions per place. [2023-12-09 14:55:47,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 86 transitions, 182 flow [2023-12-09 14:55:47,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 86 transitions, 182 flow [2023-12-09 14:55:47,910 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:47,910 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;@4caa22a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:47,911 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:55:47,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:47,914 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-09 14:55:47,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:47,914 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:47,914 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:47,914 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:55:47,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash 19815761, now seen corresponding path program 1 times [2023-12-09 14:55:47,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:47,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291482787] [2023-12-09 14:55:47,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:47,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:47,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:47,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291482787] [2023-12-09 14:55:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291482787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:47,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:47,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:47,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140401855] [2023-12-09 14:55:47,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:47,936 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:55:47,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:47,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:55:47,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:55:47,937 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 86 [2023-12-09 14:55:47,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:47,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 86 [2023-12-09 14:55:47,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:47,974 INFO L124 PetriNetUnfolderBase]: 34/324 cut-off events. [2023-12-09 14:55:47,974 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-12-09 14:55:47,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 324 events. 34/324 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1592 event pairs, 34 based on Foata normal form. 39/324 useless extension candidates. Maximal degree in co-relation 251. Up to 73 conditions per place. [2023-12-09 14:55:47,978 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 8 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2023-12-09 14:55:47,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 184 flow [2023-12-09 14:55:47,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:55:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:55:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 154 transitions. [2023-12-09 14:55:47,983 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8953488372093024 [2023-12-09 14:55:47,983 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 154 transitions. [2023-12-09 14:55:47,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 154 transitions. [2023-12-09 14:55:47,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:47,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 154 transitions. [2023-12-09 14:55:47,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,990 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,991 INFO L308 CegarLoopForPetriNet]: 87 programPoint places, -2 predicate places. [2023-12-09 14:55:47,991 INFO L500 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 184 flow [2023-12-09 14:55:47,991 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,992 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:47,992 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:47,992 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:55:47,992 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:55:47,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1931702497, now seen corresponding path program 1 times [2023-12-09 14:55:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789011589] [2023-12-09 14:55:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789011589] [2023-12-09 14:55:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789011589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:55:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482198279] [2023-12-09 14:55:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:48,131 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:48,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:48,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:48,133 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 86 [2023-12-09 14:55:48,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:48,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 86 [2023-12-09 14:55:48,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:48,354 INFO L124 PetriNetUnfolderBase]: 598/1632 cut-off events. [2023-12-09 14:55:48,355 INFO L125 PetriNetUnfolderBase]: For 291/499 co-relation queries the response was YES. [2023-12-09 14:55:48,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 1632 events. 598/1632 cut-off events. For 291/499 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 11362 event pairs, 258 based on Foata normal form. 0/1524 useless extension candidates. Maximal degree in co-relation 2723. Up to 623 conditions per place. [2023-12-09 14:55:48,364 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 31 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2023-12-09 14:55:48,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 309 flow [2023-12-09 14:55:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2023-12-09 14:55:48,365 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8294573643410853 [2023-12-09 14:55:48,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2023-12-09 14:55:48,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2023-12-09 14:55:48,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:48,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2023-12-09 14:55:48,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,369 INFO L308 CegarLoopForPetriNet]: 87 programPoint places, 0 predicate places. [2023-12-09 14:55:48,369 INFO L500 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 309 flow [2023-12-09 14:55:48,369 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,369 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:48,370 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:48,370 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 14:55:48,370 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:55:48,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1091394778, now seen corresponding path program 1 times [2023-12-09 14:55:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:48,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917274118] [2023-12-09 14:55:48,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:48,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:48,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:48,423 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:48,423 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-09 14:55:48,423 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:55:48,423 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-12-09 14:55:48,424 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-09 14:55:48,424 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:55:48,424 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 14:55:48,424 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:55:48,425 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:48,425 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 14:55:48,454 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:48,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 220 flow [2023-12-09 14:55:48,474 INFO L124 PetriNetUnfolderBase]: 11/213 cut-off events. [2023-12-09 14:55:48,476 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:55:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 213 events. 11/213 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 164. Up to 8 conditions per place. [2023-12-09 14:55:48,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 101 transitions, 220 flow [2023-12-09 14:55:48,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 101 transitions, 220 flow [2023-12-09 14:55:48,488 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:48,491 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;@4caa22a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:48,491 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-09 14:55:48,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:48,496 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-12-09 14:55:48,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:48,496 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:48,497 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:48,497 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:55:48,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:48,497 INFO L85 PathProgramCache]: Analyzing trace with hash 21196182, now seen corresponding path program 1 times [2023-12-09 14:55:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:48,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089942018] [2023-12-09 14:55:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:48,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089942018] [2023-12-09 14:55:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089942018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:48,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:48,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:48,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336455338] [2023-12-09 14:55:48,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:48,519 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:55:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:48,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:55:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:55:48,523 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 101 [2023-12-09 14:55:48,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 101 transitions, 220 flow. Second operand has 2 states, 2 states have (on average 82.0) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:48,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 101 [2023-12-09 14:55:48,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:48,612 INFO L124 PetriNetUnfolderBase]: 178/934 cut-off events. [2023-12-09 14:55:48,612 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-12-09 14:55:48,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 934 events. 178/934 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6645 event pairs, 178 based on Foata normal form. 158/970 useless extension candidates. Maximal degree in co-relation 819. Up to 298 conditions per place. [2023-12-09 14:55:48,620 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 11 selfloop transitions, 0 changer transitions 0/92 dead transitions. [2023-12-09 14:55:48,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 224 flow [2023-12-09 14:55:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:55:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:55:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 178 transitions. [2023-12-09 14:55:48,622 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8811881188118812 [2023-12-09 14:55:48,622 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 178 transitions. [2023-12-09 14:55:48,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 178 transitions. [2023-12-09 14:55:48,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:48,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 178 transitions. [2023-12-09 14:55:48,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,623 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,625 INFO L308 CegarLoopForPetriNet]: 103 programPoint places, -3 predicate places. [2023-12-09 14:55:48,625 INFO L500 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 224 flow [2023-12-09 14:55:48,625 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.0) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,625 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:48,625 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:48,625 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 14:55:48,625 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:55:48,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash 106251841, now seen corresponding path program 1 times [2023-12-09 14:55:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139661925] [2023-12-09 14:55:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139661925] [2023-12-09 14:55:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139661925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:55:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565200308] [2023-12-09 14:55:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:48,696 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:48,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:48,697 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 101 [2023-12-09 14:55:48,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:48,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:48,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 101 [2023-12-09 14:55:48,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:50,071 INFO L124 PetriNetUnfolderBase]: 7714/15668 cut-off events. [2023-12-09 14:55:50,072 INFO L125 PetriNetUnfolderBase]: For 3409/9147 co-relation queries the response was YES. [2023-12-09 14:55:50,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31622 conditions, 15668 events. 7714/15668 cut-off events. For 3409/9147 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 141937 event pairs, 2748 based on Foata normal form. 0/14449 useless extension candidates. Maximal degree in co-relation 12839. Up to 6671 conditions per place. [2023-12-09 14:55:50,252 INFO L140 encePairwiseOnDemand]: 89/101 looper letters, 42 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2023-12-09 14:55:50,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 114 transitions, 400 flow [2023-12-09 14:55:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2023-12-09 14:55:50,254 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8118811881188119 [2023-12-09 14:55:50,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2023-12-09 14:55:50,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2023-12-09 14:55:50,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:50,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2023-12-09 14:55:50,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,256 INFO L308 CegarLoopForPetriNet]: 103 programPoint places, -1 predicate places. [2023-12-09 14:55:50,258 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 114 transitions, 400 flow [2023-12-09 14:55:50,258 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,258 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:50,258 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:50,258 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 14:55:50,258 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:55:50,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1475814095, now seen corresponding path program 1 times [2023-12-09 14:55:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:50,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830111102] [2023-12-09 14:55:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-09 14:55:50,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:50,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830111102] [2023-12-09 14:55:50,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830111102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:50,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:50,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:55:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656314766] [2023-12-09 14:55:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:50,345 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:50,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:50,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:50,347 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 101 [2023-12-09 14:55:50,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 114 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:50,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 101 [2023-12-09 14:55:50,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:50,415 INFO L124 PetriNetUnfolderBase]: 47/596 cut-off events. [2023-12-09 14:55:50,415 INFO L125 PetriNetUnfolderBase]: For 1056/1714 co-relation queries the response was YES. [2023-12-09 14:55:50,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 596 events. 47/596 cut-off events. For 1056/1714 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3613 event pairs, 17 based on Foata normal form. 223/794 useless extension candidates. Maximal degree in co-relation 457. Up to 166 conditions per place. [2023-12-09 14:55:50,418 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 13 selfloop transitions, 6 changer transitions 18/88 dead transitions. [2023-12-09 14:55:50,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 88 transitions, 346 flow [2023-12-09 14:55:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2023-12-09 14:55:50,419 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8184818481848185 [2023-12-09 14:55:50,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2023-12-09 14:55:50,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2023-12-09 14:55:50,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:50,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2023-12-09 14:55:50,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,422 INFO L308 CegarLoopForPetriNet]: 103 programPoint places, -7 predicate places. [2023-12-09 14:55:50,422 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 346 flow [2023-12-09 14:55:50,422 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,422 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:50,422 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:50,422 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 14:55:50,422 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:55:50,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 472083841, now seen corresponding path program 1 times [2023-12-09 14:55:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102370404] [2023-12-09 14:55:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:50,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:50,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:50,456 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:50,456 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-09 14:55:50,456 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-09 14:55:50,456 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-12-09 14:55:50,456 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-09 14:55:50,456 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-09 14:55:50,457 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-09 14:55:50,457 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 14:55:50,457 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-09 14:55:50,457 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:50,457 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 14:55:50,479 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:50,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 116 transitions, 260 flow [2023-12-09 14:55:50,498 INFO L124 PetriNetUnfolderBase]: 14/266 cut-off events. [2023-12-09 14:55:50,498 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-09 14:55:50,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 266 events. 14/266 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 754 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 221. Up to 10 conditions per place. [2023-12-09 14:55:50,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 116 transitions, 260 flow [2023-12-09 14:55:50,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 116 transitions, 260 flow [2023-12-09 14:55:50,502 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:50,502 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;@4caa22a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:50,502 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-09 14:55:50,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:50,504 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-12-09 14:55:50,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:50,504 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:50,504 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:50,504 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-09 14:55:50,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -104791670, now seen corresponding path program 1 times [2023-12-09 14:55:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:50,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205048016] [2023-12-09 14:55:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:50,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205048016] [2023-12-09 14:55:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205048016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773159977] [2023-12-09 14:55:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:50,531 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:55:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:50,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:55:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:55:50,532 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2023-12-09 14:55:50,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 260 flow. Second operand has 2 states, 2 states have (on average 92.0) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:50,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2023-12-09 14:55:50,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:50,815 INFO L124 PetriNetUnfolderBase]: 772/2885 cut-off events. [2023-12-09 14:55:50,816 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-12-09 14:55:50,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 2885 events. 772/2885 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 26026 event pairs, 772 based on Foata normal form. 582/3118 useless extension candidates. Maximal degree in co-relation 2737. Up to 1135 conditions per place. [2023-12-09 14:55:50,840 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 14 selfloop transitions, 0 changer transitions 0/105 dead transitions. [2023-12-09 14:55:50,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 105 transitions, 266 flow [2023-12-09 14:55:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:55:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:55:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-12-09 14:55:50,843 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8706896551724138 [2023-12-09 14:55:50,843 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-12-09 14:55:50,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-12-09 14:55:50,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:50,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-12-09 14:55:50,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,845 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,846 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, -4 predicate places. [2023-12-09 14:55:50,846 INFO L500 AbstractCegarLoop]: Abstraction has has 115 places, 105 transitions, 266 flow [2023-12-09 14:55:50,846 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 92.0) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,846 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:50,846 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:50,846 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 14:55:50,846 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-09 14:55:50,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 603684801, now seen corresponding path program 1 times [2023-12-09 14:55:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339902201] [2023-12-09 14:55:50,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:50,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339902201] [2023-12-09 14:55:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339902201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:50,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:55:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015784592] [2023-12-09 14:55:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:50,912 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:50,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:50,914 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 116 [2023-12-09 14:55:50,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 105 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:50,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:50,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 116 [2023-12-09 14:55:50,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:56:04,237 INFO L124 PetriNetUnfolderBase]: 83095/141728 cut-off events. [2023-12-09 14:56:04,238 INFO L125 PetriNetUnfolderBase]: For 34935/77111 co-relation queries the response was YES. [2023-12-09 14:56:05,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298187 conditions, 141728 events. 83095/141728 cut-off events. For 34935/77111 co-relation queries the response was YES. Maximal size of possible extension queue 5706. Compared 1444980 event pairs, 30386 based on Foata normal form. 0/130962 useless extension candidates. Maximal degree in co-relation 136344. Up to 64662 conditions per place. [2023-12-09 14:56:05,902 INFO L140 encePairwiseOnDemand]: 101/116 looper letters, 53 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2023-12-09 14:56:05,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 133 transitions, 495 flow [2023-12-09 14:56:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:56:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:56:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-12-09 14:56:05,904 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7988505747126436 [2023-12-09 14:56:05,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-12-09 14:56:05,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-12-09 14:56:05,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:56:05,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-12-09 14:56:05,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:05,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:05,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:05,906 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, -2 predicate places. [2023-12-09 14:56:05,906 INFO L500 AbstractCegarLoop]: Abstraction has has 117 places, 133 transitions, 495 flow [2023-12-09 14:56:05,907 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:05,907 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:56:05,907 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:56:05,907 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 14:56:05,907 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-09 14:56:05,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:56:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash 764955911, now seen corresponding path program 1 times [2023-12-09 14:56:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:56:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795859865] [2023-12-09 14:56:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:56:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:56:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:56:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-09 14:56:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:56:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795859865] [2023-12-09 14:56:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795859865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:56:05,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:56:05,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:56:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747868735] [2023-12-09 14:56:05,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:56:05,951 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:56:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:56:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:56:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:56:05,951 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 116 [2023-12-09 14:56:05,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 133 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:05,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:56:05,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 116 [2023-12-09 14:56:05,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:56:06,076 INFO L124 PetriNetUnfolderBase]: 151/1397 cut-off events. [2023-12-09 14:56:06,076 INFO L125 PetriNetUnfolderBase]: For 3776/4886 co-relation queries the response was YES. [2023-12-09 14:56:06,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 1397 events. 151/1397 cut-off events. For 3776/4886 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11408 event pairs, 62 based on Foata normal form. 840/2185 useless extension candidates. Maximal degree in co-relation 1262. Up to 438 conditions per place. [2023-12-09 14:56:06,084 INFO L140 encePairwiseOnDemand]: 106/116 looper letters, 16 selfloop transitions, 8 changer transitions 18/101 dead transitions. [2023-12-09 14:56:06,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 436 flow [2023-12-09 14:56:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:56:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:56:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-12-09 14:56:06,085 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8132183908045977 [2023-12-09 14:56:06,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-12-09 14:56:06,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-12-09 14:56:06,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:56:06,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-12-09 14:56:06,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:06,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:06,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:06,087 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, -10 predicate places. [2023-12-09 14:56:06,087 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 101 transitions, 436 flow [2023-12-09 14:56:06,088 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:06,088 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:56:06,088 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:56:06,088 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 14:56:06,088 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-09 14:56:06,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:56:06,088 INFO L85 PathProgramCache]: Analyzing trace with hash -207198636, now seen corresponding path program 1 times [2023-12-09 14:56:06,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:56:06,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954670087] [2023-12-09 14:56:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:56:06,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:56:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:56:06,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:56:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:56:06,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:56:06,129 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:56:06,129 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-12-09 14:56:06,130 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-09 14:56:06,130 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-12-09 14:56:06,130 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-12-09 14:56:06,130 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-12-09 14:56:06,130 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-12-09 14:56:06,130 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-09 14:56:06,130 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-09 14:56:06,130 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-09 14:56:06,132 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:56:06,132 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-09 14:56:06,152 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:56:06,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 131 transitions, 302 flow [2023-12-09 14:56:06,304 INFO L124 PetriNetUnfolderBase]: 17/319 cut-off events. [2023-12-09 14:56:06,304 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-09 14:56:06,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 319 events. 17/319 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 950 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 279. Up to 12 conditions per place. [2023-12-09 14:56:06,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 131 transitions, 302 flow [2023-12-09 14:56:06,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 131 transitions, 302 flow [2023-12-09 14:56:06,309 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:56:06,309 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;@4caa22a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:56:06,309 INFO L363 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-12-09 14:56:06,311 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:56:06,311 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-12-09 14:56:06,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:56:06,311 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:56:06,311 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:56:06,311 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2023-12-09 14:56:06,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:56:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash -358147795, now seen corresponding path program 1 times [2023-12-09 14:56:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:56:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384757790] [2023-12-09 14:56:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:56:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:56:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:56:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:56:06,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:56:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384757790] [2023-12-09 14:56:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384757790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:56:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:56:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:56:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934472340] [2023-12-09 14:56:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:56:06,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:56:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:56:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:56:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:56:06,328 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2023-12-09 14:56:06,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 131 transitions, 302 flow. Second operand has 2 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:06,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:56:06,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2023-12-09 14:56:06,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:56:07,341 INFO L124 PetriNetUnfolderBase]: 3040/9183 cut-off events. [2023-12-09 14:56:07,341 INFO L125 PetriNetUnfolderBase]: For 1559/1559 co-relation queries the response was YES. [2023-12-09 14:56:07,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13989 conditions, 9183 events. 3040/9183 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 97419 event pairs, 3040 based on Foata normal form. 2103/10309 useless extension candidates. Maximal degree in co-relation 9137. Up to 4132 conditions per place. [2023-12-09 14:56:07,452 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 17 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2023-12-09 14:56:07,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 118 transitions, 310 flow [2023-12-09 14:56:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:56:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:56:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 226 transitions. [2023-12-09 14:56:07,453 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8625954198473282 [2023-12-09 14:56:07,453 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 226 transitions. [2023-12-09 14:56:07,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 226 transitions. [2023-12-09 14:56:07,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:56:07,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 226 transitions. [2023-12-09 14:56:07,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:07,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:07,455 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:07,455 INFO L308 CegarLoopForPetriNet]: 135 programPoint places, -5 predicate places. [2023-12-09 14:56:07,455 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 118 transitions, 310 flow [2023-12-09 14:56:07,455 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:07,455 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:56:07,455 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:56:07,455 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-09 14:56:07,456 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2023-12-09 14:56:07,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:56:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -870965919, now seen corresponding path program 1 times [2023-12-09 14:56:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:56:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820076627] [2023-12-09 14:56:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:56:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:56:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:56:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:56:07,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:56:07,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820076627] [2023-12-09 14:56:07,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820076627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:56:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:56:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:56:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808784951] [2023-12-09 14:56:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:56:07,488 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:56:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:56:07,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:56:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:56:07,489 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 131 [2023-12-09 14:56:07,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 118 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:07,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:56:07,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 131 [2023-12-09 14:56:07,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand