/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/11_fmaxsymopt-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:51:39,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:51:39,808 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:51:39,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:51:39,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:51:39,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:51:39,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:51:39,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:51:39,825 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:51:39,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:51:39,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:51:39,826 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:51:39,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:51:39,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:51:39,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:51:39,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:51:39,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:51:39,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:51:39,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:51:39,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:51:39,828 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:51:39,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:51:39,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:51:39,834 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:51:39,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:51:39,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:51:39,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:51:39,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:51:39,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:51:39,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:51:39,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:51:39,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:51:39,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:51:39,837 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:51:39,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:51:40,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:51:40,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:51:40,008 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:51:40,011 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:51:40,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-pthread.i [2023-12-09 14:51:40,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:51:41,221 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:51:41,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-pthread.i [2023-12-09 14:51:41,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90000d670/8f53e4c8ce12437fad5f557124280541/FLAG73f847525 [2023-12-09 14:51:41,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90000d670/8f53e4c8ce12437fad5f557124280541 [2023-12-09 14:51:41,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:51:41,243 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:51:41,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:51:41,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:51:41,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:51:41,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65297cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41, skipping insertion in model container [2023-12-09 14:51:41,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,280 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:51:41,495 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/11_fmaxsymopt-pthread.i[30871,30884] [2023-12-09 14:51:41,506 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:51:41,516 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:51:41,538 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/11_fmaxsymopt-pthread.i[30871,30884] [2023-12-09 14:51:41,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:51:41,567 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:51:41,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41 WrapperNode [2023-12-09 14:51:41,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:51:41,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:51:41,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:51:41,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:51:41,574 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:51:41" (1/1) ... [2023-12-09 14:51:41,584 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:51:41" (1/1) ... [2023-12-09 14:51:41,598 INFO L138 Inliner]: procedures = 165, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2023-12-09 14:51:41,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:51:41,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:51:41,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:51:41,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:51:41,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:51:41,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:51:41,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:51:41,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:51:41,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (1/1) ... [2023-12-09 14:51:41,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:51:41,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:41,651 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:51:41,679 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:51:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 14:51:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-09 14:51:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-09 14:51:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:51:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 14:51:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:51:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:51:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:51:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:51:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 14:51:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:51:41,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:51:41,688 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:51:41,796 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:51:41,798 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:51:41,923 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:51:41,937 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:51:41,938 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 14:51:41,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:51:41 BoogieIcfgContainer [2023-12-09 14:51:41,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:51:41,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:51:41,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:51:41,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:51:41,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:51:41" (1/3) ... [2023-12-09 14:51:41,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb54200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:51:41, skipping insertion in model container [2023-12-09 14:51:41,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:41" (2/3) ... [2023-12-09 14:51:41,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb54200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:51:41, skipping insertion in model container [2023-12-09 14:51:41,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:51:41" (3/3) ... [2023-12-09 14:51:41,944 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-pthread.i [2023-12-09 14:51:41,955 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:51:41,955 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 14:51:41,955 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:51:41,997 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:42,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 106 transitions, 216 flow [2023-12-09 14:51:42,064 INFO L124 PetriNetUnfolderBase]: 11/117 cut-off events. [2023-12-09 14:51:42,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:51:42,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 117 events. 11/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2023-12-09 14:51:42,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 106 transitions, 216 flow [2023-12-09 14:51:42,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 106 transitions, 216 flow [2023-12-09 14:51:42,086 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:42,092 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;@2c05361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:42,093 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 14:51:42,124 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:42,124 INFO L124 PetriNetUnfolderBase]: 4/66 cut-off events. [2023-12-09 14:51:42,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:51:42,125 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:42,125 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, 1, 1, 1, 1, 1] [2023-12-09 14:51:42,126 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:42,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:42,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2019724891, now seen corresponding path program 1 times [2023-12-09 14:51:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147071775] [2023-12-09 14:51:42,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:42,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147071775] [2023-12-09 14:51:42,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147071775] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:42,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:42,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647663932] [2023-12-09 14:51:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:42,354 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:42,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:42,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:42,379 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2023-12-09 14:51:42,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 106 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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:51:42,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:42,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2023-12-09 14:51:42,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:42,443 INFO L124 PetriNetUnfolderBase]: 5/105 cut-off events. [2023-12-09 14:51:42,443 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:51:42,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 105 events. 5/105 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 9/107 useless extension candidates. Maximal degree in co-relation 60. Up to 14 conditions per place. [2023-12-09 14:51:42,444 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 15 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2023-12-09 14:51:42,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 98 transitions, 234 flow [2023-12-09 14:51:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-12-09 14:51:42,458 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8805031446540881 [2023-12-09 14:51:42,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-12-09 14:51:42,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-12-09 14:51:42,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:42,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-12-09 14:51:42,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 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:51:42,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 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:51:42,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 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:51:42,475 INFO L308 CegarLoopForPetriNet]: 99 programPoint places, -5 predicate places. [2023-12-09 14:51:42,475 INFO L500 AbstractCegarLoop]: Abstraction has has 94 places, 98 transitions, 234 flow [2023-12-09 14:51:42,475 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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:51:42,475 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:42,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:42,476 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:51:42,477 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:42,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1877762830, now seen corresponding path program 1 times [2023-12-09 14:51:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:42,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911760055] [2023-12-09 14:51:42,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911760055] [2023-12-09 14:51:42,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911760055] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:42,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636643237] [2023-12-09 14:51:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:42,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:42,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:42,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 14:51:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:42,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:51:42,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636643237] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:42,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:51:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68819947] [2023-12-09 14:51:42,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:42,858 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:51:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:51:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:51:42,860 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2023-12-09 14:51:42,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 98 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 86.2) internal successors, (862), 10 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:51:42,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:42,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2023-12-09 14:51:42,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:42,950 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2023-12-09 14:51:42,951 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-12-09 14:51:42,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 115 events. 5/115 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 94. Up to 19 conditions per place. [2023-12-09 14:51:42,953 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 16 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2023-12-09 14:51:42,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 308 flow [2023-12-09 14:51:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:51:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:51:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 783 transitions. [2023-12-09 14:51:42,955 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8207547169811321 [2023-12-09 14:51:42,955 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 783 transitions. [2023-12-09 14:51:42,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 783 transitions. [2023-12-09 14:51:42,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:42,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 783 transitions. [2023-12-09 14:51:42,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.0) internal successors, (783), 9 states have internal predecessors, (783), 0 states have call successors, (0), 0 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:51:42,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:51:42,962 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:51:42,963 INFO L308 CegarLoopForPetriNet]: 99 programPoint places, 3 predicate places. [2023-12-09 14:51:42,963 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 105 transitions, 308 flow [2023-12-09 14:51:42,963 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.2) internal successors, (862), 10 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:51:42,963 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:42,964 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:42,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 14:51:43,168 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:43,169 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:43,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 27008140, now seen corresponding path program 2 times [2023-12-09 14:51:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447607199] [2023-12-09 14:51:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:43,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447607199] [2023-12-09 14:51:43,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447607199] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15958505] [2023-12-09 14:51:43,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:51:43,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:43,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:43,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:43,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 14:51:43,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:51:43,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:51:43,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:51:43,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:43,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15958505] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:43,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:43,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-12-09 14:51:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226592542] [2023-12-09 14:51:43,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:43,512 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 14:51:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 14:51:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-09 14:51:43,514 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2023-12-09 14:51:43,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 105 transitions, 308 flow. Second operand has 15 states, 15 states have (on average 86.46666666666667) internal successors, (1297), 15 states have internal predecessors, (1297), 0 states have call successors, (0), 0 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:51:43,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:43,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2023-12-09 14:51:43,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:43,646 INFO L124 PetriNetUnfolderBase]: 5/139 cut-off events. [2023-12-09 14:51:43,646 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-12-09 14:51:43,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 139 events. 5/139 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 180. Up to 31 conditions per place. [2023-12-09 14:51:43,647 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 22 selfloop transitions, 18 changer transitions 0/120 dead transitions. [2023-12-09 14:51:43,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 472 flow [2023-12-09 14:51:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 14:51:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 14:51:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1555 transitions. [2023-12-09 14:51:43,650 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8149895178197065 [2023-12-09 14:51:43,650 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1555 transitions. [2023-12-09 14:51:43,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1555 transitions. [2023-12-09 14:51:43,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:43,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1555 transitions. [2023-12-09 14:51:43,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 86.38888888888889) internal successors, (1555), 18 states have internal predecessors, (1555), 0 states have call successors, (0), 0 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:51:43,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 106.0) internal successors, (2014), 19 states have internal predecessors, (2014), 0 states have call successors, (0), 0 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:51:43,656 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 106.0) internal successors, (2014), 19 states have internal predecessors, (2014), 0 states have call successors, (0), 0 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:51:43,657 INFO L308 CegarLoopForPetriNet]: 99 programPoint places, 20 predicate places. [2023-12-09 14:51:43,657 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 472 flow [2023-12-09 14:51:43,658 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 86.46666666666667) internal successors, (1297), 15 states have internal predecessors, (1297), 0 states have call successors, (0), 0 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:51:43,658 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:43,658 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:43,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:43,863 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-09 14:51:43,864 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:43,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1012023923, now seen corresponding path program 3 times [2023-12-09 14:51:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971502093] [2023-12-09 14:51:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:43,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:51:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:43,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:51:43,938 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:51:43,938 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-09 14:51:43,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-09 14:51:43,940 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-09 14:51:43,940 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:51:43,940 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-09 14:51:43,941 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:51:43,942 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 14:51:43,976 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:43,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 161 transitions, 332 flow [2023-12-09 14:51:43,998 INFO L124 PetriNetUnfolderBase]: 19/185 cut-off events. [2023-12-09 14:51:43,998 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:51:44,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 185 events. 19/185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 345 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 121. Up to 6 conditions per place. [2023-12-09 14:51:44,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 161 transitions, 332 flow [2023-12-09 14:51:44,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 161 transitions, 332 flow [2023-12-09 14:51:44,011 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:44,013 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;@2c05361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:44,013 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 14:51:44,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:44,020 INFO L124 PetriNetUnfolderBase]: 6/95 cut-off events. [2023-12-09 14:51:44,020 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:51:44,021 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:44,021 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, 1, 1, 1, 1, 1] [2023-12-09 14:51:44,021 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:44,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash 679383097, now seen corresponding path program 1 times [2023-12-09 14:51:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550408077] [2023-12-09 14:51:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:44,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550408077] [2023-12-09 14:51:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550408077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:44,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342904809] [2023-12-09 14:51:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:44,070 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:44,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:44,072 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 161 [2023-12-09 14:51:44,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 161 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 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:51:44,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:44,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 161 [2023-12-09 14:51:44,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:44,145 INFO L124 PetriNetUnfolderBase]: 45/414 cut-off events. [2023-12-09 14:51:44,146 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-12-09 14:51:44,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 414 events. 45/414 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1641 event pairs, 20 based on Foata normal form. 61/437 useless extension candidates. Maximal degree in co-relation 123. Up to 59 conditions per place. [2023-12-09 14:51:44,148 INFO L140 encePairwiseOnDemand]: 149/161 looper letters, 20 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2023-12-09 14:51:44,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 149 transitions, 352 flow [2023-12-09 14:51:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-12-09 14:51:44,149 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8819875776397516 [2023-12-09 14:51:44,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-12-09 14:51:44,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-12-09 14:51:44,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:44,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-12-09 14:51:44,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:51:44,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 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:51:44,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 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:51:44,153 INFO L308 CegarLoopForPetriNet]: 149 programPoint places, -6 predicate places. [2023-12-09 14:51:44,154 INFO L500 AbstractCegarLoop]: Abstraction has has 143 places, 149 transitions, 352 flow [2023-12-09 14:51:44,155 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 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:51:44,156 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:44,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:44,160 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 14:51:44,160 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:44,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:44,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1965839308, now seen corresponding path program 1 times [2023-12-09 14:51:44,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:44,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184117374] [2023-12-09 14:51:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:44,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:44,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184117374] [2023-12-09 14:51:44,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184117374] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:44,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680064312] [2023-12-09 14:51:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:44,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:44,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:44,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:44,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 14:51:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:44,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:51:44,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680064312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:44,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:51:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654679798] [2023-12-09 14:51:44,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:44,358 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:51:44,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:44,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:51:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:51:44,361 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 161 [2023-12-09 14:51:44,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 149 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 132.3) internal successors, (1323), 10 states have internal predecessors, (1323), 0 states have call successors, (0), 0 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:51:44,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:44,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 161 [2023-12-09 14:51:44,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:44,457 INFO L124 PetriNetUnfolderBase]: 45/424 cut-off events. [2023-12-09 14:51:44,457 INFO L125 PetriNetUnfolderBase]: For 58/60 co-relation queries the response was YES. [2023-12-09 14:51:44,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 424 events. 45/424 cut-off events. For 58/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1636 event pairs, 20 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 163. Up to 64 conditions per place. [2023-12-09 14:51:44,459 INFO L140 encePairwiseOnDemand]: 155/161 looper letters, 21 selfloop transitions, 9 changer transitions 0/156 dead transitions. [2023-12-09 14:51:44,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 436 flow [2023-12-09 14:51:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:51:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:51:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1202 transitions. [2023-12-09 14:51:44,462 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8295376121463078 [2023-12-09 14:51:44,462 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1202 transitions. [2023-12-09 14:51:44,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1202 transitions. [2023-12-09 14:51:44,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:44,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1202 transitions. [2023-12-09 14:51:44,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.55555555555554) internal successors, (1202), 9 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:51:44,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 161.0) internal successors, (1610), 10 states have internal predecessors, (1610), 0 states have call successors, (0), 0 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:51:44,467 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 161.0) internal successors, (1610), 10 states have internal predecessors, (1610), 0 states have call successors, (0), 0 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:51:44,469 INFO L308 CegarLoopForPetriNet]: 149 programPoint places, 2 predicate places. [2023-12-09 14:51:44,469 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 156 transitions, 436 flow [2023-12-09 14:51:44,469 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 132.3) internal successors, (1323), 10 states have internal predecessors, (1323), 0 states have call successors, (0), 0 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:51:44,469 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:44,470 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:44,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:44,673 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:44,674 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:44,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 285544946, now seen corresponding path program 2 times [2023-12-09 14:51:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:44,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155123415] [2023-12-09 14:51:44,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:44,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:44,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155123415] [2023-12-09 14:51:44,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155123415] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:44,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794648965] [2023-12-09 14:51:44,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:51:44,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:44,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:44,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 14:51:44,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:51:44,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:51:44,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:51:44,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794648965] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:44,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:44,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-12-09 14:51:44,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347514917] [2023-12-09 14:51:44,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:44,943 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 14:51:44,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:44,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 14:51:44,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-09 14:51:44,947 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 161 [2023-12-09 14:51:44,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 156 transitions, 436 flow. Second operand has 15 states, 15 states have (on average 132.53333333333333) internal successors, (1988), 15 states have internal predecessors, (1988), 0 states have call successors, (0), 0 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:51:44,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:44,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 161 [2023-12-09 14:51:44,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:45,113 INFO L124 PetriNetUnfolderBase]: 45/448 cut-off events. [2023-12-09 14:51:45,114 INFO L125 PetriNetUnfolderBase]: For 147/151 co-relation queries the response was YES. [2023-12-09 14:51:45,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 448 events. 45/448 cut-off events. For 147/151 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1643 event pairs, 20 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 254. Up to 76 conditions per place. [2023-12-09 14:51:45,117 INFO L140 encePairwiseOnDemand]: 155/161 looper letters, 27 selfloop transitions, 18 changer transitions 0/171 dead transitions. [2023-12-09 14:51:45,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 171 transitions, 610 flow [2023-12-09 14:51:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 14:51:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 14:51:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2388 transitions. [2023-12-09 14:51:45,121 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8240165631469979 [2023-12-09 14:51:45,121 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2388 transitions. [2023-12-09 14:51:45,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2388 transitions. [2023-12-09 14:51:45,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:45,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2388 transitions. [2023-12-09 14:51:45,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 132.66666666666666) internal successors, (2388), 18 states have internal predecessors, (2388), 0 states have call successors, (0), 0 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:51:45,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 161.0) internal successors, (3059), 19 states have internal predecessors, (3059), 0 states have call successors, (0), 0 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:51:45,155 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 161.0) internal successors, (3059), 19 states have internal predecessors, (3059), 0 states have call successors, (0), 0 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:51:45,155 INFO L308 CegarLoopForPetriNet]: 149 programPoint places, 19 predicate places. [2023-12-09 14:51:45,155 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 171 transitions, 610 flow [2023-12-09 14:51:45,156 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 132.53333333333333) internal successors, (1988), 15 states have internal predecessors, (1988), 0 states have call successors, (0), 0 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:51:45,156 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:45,156 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2023-12-09 14:51:45,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-09 14:51:45,361 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:45,362 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:45,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 624965803, now seen corresponding path program 3 times [2023-12-09 14:51:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672620223] [2023-12-09 14:51:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:45,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:51:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:45,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:51:45,394 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:51:45,395 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-09 14:51:45,395 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-09 14:51:45,395 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-12-09 14:51:45,395 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-09 14:51:45,395 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 14:51:45,395 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-09 14:51:45,396 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:51:45,396 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 14:51:45,415 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:45,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 216 transitions, 450 flow [2023-12-09 14:51:45,435 INFO L124 PetriNetUnfolderBase]: 27/253 cut-off events. [2023-12-09 14:51:45,435 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:51:45,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 253 events. 27/253 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 647 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2023-12-09 14:51:45,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 216 transitions, 450 flow [2023-12-09 14:51:45,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 216 transitions, 450 flow [2023-12-09 14:51:45,439 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:45,439 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;@2c05361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:45,439 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:51:45,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:45,446 INFO L124 PetriNetUnfolderBase]: 9/137 cut-off events. [2023-12-09 14:51:45,446 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:51:45,446 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:45,446 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, 1, 1, 1, 1, 1] [2023-12-09 14:51:45,446 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:45,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1615185596, now seen corresponding path program 1 times [2023-12-09 14:51:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829371457] [2023-12-09 14:51:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:45,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829371457] [2023-12-09 14:51:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829371457] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:45,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:45,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099102629] [2023-12-09 14:51:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:45,475 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:45,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:45,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:45,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:45,476 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 216 [2023-12-09 14:51:45,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 216 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:51:45,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:45,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 216 [2023-12-09 14:51:45,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:45,696 INFO L124 PetriNetUnfolderBase]: 345/2059 cut-off events. [2023-12-09 14:51:45,696 INFO L125 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2023-12-09 14:51:45,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 2059 events. 345/2059 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16165 event pairs, 220 based on Foata normal form. 394/2259 useless extension candidates. Maximal degree in co-relation 488. Up to 384 conditions per place. [2023-12-09 14:51:45,707 INFO L140 encePairwiseOnDemand]: 201/216 looper letters, 25 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2023-12-09 14:51:45,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 200 transitions, 472 flow [2023-12-09 14:51:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-12-09 14:51:45,709 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2023-12-09 14:51:45,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-12-09 14:51:45,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-12-09 14:51:45,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:45,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-12-09 14:51:45,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 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:51:45,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 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:51:45,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 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:51:45,711 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -7 predicate places. [2023-12-09 14:51:45,712 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 200 transitions, 472 flow [2023-12-09 14:51:45,712 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:51:45,712 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:45,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:45,712 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 14:51:45,712 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:45,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1751041617, now seen corresponding path program 1 times [2023-12-09 14:51:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001453738] [2023-12-09 14:51:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001453738] [2023-12-09 14:51:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001453738] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360257549] [2023-12-09 14:51:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:45,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:45,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:45,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:45,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 14:51:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:45,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:51:45,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360257549] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:45,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:45,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:51:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102040774] [2023-12-09 14:51:45,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:45,876 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:51:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:51:45,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:51:45,878 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 216 [2023-12-09 14:51:45,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 200 transitions, 472 flow. Second operand has 10 states, 10 states have (on average 178.4) internal successors, (1784), 10 states have internal predecessors, (1784), 0 states have call successors, (0), 0 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:51:45,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:45,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 216 [2023-12-09 14:51:45,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:46,180 INFO L124 PetriNetUnfolderBase]: 345/2069 cut-off events. [2023-12-09 14:51:46,180 INFO L125 PetriNetUnfolderBase]: For 404/420 co-relation queries the response was YES. [2023-12-09 14:51:46,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 2069 events. 345/2069 cut-off events. For 404/420 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16197 event pairs, 220 based on Foata normal form. 0/1875 useless extension candidates. Maximal degree in co-relation 573. Up to 389 conditions per place. [2023-12-09 14:51:46,195 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 26 selfloop transitions, 9 changer transitions 0/207 dead transitions. [2023-12-09 14:51:46,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 207 transitions, 566 flow [2023-12-09 14:51:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:51:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:51:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1621 transitions. [2023-12-09 14:51:46,199 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8338477366255144 [2023-12-09 14:51:46,199 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1621 transitions. [2023-12-09 14:51:46,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1621 transitions. [2023-12-09 14:51:46,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:46,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1621 transitions. [2023-12-09 14:51:46,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 180.11111111111111) internal successors, (1621), 9 states have internal predecessors, (1621), 0 states have call successors, (0), 0 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:51:46,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:46,205 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:46,205 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, 1 predicate places. [2023-12-09 14:51:46,205 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 207 transitions, 566 flow [2023-12-09 14:51:46,206 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 178.4) internal successors, (1784), 10 states have internal predecessors, (1784), 0 states have call successors, (0), 0 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:51:46,206 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:46,206 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:46,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:46,412 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-09 14:51:46,412 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:46,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 774556011, now seen corresponding path program 2 times [2023-12-09 14:51:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143383299] [2023-12-09 14:51:46,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:46,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143383299] [2023-12-09 14:51:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143383299] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961455679] [2023-12-09 14:51:46,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:51:46,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:46,522 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:46,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 14:51:46,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:51:46,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:51:46,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:51:46,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:46,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961455679] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:46,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:46,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-12-09 14:51:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272555160] [2023-12-09 14:51:46,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:46,717 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 14:51:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 14:51:46,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-09 14:51:46,719 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 216 [2023-12-09 14:51:46,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 207 transitions, 566 flow. Second operand has 15 states, 15 states have (on average 178.6) internal successors, (2679), 15 states have internal predecessors, (2679), 0 states have call successors, (0), 0 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:51:46,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:46,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 216 [2023-12-09 14:51:46,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:47,083 INFO L124 PetriNetUnfolderBase]: 345/2093 cut-off events. [2023-12-09 14:51:47,084 INFO L125 PetriNetUnfolderBase]: For 730/762 co-relation queries the response was YES. [2023-12-09 14:51:47,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 2093 events. 345/2093 cut-off events. For 730/762 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16223 event pairs, 220 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 709. Up to 401 conditions per place. [2023-12-09 14:51:47,100 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 32 selfloop transitions, 18 changer transitions 0/222 dead transitions. [2023-12-09 14:51:47,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 222 transitions, 750 flow [2023-12-09 14:51:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 14:51:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 14:51:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3221 transitions. [2023-12-09 14:51:47,105 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8284465020576132 [2023-12-09 14:51:47,105 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3221 transitions. [2023-12-09 14:51:47,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3221 transitions. [2023-12-09 14:51:47,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:47,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3221 transitions. [2023-12-09 14:51:47,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 178.94444444444446) internal successors, (3221), 18 states have internal predecessors, (3221), 0 states have call successors, (0), 0 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:51:47,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 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:51:47,115 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 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:51:47,116 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, 18 predicate places. [2023-12-09 14:51:47,116 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 222 transitions, 750 flow [2023-12-09 14:51:47,126 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 178.6) internal successors, (2679), 15 states have internal predecessors, (2679), 0 states have call successors, (0), 0 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:51:47,126 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:47,126 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2023-12-09 14:51:47,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:47,330 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:47,330 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:47,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1152969582, now seen corresponding path program 3 times [2023-12-09 14:51:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252670045] [2023-12-09 14:51:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:47,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:51:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:47,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:51:47,361 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:51:47,362 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-09 14:51:47,362 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:51:47,362 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-12-09 14:51:47,362 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-09 14:51:47,362 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:51:47,362 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 14:51:47,362 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-09 14:51:47,363 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:51:47,363 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 14:51:47,391 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:47,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 271 transitions, 570 flow [2023-12-09 14:51:47,419 INFO L124 PetriNetUnfolderBase]: 35/321 cut-off events. [2023-12-09 14:51:47,419 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-09 14:51:47,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 321 events. 35/321 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 973 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 261. Up to 10 conditions per place. [2023-12-09 14:51:47,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 271 transitions, 570 flow [2023-12-09 14:51:47,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 271 transitions, 570 flow [2023-12-09 14:51:47,425 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:47,426 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;@2c05361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:47,426 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-09 14:51:47,435 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:47,435 INFO L124 PetriNetUnfolderBase]: 14/174 cut-off events. [2023-12-09 14:51:47,435 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-12-09 14:51:47,435 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:47,435 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:47,435 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:51:47,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1844804595, now seen corresponding path program 1 times [2023-12-09 14:51:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393673323] [2023-12-09 14:51:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:47,474 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:51:47,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:47,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393673323] [2023-12-09 14:51:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393673323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:47,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:47,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:47,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546981722] [2023-12-09 14:51:47,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:47,475 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:47,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:47,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:47,476 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 271 [2023-12-09 14:51:47,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 271 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 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:51:47,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:47,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 271 [2023-12-09 14:51:47,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:48,879 INFO L124 PetriNetUnfolderBase]: 2345/10784 cut-off events. [2023-12-09 14:51:48,879 INFO L125 PetriNetUnfolderBase]: For 2166/2166 co-relation queries the response was YES. [2023-12-09 14:51:48,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14044 conditions, 10784 events. 2345/10784 cut-off events. For 2166/2166 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 120873 event pairs, 1720 based on Foata normal form. 2433/12243 useless extension candidates. Maximal degree in co-relation 2541. Up to 2509 conditions per place. [2023-12-09 14:51:48,994 INFO L140 encePairwiseOnDemand]: 253/271 looper letters, 30 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2023-12-09 14:51:48,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 251 transitions, 594 flow [2023-12-09 14:51:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2023-12-09 14:51:48,996 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8831488314883149 [2023-12-09 14:51:48,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 718 transitions. [2023-12-09 14:51:48,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 718 transitions. [2023-12-09 14:51:48,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:48,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 718 transitions. [2023-12-09 14:51:48,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 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:51:48,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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:51:48,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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:51:49,000 INFO L308 CegarLoopForPetriNet]: 249 programPoint places, -8 predicate places. [2023-12-09 14:51:49,000 INFO L500 AbstractCegarLoop]: Abstraction has has 241 places, 251 transitions, 594 flow [2023-12-09 14:51:49,000 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 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:51:49,000 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:49,001 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:49,001 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 14:51:49,001 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:51:49,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash -552723942, now seen corresponding path program 1 times [2023-12-09 14:51:49,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:49,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648697644] [2023-12-09 14:51:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:49,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:51:49,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648697644] [2023-12-09 14:51:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648697644] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937624288] [2023-12-09 14:51:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:49,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:49,050 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:49,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 14:51:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:49,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-09 14:51:49,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 14:51:49,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 14:51:49,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937624288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:49,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 14:51:49,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-09 14:51:49,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438198833] [2023-12-09 14:51:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:49,151 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:49,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 14:51:49,152 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 271 [2023-12-09 14:51:49,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 251 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 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:51:49,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:49,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 271 [2023-12-09 14:51:49,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:53,005 INFO L124 PetriNetUnfolderBase]: 10853/28383 cut-off events. [2023-12-09 14:51:53,006 INFO L125 PetriNetUnfolderBase]: For 15785/20533 co-relation queries the response was YES. [2023-12-09 14:51:53,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56628 conditions, 28383 events. 10853/28383 cut-off events. For 15785/20533 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 329840 event pairs, 5470 based on Foata normal form. 0/25399 useless extension candidates. Maximal degree in co-relation 8258. Up to 10633 conditions per place. [2023-12-09 14:51:53,381 INFO L140 encePairwiseOnDemand]: 266/271 looper letters, 56 selfloop transitions, 4 changer transitions 0/276 dead transitions. [2023-12-09 14:51:53,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 276 transitions, 823 flow [2023-12-09 14:51:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2023-12-09 14:51:53,383 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8757687576875769 [2023-12-09 14:51:53,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 712 transitions. [2023-12-09 14:51:53,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 712 transitions. [2023-12-09 14:51:53,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:53,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 712 transitions. [2023-12-09 14:51:53,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 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:51:53,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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:51:53,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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:51:53,386 INFO L308 CegarLoopForPetriNet]: 249 programPoint places, -6 predicate places. [2023-12-09 14:51:53,386 INFO L500 AbstractCegarLoop]: Abstraction has has 243 places, 276 transitions, 823 flow [2023-12-09 14:51:53,386 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 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:51:53,386 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:53,386 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:53,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 14:51:53,593 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:53,593 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:51:53,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:53,594 INFO L85 PathProgramCache]: Analyzing trace with hash 377569438, now seen corresponding path program 1 times [2023-12-09 14:51:53,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:53,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330320945] [2023-12-09 14:51:53,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:53,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330320945] [2023-12-09 14:51:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330320945] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134993105] [2023-12-09 14:51:53,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:53,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:53,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:53,641 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:53,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-09 14:51:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:53,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:51:53,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:53,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134993105] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:53,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:53,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:51:53,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079190793] [2023-12-09 14:51:53,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:53,776 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:51:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:53,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:51:53,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:51:53,778 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 271 [2023-12-09 14:51:53,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 276 transitions, 823 flow. Second operand has 10 states, 10 states have (on average 224.5) internal successors, (2245), 10 states have internal predecessors, (2245), 0 states have call successors, (0), 0 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:51:53,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:53,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 271 [2023-12-09 14:51:53,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:57,702 INFO L124 PetriNetUnfolderBase]: 10853/28393 cut-off events. [2023-12-09 14:51:57,702 INFO L125 PetriNetUnfolderBase]: For 29657/39153 co-relation queries the response was YES. [2023-12-09 14:51:57,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67288 conditions, 28393 events. 10853/28393 cut-off events. For 29657/39153 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 330109 event pairs, 5470 based on Foata normal form. 0/25409 useless extension candidates. Maximal degree in co-relation 9670. Up to 10638 conditions per place. [2023-12-09 14:51:58,165 INFO L140 encePairwiseOnDemand]: 265/271 looper letters, 50 selfloop transitions, 9 changer transitions 0/283 dead transitions. [2023-12-09 14:51:58,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 283 transitions, 965 flow [2023-12-09 14:51:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:51:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:51:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2040 transitions. [2023-12-09 14:51:58,170 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8364083640836408 [2023-12-09 14:51:58,170 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2040 transitions. [2023-12-09 14:51:58,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2040 transitions. [2023-12-09 14:51:58,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:58,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2040 transitions. [2023-12-09 14:51:58,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 226.66666666666666) internal successors, (2040), 9 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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:51:58,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 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:51:58,177 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 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:51:58,178 INFO L308 CegarLoopForPetriNet]: 249 programPoint places, 2 predicate places. [2023-12-09 14:51:58,178 INFO L500 AbstractCegarLoop]: Abstraction has has 251 places, 283 transitions, 965 flow [2023-12-09 14:51:58,179 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 224.5) internal successors, (2245), 10 states have internal predecessors, (2245), 0 states have call successors, (0), 0 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:51:58,179 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:58,179 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:58,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-09 14:51:58,383 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-09 14:51:58,383 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:51:58,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1048978108, now seen corresponding path program 2 times [2023-12-09 14:51:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185474236] [2023-12-09 14:51:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185474236] [2023-12-09 14:51:58,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185474236] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259828968] [2023-12-09 14:51:58,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:51:58,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:58,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:58,474 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:58,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-09 14:51:58,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:51:58,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:51:58,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:51:58,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:58,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:58,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259828968] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:58,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:58,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-12-09 14:51:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363021753] [2023-12-09 14:51:58,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:58,681 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 14:51:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:58,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 14:51:58,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-09 14:51:58,684 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 271 [2023-12-09 14:51:58,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 283 transitions, 965 flow. Second operand has 15 states, 15 states have (on average 224.66666666666666) internal successors, (3370), 15 states have internal predecessors, (3370), 0 states have call successors, (0), 0 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:51:58,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:58,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 271 [2023-12-09 14:51:58,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:03,011 INFO L124 PetriNetUnfolderBase]: 10853/28417 cut-off events. [2023-12-09 14:52:03,011 INFO L125 PetriNetUnfolderBase]: For 49687/62927 co-relation queries the response was YES. [2023-12-09 14:52:03,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77999 conditions, 28417 events. 10853/28417 cut-off events. For 49687/62927 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 329698 event pairs, 5470 based on Foata normal form. 0/25433 useless extension candidates. Maximal degree in co-relation 11255. Up to 10650 conditions per place. [2023-12-09 14:52:03,418 INFO L140 encePairwiseOnDemand]: 265/271 looper letters, 56 selfloop transitions, 18 changer transitions 0/298 dead transitions. [2023-12-09 14:52:03,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 298 transitions, 1197 flow [2023-12-09 14:52:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 14:52:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 14:52:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4054 transitions. [2023-12-09 14:52:03,422 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8310783107831078 [2023-12-09 14:52:03,422 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4054 transitions. [2023-12-09 14:52:03,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4054 transitions. [2023-12-09 14:52:03,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:03,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4054 transitions. [2023-12-09 14:52:03,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 225.22222222222223) internal successors, (4054), 18 states have internal predecessors, (4054), 0 states have call successors, (0), 0 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:52:03,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 271.0) internal successors, (5149), 19 states have internal predecessors, (5149), 0 states have call successors, (0), 0 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:52:03,431 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 271.0) internal successors, (5149), 19 states have internal predecessors, (5149), 0 states have call successors, (0), 0 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:52:03,431 INFO L308 CegarLoopForPetriNet]: 249 programPoint places, 19 predicate places. [2023-12-09 14:52:03,432 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 298 transitions, 1197 flow [2023-12-09 14:52:03,432 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 224.66666666666666) internal successors, (3370), 15 states have internal predecessors, (3370), 0 states have call successors, (0), 0 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:52:03,432 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:03,432 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:52:03,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-09 14:52:03,636 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-09 14:52:03,637 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:52:03,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2000916035, now seen corresponding path program 3 times [2023-12-09 14:52:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:03,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141996666] [2023-12-09 14:52:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:03,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:52:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:03,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:52:03,682 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:52:03,682 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-09 14:52:03,682 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-09 14:52:03,682 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-12-09 14:52:03,682 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-09 14:52:03,683 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-09 14:52:03,683 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-09 14:52:03,683 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-09 14:52:03,683 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-12-09 14:52:03,683 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:52:03,683 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-09 14:52:03,710 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:52:03,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 326 transitions, 692 flow [2023-12-09 14:52:03,747 INFO L124 PetriNetUnfolderBase]: 43/389 cut-off events. [2023-12-09 14:52:03,747 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-09 14:52:03,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 389 events. 43/389 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1280 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 334. Up to 12 conditions per place. [2023-12-09 14:52:03,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 326 transitions, 692 flow [2023-12-09 14:52:03,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 326 transitions, 692 flow [2023-12-09 14:52:03,753 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:52:03,753 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;@2c05361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:52:03,753 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-09 14:52:03,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:52:03,762 INFO L124 PetriNetUnfolderBase]: 13/169 cut-off events. [2023-12-09 14:52:03,762 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-12-09 14:52:03,762 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:03,762 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:52:03,762 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:52:03,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:03,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2046731487, now seen corresponding path program 1 times [2023-12-09 14:52:03,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:03,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292854002] [2023-12-09 14:52:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:03,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:03,782 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:52:03,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292854002] [2023-12-09 14:52:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292854002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:03,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:03,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212757507] [2023-12-09 14:52:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:03,783 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:03,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:03,784 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 326 [2023-12-09 14:52:03,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 326 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 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:52:03,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:03,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 326 [2023-12-09 14:52:03,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:12,165 INFO L124 PetriNetUnfolderBase]: 14845/56909 cut-off events. [2023-12-09 14:52:12,165 INFO L125 PetriNetUnfolderBase]: For 17041/17041 co-relation queries the response was YES. [2023-12-09 14:52:12,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77045 conditions, 56909 events. 14845/56909 cut-off events. For 17041/17041 co-relation queries the response was YES. Maximal size of possible extension queue 1412. Compared 805576 event pairs, 11720 based on Foata normal form. 14503/66538 useless extension candidates. Maximal degree in co-relation 14141. Up to 15634 conditions per place. [2023-12-09 14:52:13,299 INFO L140 encePairwiseOnDemand]: 305/326 looper letters, 35 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2023-12-09 14:52:13,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 302 transitions, 718 flow [2023-12-09 14:52:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:52:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:52:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2023-12-09 14:52:13,301 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8834355828220859 [2023-12-09 14:52:13,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 864 transitions. [2023-12-09 14:52:13,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 864 transitions. [2023-12-09 14:52:13,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:13,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 864 transitions. [2023-12-09 14:52:13,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 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:52:13,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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:52:13,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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:52:13,303 INFO L308 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2023-12-09 14:52:13,303 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 302 transitions, 718 flow [2023-12-09 14:52:13,304 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 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:52:13,304 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:13,304 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:52:13,304 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-09 14:52:13,304 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:52:13,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1330689070, now seen corresponding path program 1 times [2023-12-09 14:52:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:13,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68633107] [2023-12-09 14:52:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:13,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:52:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:13,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68633107] [2023-12-09 14:52:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68633107] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:52:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117005225] [2023-12-09 14:52:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:13,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:52:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:52:13,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:52:13,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-09 14:52:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:13,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-09 14:52:13,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:52:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 14:52:13,480 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 14:52:13,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117005225] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:13,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 14:52:13,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-09 14:52:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336529141] [2023-12-09 14:52:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:13,481 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:13,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:13,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 14:52:13,482 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 326 [2023-12-09 14:52:13,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 302 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 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:52:13,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:13,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 326 [2023-12-09 14:52:13,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand