/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/35_double_lock_p3_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:54:43,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:54:44,063 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:54:44,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:54:44,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:54:44,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:54:44,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:54:44,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:54:44,096 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:54:44,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:54:44,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:54:44,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:54:44,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:54:44,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:54:44,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:54:44,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:54:44,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:54:44,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:54:44,102 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:54:44,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:54:44,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:54:44,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:54:44,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:54:44,103 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:54:44,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:54:44,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:54:44,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:54:44,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:54:44,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:54:44,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:54:44,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:54:44,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:54:44,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:54:44,104 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:54:44,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:54:44,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:54:44,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:54:44,307 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:54:44,308 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:54:44,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs-pthread.i [2023-12-09 14:54:45,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:54:45,536 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:54:45,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs-pthread.i [2023-12-09 14:54:45,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eddfb889/beaa9df9525f432bbfef8cce233aa1ae/FLAGbd511a97b [2023-12-09 14:54:45,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eddfb889/beaa9df9525f432bbfef8cce233aa1ae [2023-12-09 14:54:45,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:54:45,559 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:54:45,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:54:45,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:54:45,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:54:45,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cdebb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45, skipping insertion in model container [2023-12-09 14:54:45,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,599 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:54:45,802 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/35_double_lock_p3_vs-pthread.i[30711,30724] [2023-12-09 14:54:45,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:54:45,820 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:54:45,853 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/35_double_lock_p3_vs-pthread.i[30711,30724] [2023-12-09 14:54:45,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:54:45,879 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:54:45,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45 WrapperNode [2023-12-09 14:54:45,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:54:45,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:54:45,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:54:45,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:54:45,885 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:54:45" (1/1) ... [2023-12-09 14:54:45,894 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:54:45" (1/1) ... [2023-12-09 14:54:45,924 INFO L138 Inliner]: procedures = 165, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2023-12-09 14:54:45,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:54:45,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:54:45,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:54:45,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:54:45,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:54:45,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:54:45,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:54:45,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:54:45,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (1/1) ... [2023-12-09 14:54:45,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:54:45,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:54:45,981 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:54:46,001 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:54:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-12-09 14:54:46,018 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-12-09 14:54:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-09 14:54:46,018 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-09 14:54:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:54:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 14:54:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:54:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:54:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:54:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:54:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 14:54:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:54:46,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:54:46,020 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:54:46,120 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:54:46,122 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:54:46,246 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:54:46,268 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:54:46,268 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-09 14:54:46,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:54:46 BoogieIcfgContainer [2023-12-09 14:54:46,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:54:46,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:54:46,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:54:46,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:54:46,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:54:45" (1/3) ... [2023-12-09 14:54:46,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1840f5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:54:46, skipping insertion in model container [2023-12-09 14:54:46,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:54:45" (2/3) ... [2023-12-09 14:54:46,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1840f5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:54:46, skipping insertion in model container [2023-12-09 14:54:46,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:54:46" (3/3) ... [2023-12-09 14:54:46,275 INFO L112 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs-pthread.i [2023-12-09 14:54:46,287 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:54:46,287 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 14:54:46,287 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:54:46,366 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:54:46,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 178 flow [2023-12-09 14:54:46,419 INFO L124 PetriNetUnfolderBase]: 6/95 cut-off events. [2023-12-09 14:54:46,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:54:46,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 6/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 76. Up to 4 conditions per place. [2023-12-09 14:54:46,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 178 flow [2023-12-09 14:54:46,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 84 transitions, 175 flow [2023-12-09 14:54:46,439 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:54:46,444 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;@2dab52d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:54:46,444 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 14:54:46,454 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:54:46,454 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2023-12-09 14:54:46,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:54:46,454 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:46,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] [2023-12-09 14:54:46,455 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 14:54:46,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1705451443, now seen corresponding path program 1 times [2023-12-09 14:54:46,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818232608] [2023-12-09 14:54:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:46,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:54:46,717 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:54:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:54:46,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818232608] [2023-12-09 14:54:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818232608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:54:46,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:54:46,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:54:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229957124] [2023-12-09 14:54:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:54:46,725 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:54:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:54:46,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:54:46,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:54:46,748 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 85 [2023-12-09 14:54:46,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 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:54:46,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:54:46,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 85 [2023-12-09 14:54:46,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:54:46,839 INFO L124 PetriNetUnfolderBase]: 62/236 cut-off events. [2023-12-09 14:54:46,839 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-12-09 14:54:46,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 236 events. 62/236 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 747 event pairs, 18 based on Foata normal form. 103/322 useless extension candidates. Maximal degree in co-relation 349. Up to 100 conditions per place. [2023-12-09 14:54:46,842 INFO L140 encePairwiseOnDemand]: 77/85 looper letters, 20 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-12-09 14:54:46,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 199 flow [2023-12-09 14:54:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:54:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:54:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2023-12-09 14:54:46,853 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8313725490196079 [2023-12-09 14:54:46,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 212 transitions. [2023-12-09 14:54:46,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 212 transitions. [2023-12-09 14:54:46,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:54:46,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 212 transitions. [2023-12-09 14:54:46,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:54:46,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:54:46,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:54:46,864 INFO L308 CegarLoopForPetriNet]: 85 programPoint places, -8 predicate places. [2023-12-09 14:54:46,864 INFO L500 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 199 flow [2023-12-09 14:54:46,865 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 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:54:46,865 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:46,865 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:54:46,865 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:54:46,865 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 14:54:46,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:46,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1899453625, now seen corresponding path program 1 times [2023-12-09 14:54:46,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:46,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831512294] [2023-12-09 14:54:46,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:46,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:54:46,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:54:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:54:46,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:54:46,925 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:54:46,926 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-09 14:54:46,927 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-09 14:54:46,927 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 14:54:46,927 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-09 14:54:46,928 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 14:54:46,928 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 14:54:46,930 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:54:46,930 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 14:54:46,960 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:54:46,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 133 transitions, 286 flow [2023-12-09 14:54:46,987 INFO L124 PetriNetUnfolderBase]: 8/140 cut-off events. [2023-12-09 14:54:46,987 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:54:46,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 140 events. 8/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 147. Up to 6 conditions per place. [2023-12-09 14:54:46,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 133 transitions, 286 flow [2023-12-09 14:54:46,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 116 transitions, 245 flow [2023-12-09 14:54:46,997 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:54:46,998 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;@2dab52d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:54:46,998 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:54:47,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:54:47,003 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-12-09 14:54:47,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:54:47,003 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:47,003 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:54:47,003 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:54:47,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash -577715903, now seen corresponding path program 1 times [2023-12-09 14:54:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:47,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815535406] [2023-12-09 14:54:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:47,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:54:47,067 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:54:47,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:54:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815535406] [2023-12-09 14:54:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815535406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:54:47,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:54:47,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:54:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441117184] [2023-12-09 14:54:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:54:47,068 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:54:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:54:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:54:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:54:47,070 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 133 [2023-12-09 14:54:47,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:54:47,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:54:47,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 133 [2023-12-09 14:54:47,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:54:47,531 INFO L124 PetriNetUnfolderBase]: 1666/3523 cut-off events. [2023-12-09 14:54:47,531 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2023-12-09 14:54:47,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6292 conditions, 3523 events. 1666/3523 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 24976 event pairs, 673 based on Foata normal form. 1437/4776 useless extension candidates. Maximal degree in co-relation 6262. Up to 2444 conditions per place. [2023-12-09 14:54:47,561 INFO L140 encePairwiseOnDemand]: 124/133 looper letters, 39 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2023-12-09 14:54:47,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 113 transitions, 328 flow [2023-12-09 14:54:47,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:54:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:54:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-12-09 14:54:47,566 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7769423558897243 [2023-12-09 14:54:47,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-12-09 14:54:47,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-12-09 14:54:47,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:54:47,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-12-09 14:54:47,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 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:54:47,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:54:47,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:54:47,578 INFO L308 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2023-12-09 14:54:47,578 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 113 transitions, 328 flow [2023-12-09 14:54:47,578 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:54:47,578 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:47,579 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-12-09 14:54:47,579 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 14:54:47,579 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:54:47,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash 978299812, now seen corresponding path program 1 times [2023-12-09 14:54:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815836484] [2023-12-09 14:54:47,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:54:47,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:54:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:54:47,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:54:47,634 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:54:47,634 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-09 14:54:47,634 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:54:47,635 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-12-09 14:54:47,635 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-09 14:54:47,635 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:54:47,635 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:54:47,635 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 14:54:47,638 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:54:47,638 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 14:54:47,685 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:54:47,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 181 transitions, 398 flow [2023-12-09 14:54:47,707 INFO L124 PetriNetUnfolderBase]: 10/185 cut-off events. [2023-12-09 14:54:47,707 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:54:47,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 185 events. 10/185 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 448 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 196. Up to 8 conditions per place. [2023-12-09 14:54:47,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 181 transitions, 398 flow [2023-12-09 14:54:47,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 148 transitions, 317 flow [2023-12-09 14:54:47,711 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:54:47,713 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;@2dab52d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:54:47,714 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-09 14:54:47,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:54:47,717 INFO L124 PetriNetUnfolderBase]: 3/44 cut-off events. [2023-12-09 14:54:47,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:54:47,717 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:47,717 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:54:47,720 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:54:47,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1131793915, now seen corresponding path program 1 times [2023-12-09 14:54:47,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433040017] [2023-12-09 14:54:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:47,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:54:47,787 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:54:47,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:54:47,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433040017] [2023-12-09 14:54:47,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433040017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:54:47,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:54:47,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:54:47,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127782623] [2023-12-09 14:54:47,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:54:47,788 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:54:47,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:54:47,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:54:47,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:54:47,792 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 181 [2023-12-09 14:54:47,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 148 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:54:47,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:54:47,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 181 [2023-12-09 14:54:47,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:54:53,025 INFO L124 PetriNetUnfolderBase]: 32841/56616 cut-off events. [2023-12-09 14:54:53,026 INFO L125 PetriNetUnfolderBase]: For 5210/5210 co-relation queries the response was YES. [2023-12-09 14:54:53,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104863 conditions, 56616 events. 32841/56616 cut-off events. For 5210/5210 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 521715 event pairs, 16591 based on Foata normal form. 18959/73215 useless extension candidates. Maximal degree in co-relation 104832. Up to 44217 conditions per place. [2023-12-09 14:54:53,521 INFO L140 encePairwiseOnDemand]: 171/181 looper letters, 55 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2023-12-09 14:54:53,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 149 transitions, 449 flow [2023-12-09 14:54:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:54:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:54:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-12-09 14:54:53,523 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7458563535911602 [2023-12-09 14:54:53,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-12-09 14:54:53,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-12-09 14:54:53,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:54:53,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-12-09 14:54:53,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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:54:53,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:54:53,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:54:53,527 INFO L308 CegarLoopForPetriNet]: 151 programPoint places, -8 predicate places. [2023-12-09 14:54:53,527 INFO L500 AbstractCegarLoop]: Abstraction has has 143 places, 149 transitions, 449 flow [2023-12-09 14:54:53,528 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:54:53,528 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:53,528 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:54:53,528 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 14:54:53,529 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:54:53,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 194492299, now seen corresponding path program 1 times [2023-12-09 14:54:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060474594] [2023-12-09 14:54:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:54:53,642 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:54:53,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:54:53,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060474594] [2023-12-09 14:54:53,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060474594] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:54:53,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:54:53,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:54:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759601259] [2023-12-09 14:54:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:54:53,643 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:54:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:54:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:54:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:54:53,644 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 181 [2023-12-09 14:54:53,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 149 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 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:54:53,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:54:53,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 181 [2023-12-09 14:54:53,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:54:53,975 INFO L124 PetriNetUnfolderBase]: 339/1962 cut-off events. [2023-12-09 14:54:53,975 INFO L125 PetriNetUnfolderBase]: For 3137/3180 co-relation queries the response was YES. [2023-12-09 14:54:53,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 1962 events. 339/1962 cut-off events. For 3137/3180 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 15935 event pairs, 43 based on Foata normal form. 1675/3590 useless extension candidates. Maximal degree in co-relation 4513. Up to 1151 conditions per place. [2023-12-09 14:54:53,987 INFO L140 encePairwiseOnDemand]: 167/181 looper letters, 17 selfloop transitions, 19 changer transitions 0/154 dead transitions. [2023-12-09 14:54:53,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 154 transitions, 568 flow [2023-12-09 14:54:53,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:54:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:54:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-12-09 14:54:53,989 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8195211786372008 [2023-12-09 14:54:53,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-12-09 14:54:53,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-12-09 14:54:53,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:54:53,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-12-09 14:54:53,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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:54:53,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:54:53,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:54:53,996 INFO L308 CegarLoopForPetriNet]: 151 programPoint places, -6 predicate places. [2023-12-09 14:54:53,996 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 154 transitions, 568 flow [2023-12-09 14:54:53,997 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 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:54:53,997 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:53,997 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:54:53,997 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 14:54:53,998 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:54:53,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash 663171455, now seen corresponding path program 1 times [2023-12-09 14:54:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925184061] [2023-12-09 14:54:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:54:54,106 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:54:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:54:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925184061] [2023-12-09 14:54:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925184061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:54:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:54:54,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 14:54:54,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433031124] [2023-12-09 14:54:54,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:54:54,108 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 14:54:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:54:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 14:54:54,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-09 14:54:54,113 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 181 [2023-12-09 14:54:54,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 154 transitions, 568 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 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:54:54,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:54:54,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 181 [2023-12-09 14:54:54,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:54:54,589 INFO L124 PetriNetUnfolderBase]: 894/3224 cut-off events. [2023-12-09 14:54:54,589 INFO L125 PetriNetUnfolderBase]: For 3839/3934 co-relation queries the response was YES. [2023-12-09 14:54:54,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9231 conditions, 3224 events. 894/3224 cut-off events. For 3839/3934 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 27979 event pairs, 255 based on Foata normal form. 0/3154 useless extension candidates. Maximal degree in co-relation 9189. Up to 1990 conditions per place. [2023-12-09 14:54:54,614 INFO L140 encePairwiseOnDemand]: 170/181 looper letters, 88 selfloop transitions, 12 changer transitions 0/186 dead transitions. [2023-12-09 14:54:54,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 186 transitions, 1014 flow [2023-12-09 14:54:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:54:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:54:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1066 transitions. [2023-12-09 14:54:54,616 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6543891958256599 [2023-12-09 14:54:54,616 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1066 transitions. [2023-12-09 14:54:54,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1066 transitions. [2023-12-09 14:54:54,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:54:54,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1066 transitions. [2023-12-09 14:54:54,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 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:54:54,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 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:54:54,622 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 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:54:54,622 INFO L308 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2023-12-09 14:54:54,622 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 186 transitions, 1014 flow [2023-12-09 14:54:54,623 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 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:54:54,623 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:54,623 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-12-09 14:54:54,623 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 14:54:54,623 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:54:54,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1191226878, now seen corresponding path program 1 times [2023-12-09 14:54:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214830286] [2023-12-09 14:54:54,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:54:54,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:54:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:54:54,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:54:54,645 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:54:54,645 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-09 14:54:54,645 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-09 14:54:54,645 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-12-09 14:54:54,645 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-09 14:54:54,645 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-09 14:54:54,646 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-09 14:54:54,646 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 14:54:54,646 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-09 14:54:54,646 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:54:54,646 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 14:54:54,679 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:54:54,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 229 transitions, 514 flow [2023-12-09 14:54:54,700 INFO L124 PetriNetUnfolderBase]: 12/230 cut-off events. [2023-12-09 14:54:54,701 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-09 14:54:54,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 230 events. 12/230 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 639 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 246. Up to 10 conditions per place. [2023-12-09 14:54:54,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 229 transitions, 514 flow [2023-12-09 14:54:54,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 180 transitions, 391 flow [2023-12-09 14:54:54,706 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:54:54,706 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;@2dab52d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:54:54,706 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-09 14:54:54,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:54:54,777 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-12-09 14:54:54,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:54:54,777 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:54:54,777 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:54:54,778 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-09 14:54:54,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:54:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash 927281817, now seen corresponding path program 1 times [2023-12-09 14:54:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:54:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137060352] [2023-12-09 14:54:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:54:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:54:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:54:54,802 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:54:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:54:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137060352] [2023-12-09 14:54:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137060352] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:54:54,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:54:54,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:54:54,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940319129] [2023-12-09 14:54:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:54:54,803 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:54:54,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:54:54,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:54:54,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:54:54,803 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 229 [2023-12-09 14:54:54,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 180 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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:54:54,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:54:54,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 229 [2023-12-09 14:54:54,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand