/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:56:07,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:56:08,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:56:08,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:56:08,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:56:08,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:56:08,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:56:08,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:56:08,073 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:56:08,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:56:08,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:56:08,073 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:56:08,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:56:08,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:56:08,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:56:08,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:56:08,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:56:08,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:56:08,075 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:56:08,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:56:08,075 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:56:08,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:56:08,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:56:08,076 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:56:08,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:56:08,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:56:08,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:56:08,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:56:08,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:56:08,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:56:08,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:56:08,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:56:08,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:56:08,078 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 [2023-11-10 11:56:08,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:56:08,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:56:08,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:56:08,317 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:56:08,317 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:56:08,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i [2023-11-10 11:56:09,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:56:09,680 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:56:09,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i [2023-11-10 11:56:09,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be305dc8/6344f98d454745dca51340db60adb997/FLAG6b53ce50d [2023-11-10 11:56:09,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be305dc8/6344f98d454745dca51340db60adb997 [2023-11-10 11:56:09,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:56:09,724 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:56:09,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:56:09,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:56:09,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:56:09,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:56:09" (1/1) ... [2023-11-10 11:56:09,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae897d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:09, skipping insertion in model container [2023-11-10 11:56:09,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:56:09" (1/1) ... [2023-11-10 11:56:09,773 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:56:10,127 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i[41322,41335] [2023-11-10 11:56:10,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:56:10,165 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:56:10,193 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i[41322,41335] [2023-11-10 11:56:10,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:56:10,246 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:56:10,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10 WrapperNode [2023-11-10 11:56:10,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:56:10,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:56:10,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:56:10,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:56:10,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,294 INFO L138 Inliner]: procedures = 270, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2023-11-10 11:56:10,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:56:10,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:56:10,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:56:10,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:56:10,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:56:10,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:56:10,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:56:10,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:56:10,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (1/1) ... [2023-11-10 11:56:10,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:56:10,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:10,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:56:10,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:56:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:56:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:56:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 11:56:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:56:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-10 11:56:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:56:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-10 11:56:10,389 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-10 11:56:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:56:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:56:10,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:56:10,390 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:56:10,583 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:56:10,585 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:56:10,780 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:56:10,787 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:56:10,787 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-10 11:56:10,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:56:10 BoogieIcfgContainer [2023-11-10 11:56:10,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:56:10,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:56:10,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:56:10,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:56:10,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:56:09" (1/3) ... [2023-11-10 11:56:10,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@deb590a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:56:10, skipping insertion in model container [2023-11-10 11:56:10,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:10" (2/3) ... [2023-11-10 11:56:10,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@deb590a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:56:10, skipping insertion in model container [2023-11-10 11:56:10,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:56:10" (3/3) ... [2023-11-10 11:56:10,796 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2023-11-10 11:56:10,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:56:10,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 11:56:10,810 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:56:10,850 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-10 11:56:10,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 126 transitions, 259 flow [2023-11-10 11:56:10,933 INFO L124 PetriNetUnfolderBase]: 23/173 cut-off events. [2023-11-10 11:56:10,934 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-10 11:56:10,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 173 events. 23/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 397 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 86. Up to 6 conditions per place. [2023-11-10 11:56:10,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 126 transitions, 259 flow [2023-11-10 11:56:10,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 121 transitions, 246 flow [2023-11-10 11:56:10,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:56:10,967 INFO L357 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=false, 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;@6c92dcf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:56:10,970 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:56:10,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:56:10,998 INFO L124 PetriNetUnfolderBase]: 8/105 cut-off events. [2023-11-10 11:56:10,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:56:10,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:10,998 INFO L208 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] [2023-11-10 11:56:10,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:11,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1138231718, now seen corresponding path program 1 times [2023-11-10 11:56:11,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:11,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932575887] [2023-11-10 11:56:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:11,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:11,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:11,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932575887] [2023-11-10 11:56:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932575887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:11,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:11,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:56:11,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871471191] [2023-11-10 11:56:11,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:11,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:11,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:11,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:11,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:56:11,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 126 [2023-11-10 11:56:11,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 121 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:11,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 126 [2023-11-10 11:56:11,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:11,349 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-11-10 11:56:11,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:56:11,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 30/137 useless extension candidates. Maximal degree in co-relation 75. Up to 8 conditions per place. [2023-11-10 11:56:11,351 INFO L140 encePairwiseOnDemand]: 112/126 looper letters, 9 selfloop transitions, 2 changer transitions 21/111 dead transitions. [2023-11-10 11:56:11,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 250 flow [2023-11-10 11:56:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-11-10 11:56:11,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8994708994708994 [2023-11-10 11:56:11,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-11-10 11:56:11,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-11-10 11:56:11,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:11,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-11-10 11:56:11,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,384 INFO L175 Difference]: Start difference. First operand has 110 places, 121 transitions, 246 flow. Second operand 3 states and 340 transitions. [2023-11-10 11:56:11,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 250 flow [2023-11-10 11:56:11,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 111 transitions, 250 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:56:11,392 INFO L231 Difference]: Finished difference. Result has 112 places, 88 transitions, 188 flow [2023-11-10 11:56:11,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=88} [2023-11-10 11:56:11,398 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2023-11-10 11:56:11,399 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 188 flow [2023-11-10 11:56:11,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:11,400 INFO L208 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, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:11,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:56:11,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:11,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1784073854, now seen corresponding path program 1 times [2023-11-10 11:56:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154933281] [2023-11-10 11:56:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:11,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:56:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:11,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:56:11,494 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:56:11,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:56:11,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:56:11,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:56:11,497 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-10 11:56:11,500 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:56:11,500 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-10 11:56:11,534 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 11:56:11,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 156 transitions, 328 flow [2023-11-10 11:56:11,590 INFO L124 PetriNetUnfolderBase]: 40/276 cut-off events. [2023-11-10 11:56:11,590 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-10 11:56:11,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 276 events. 40/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 793 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 175. Up to 9 conditions per place. [2023-11-10 11:56:11,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 156 transitions, 328 flow [2023-11-10 11:56:11,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 156 transitions, 328 flow [2023-11-10 11:56:11,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:56:11,601 INFO L357 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=false, 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;@6c92dcf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:56:11,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:56:11,619 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:56:11,619 INFO L124 PetriNetUnfolderBase]: 8/105 cut-off events. [2023-11-10 11:56:11,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:56:11,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:11,620 INFO L208 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] [2023-11-10 11:56:11,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:11,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash -843083430, now seen corresponding path program 1 times [2023-11-10 11:56:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305846155] [2023-11-10 11:56:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:11,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305846155] [2023-11-10 11:56:11,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305846155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:11,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:11,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:56:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449984412] [2023-11-10 11:56:11,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:11,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:11,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:56:11,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 156 [2023-11-10 11:56:11,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 156 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:11,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 156 [2023-11-10 11:56:11,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:11,746 INFO L124 PetriNetUnfolderBase]: 8/218 cut-off events. [2023-11-10 11:56:11,746 INFO L125 PetriNetUnfolderBase]: For 28/64 co-relation queries the response was YES. [2023-11-10 11:56:11,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 218 events. 8/218 cut-off events. For 28/64 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs, 0 based on Foata normal form. 110/314 useless extension candidates. Maximal degree in co-relation 144. Up to 22 conditions per place. [2023-11-10 11:56:11,747 INFO L140 encePairwiseOnDemand]: 136/156 looper letters, 12 selfloop transitions, 2 changer transitions 27/142 dead transitions. [2023-11-10 11:56:11,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 334 flow [2023-11-10 11:56:11,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-11-10 11:56:11,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8910256410256411 [2023-11-10 11:56:11,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-11-10 11:56:11,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-11-10 11:56:11,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:11,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-11-10 11:56:11,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,752 INFO L175 Difference]: Start difference. First operand has 139 places, 156 transitions, 328 flow. Second operand 3 states and 417 transitions. [2023-11-10 11:56:11,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 334 flow [2023-11-10 11:56:11,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:56:11,754 INFO L231 Difference]: Finished difference. Result has 141 places, 112 transitions, 244 flow [2023-11-10 11:56:11,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=141, PETRI_TRANSITIONS=112} [2023-11-10 11:56:11,755 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places. [2023-11-10 11:56:11,755 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 112 transitions, 244 flow [2023-11-10 11:56:11,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:11,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:11,756 INFO L208 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] [2023-11-10 11:56:11,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:56:11,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:11,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2100815433, now seen corresponding path program 1 times [2023-11-10 11:56:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:11,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446528019] [2023-11-10 11:56:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:11,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446528019] [2023-11-10 11:56:11,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446528019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:11,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950632379] [2023-11-10 11:56:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:11,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:11,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-10 11:56:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:11,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-10 11:56:11,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 11:56:11,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 11:56:11,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950632379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:11,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 11:56:11,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-10 11:56:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001645990] [2023-11-10 11:56:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:12,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:12,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:12,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:56:12,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 156 [2023-11-10 11:56:12,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 112 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:12,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 156 [2023-11-10 11:56:12,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:12,028 INFO L124 PetriNetUnfolderBase]: 0/142 cut-off events. [2023-11-10 11:56:12,028 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-10 11:56:12,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 142 events. 0/142 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 248 event pairs, 0 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2023-11-10 11:56:12,029 INFO L140 encePairwiseOnDemand]: 154/156 looper letters, 6 selfloop transitions, 0 changer transitions 1/112 dead transitions. [2023-11-10 11:56:12,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 112 transitions, 258 flow [2023-11-10 11:56:12,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-11-10 11:56:12,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8183760683760684 [2023-11-10 11:56:12,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-11-10 11:56:12,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-11-10 11:56:12,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:12,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-11-10 11:56:12,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,033 INFO L175 Difference]: Start difference. First operand has 141 places, 112 transitions, 244 flow. Second operand 3 states and 383 transitions. [2023-11-10 11:56:12,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 112 transitions, 258 flow [2023-11-10 11:56:12,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 112 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:12,036 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 242 flow [2023-11-10 11:56:12,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2023-11-10 11:56:12,039 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -19 predicate places. [2023-11-10 11:56:12,039 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 242 flow [2023-11-10 11:56:12,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:12,039 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:12,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-10 11:56:12,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:12,246 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:12,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 313935128, now seen corresponding path program 1 times [2023-11-10 11:56:12,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:12,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104189636] [2023-11-10 11:56:12,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:12,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:56:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:12,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:56:12,303 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:56:12,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:56:12,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:56:12,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:56:12,304 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-10 11:56:12,304 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:56:12,304 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-10 11:56:12,327 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-10 11:56:12,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 186 transitions, 399 flow [2023-11-10 11:56:12,373 INFO L124 PetriNetUnfolderBase]: 62/414 cut-off events. [2023-11-10 11:56:12,373 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-10 11:56:12,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 414 events. 62/414 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1341 event pairs, 1 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 284. Up to 16 conditions per place. [2023-11-10 11:56:12,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 186 transitions, 399 flow [2023-11-10 11:56:12,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 186 transitions, 399 flow [2023-11-10 11:56:12,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:56:12,387 INFO L357 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=false, 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;@6c92dcf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:56:12,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:56:12,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:56:12,393 INFO L124 PetriNetUnfolderBase]: 8/105 cut-off events. [2023-11-10 11:56:12,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:56:12,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:12,394 INFO L208 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] [2023-11-10 11:56:12,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:12,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:12,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1821498842, now seen corresponding path program 1 times [2023-11-10 11:56:12,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169674047] [2023-11-10 11:56:12,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:12,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169674047] [2023-11-10 11:56:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169674047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:56:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620444296] [2023-11-10 11:56:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:56:12,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 186 [2023-11-10 11:56:12,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 186 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:12,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 186 [2023-11-10 11:56:12,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:12,516 INFO L124 PetriNetUnfolderBase]: 16/341 cut-off events. [2023-11-10 11:56:12,517 INFO L125 PetriNetUnfolderBase]: For 58/127 co-relation queries the response was YES. [2023-11-10 11:56:12,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 341 events. 16/341 cut-off events. For 58/127 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1102 event pairs, 1 based on Foata normal form. 292/610 useless extension candidates. Maximal degree in co-relation 252. Up to 41 conditions per place. [2023-11-10 11:56:12,519 INFO L140 encePairwiseOnDemand]: 160/186 looper letters, 13 selfloop transitions, 2 changer transitions 28/166 dead transitions. [2023-11-10 11:56:12,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 166 transitions, 397 flow [2023-11-10 11:56:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2023-11-10 11:56:12,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8799283154121864 [2023-11-10 11:56:12,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2023-11-10 11:56:12,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2023-11-10 11:56:12,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:12,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2023-11-10 11:56:12,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,523 INFO L175 Difference]: Start difference. First operand has 164 places, 186 transitions, 399 flow. Second operand 3 states and 491 transitions. [2023-11-10 11:56:12,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 166 transitions, 397 flow [2023-11-10 11:56:12,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 397 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:56:12,530 INFO L231 Difference]: Finished difference. Result has 166 places, 135 transitions, 298 flow [2023-11-10 11:56:12,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=166, PETRI_TRANSITIONS=135} [2023-11-10 11:56:12,531 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 2 predicate places. [2023-11-10 11:56:12,532 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 135 transitions, 298 flow [2023-11-10 11:56:12,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:12,532 INFO L208 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] [2023-11-10 11:56:12,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:56:12,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:12,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2129146989, now seen corresponding path program 1 times [2023-11-10 11:56:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117747501] [2023-11-10 11:56:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117747501] [2023-11-10 11:56:12,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117747501] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111986179] [2023-11-10 11:56:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:12,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:12,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-10 11:56:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:12,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-10 11:56:12,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 11:56:12,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 11:56:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111986179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:12,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 11:56:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-10 11:56:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366740979] [2023-11-10 11:56:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:12,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:56:12,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 186 [2023-11-10 11:56:12,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 135 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:12,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 186 [2023-11-10 11:56:12,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:12,762 INFO L124 PetriNetUnfolderBase]: 0/191 cut-off events. [2023-11-10 11:56:12,763 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-10 11:56:12,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 191 events. 0/191 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 432 event pairs, 0 based on Foata normal form. 3/191 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2023-11-10 11:56:12,763 INFO L140 encePairwiseOnDemand]: 184/186 looper letters, 7 selfloop transitions, 0 changer transitions 1/135 dead transitions. [2023-11-10 11:56:12,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 135 transitions, 314 flow [2023-11-10 11:56:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-10 11:56:12,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8064516129032258 [2023-11-10 11:56:12,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-10 11:56:12,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-10 11:56:12,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:12,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-10 11:56:12,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,767 INFO L175 Difference]: Start difference. First operand has 166 places, 135 transitions, 298 flow. Second operand 3 states and 450 transitions. [2023-11-10 11:56:12,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 135 transitions, 314 flow [2023-11-10 11:56:12,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 135 transitions, 310 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:12,770 INFO L231 Difference]: Finished difference. Result has 145 places, 134 transitions, 294 flow [2023-11-10 11:56:12,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=145, PETRI_TRANSITIONS=134} [2023-11-10 11:56:12,772 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -19 predicate places. [2023-11-10 11:56:12,772 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 134 transitions, 294 flow [2023-11-10 11:56:12,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:12,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:12,772 INFO L208 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] [2023-11-10 11:56:12,781 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-11-10 11:56:12,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-10 11:56:12,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:12,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -418706458, now seen corresponding path program 1 times [2023-11-10 11:56:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:12,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172110436] [2023-11-10 11:56:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:13,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172110436] [2023-11-10 11:56:13,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172110436] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:13,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902653430] [2023-11-10 11:56:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:13,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:13,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:13,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:13,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-10 11:56:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:13,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:56:13,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:13,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:56:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:13,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902653430] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:56:13,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:56:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:56:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468924775] [2023-11-10 11:56:13,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:56:13,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:56:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:56:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:56:13,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 186 [2023-11-10 11:56:13,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 294 flow. Second operand has 10 states, 10 states have (on average 148.4) internal successors, (1484), 10 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:13,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 186 [2023-11-10 11:56:13,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:13,327 INFO L124 PetriNetUnfolderBase]: 0/155 cut-off events. [2023-11-10 11:56:13,327 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-10 11:56:13,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 155 events. 0/155 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 211 event pairs, 0 based on Foata normal form. 2/157 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2023-11-10 11:56:13,328 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 14 selfloop transitions, 9 changer transitions 0/144 dead transitions. [2023-11-10 11:56:13,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 362 flow [2023-11-10 11:56:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:56:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:56:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1339 transitions. [2023-11-10 11:56:13,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7998805256869773 [2023-11-10 11:56:13,330 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1339 transitions. [2023-11-10 11:56:13,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1339 transitions. [2023-11-10 11:56:13,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:13,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1339 transitions. [2023-11-10 11:56:13,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.77777777777777) internal successors, (1339), 9 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,338 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,338 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 294 flow. Second operand 9 states and 1339 transitions. [2023-11-10 11:56:13,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 362 flow [2023-11-10 11:56:13,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 144 transitions, 360 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:13,341 INFO L231 Difference]: Finished difference. Result has 154 places, 140 transitions, 342 flow [2023-11-10 11:56:13,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=342, PETRI_PLACES=154, PETRI_TRANSITIONS=140} [2023-11-10 11:56:13,342 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -10 predicate places. [2023-11-10 11:56:13,342 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 140 transitions, 342 flow [2023-11-10 11:56:13,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 148.4) internal successors, (1484), 10 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:13,343 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:13,355 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-11-10 11:56:13,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:13,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:13,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash -987996953, now seen corresponding path program 1 times [2023-11-10 11:56:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:13,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470931711] [2023-11-10 11:56:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:13,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:56:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:13,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:56:13,587 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:56:13,587 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:56:13,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:56:13,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:56:13,587 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-10 11:56:13,588 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:56:13,588 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-10 11:56:13,605 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-10 11:56:13,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 216 transitions, 472 flow [2023-11-10 11:56:13,657 INFO L124 PetriNetUnfolderBase]: 96/624 cut-off events. [2023-11-10 11:56:13,658 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-10 11:56:13,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 624 events. 96/624 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2366 event pairs, 6 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 434. Up to 32 conditions per place. [2023-11-10 11:56:13,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 216 transitions, 472 flow [2023-11-10 11:56:13,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 216 transitions, 472 flow [2023-11-10 11:56:13,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:56:13,666 INFO L357 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=false, 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;@6c92dcf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:56:13,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:56:13,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:56:13,672 INFO L124 PetriNetUnfolderBase]: 8/105 cut-off events. [2023-11-10 11:56:13,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:56:13,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:13,672 INFO L208 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] [2023-11-10 11:56:13,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:13,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1734419494, now seen corresponding path program 1 times [2023-11-10 11:56:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851740050] [2023-11-10 11:56:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:13,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:13,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851740050] [2023-11-10 11:56:13,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851740050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:13,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:13,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:56:13,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344910615] [2023-11-10 11:56:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:13,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:13,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:13,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:13,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:56:13,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2023-11-10 11:56:13,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 216 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:13,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2023-11-10 11:56:13,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:13,778 INFO L124 PetriNetUnfolderBase]: 32/532 cut-off events. [2023-11-10 11:56:13,778 INFO L125 PetriNetUnfolderBase]: For 141/241 co-relation queries the response was YES. [2023-11-10 11:56:13,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 532 events. 32/532 cut-off events. For 141/241 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2135 event pairs, 6 based on Foata normal form. 665/1161 useless extension candidates. Maximal degree in co-relation 406. Up to 76 conditions per place. [2023-11-10 11:56:13,781 INFO L140 encePairwiseOnDemand]: 184/216 looper letters, 14 selfloop transitions, 2 changer transitions 29/190 dead transitions. [2023-11-10 11:56:13,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 462 flow [2023-11-10 11:56:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2023-11-10 11:56:13,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8719135802469136 [2023-11-10 11:56:13,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2023-11-10 11:56:13,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2023-11-10 11:56:13,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:13,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2023-11-10 11:56:13,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,785 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-11-10 11:56:13,785 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-11-10 11:56:13,785 INFO L175 Difference]: Start difference. First operand has 189 places, 216 transitions, 472 flow. Second operand 3 states and 565 transitions. [2023-11-10 11:56:13,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 462 flow [2023-11-10 11:56:13,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 190 transitions, 462 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:56:13,788 INFO L231 Difference]: Finished difference. Result has 191 places, 158 transitions, 354 flow [2023-11-10 11:56:13,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=191, PETRI_TRANSITIONS=158} [2023-11-10 11:56:13,788 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, 2 predicate places. [2023-11-10 11:56:13,788 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 158 transitions, 354 flow [2023-11-10 11:56:13,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:13,789 INFO L208 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] [2023-11-10 11:56:13,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:56:13,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:13,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1928790447, now seen corresponding path program 1 times [2023-11-10 11:56:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261246856] [2023-11-10 11:56:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:13,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261246856] [2023-11-10 11:56:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261246856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:13,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929206992] [2023-11-10 11:56:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:13,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:13,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:13,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-10 11:56:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:13,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-10 11:56:13,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 11:56:13,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 11:56:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929206992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:13,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 11:56:13,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-10 11:56:13,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264062054] [2023-11-10 11:56:13,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:13,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:13,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:56:13,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2023-11-10 11:56:13,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 158 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:13,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2023-11-10 11:56:13,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:13,964 INFO L124 PetriNetUnfolderBase]: 0/240 cut-off events. [2023-11-10 11:56:13,964 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-10 11:56:13,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 240 events. 0/240 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 618 event pairs, 0 based on Foata normal form. 4/240 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2023-11-10 11:56:13,965 INFO L140 encePairwiseOnDemand]: 214/216 looper letters, 8 selfloop transitions, 0 changer transitions 1/158 dead transitions. [2023-11-10 11:56:13,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 158 transitions, 372 flow [2023-11-10 11:56:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2023-11-10 11:56:13,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7978395061728395 [2023-11-10 11:56:13,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2023-11-10 11:56:13,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2023-11-10 11:56:13,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:13,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2023-11-10 11:56:13,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,969 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-11-10 11:56:13,969 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-11-10 11:56:13,969 INFO L175 Difference]: Start difference. First operand has 191 places, 158 transitions, 354 flow. Second operand 3 states and 517 transitions. [2023-11-10 11:56:13,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 158 transitions, 372 flow [2023-11-10 11:56:13,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 158 transitions, 364 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:13,972 INFO L231 Difference]: Finished difference. Result has 170 places, 157 transitions, 346 flow [2023-11-10 11:56:13,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=170, PETRI_TRANSITIONS=157} [2023-11-10 11:56:13,972 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -19 predicate places. [2023-11-10 11:56:13,972 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 157 transitions, 346 flow [2023-11-10 11:56:13,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:13,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:13,973 INFO L208 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] [2023-11-10 11:56:13,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-10 11:56:14,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:14,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:14,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash -571128318, now seen corresponding path program 1 times [2023-11-10 11:56:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377086898] [2023-11-10 11:56:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377086898] [2023-11-10 11:56:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377086898] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548334573] [2023-11-10 11:56:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:14,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:14,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:14,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:14,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-10 11:56:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:14,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:56:14,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:14,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:56:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:14,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548334573] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:56:14,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:56:14,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:56:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694083225] [2023-11-10 11:56:14,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:56:14,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:56:14,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:56:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:56:14,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 216 [2023-11-10 11:56:14,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 157 transitions, 346 flow. Second operand has 10 states, 10 states have (on average 170.4) internal successors, (1704), 10 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:14,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:14,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 216 [2023-11-10 11:56:14,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:14,472 INFO L124 PetriNetUnfolderBase]: 0/202 cut-off events. [2023-11-10 11:56:14,472 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-10 11:56:14,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 202 events. 0/202 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 379 event pairs, 0 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2023-11-10 11:56:14,473 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 15 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2023-11-10 11:56:14,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 167 transitions, 416 flow [2023-11-10 11:56:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:56:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:56:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1538 transitions. [2023-11-10 11:56:14,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7911522633744856 [2023-11-10 11:56:14,476 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1538 transitions. [2023-11-10 11:56:14,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1538 transitions. [2023-11-10 11:56:14,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:14,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1538 transitions. [2023-11-10 11:56:14,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.88888888888889) internal successors, (1538), 9 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:14,480 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-11-10 11:56:14,481 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-11-10 11:56:14,481 INFO L175 Difference]: Start difference. First operand has 170 places, 157 transitions, 346 flow. Second operand 9 states and 1538 transitions. [2023-11-10 11:56:14,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 167 transitions, 416 flow [2023-11-10 11:56:14,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 167 transitions, 414 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:14,484 INFO L231 Difference]: Finished difference. Result has 179 places, 163 transitions, 394 flow [2023-11-10 11:56:14,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=394, PETRI_PLACES=179, PETRI_TRANSITIONS=163} [2023-11-10 11:56:14,485 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -10 predicate places. [2023-11-10 11:56:14,485 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 163 transitions, 394 flow [2023-11-10 11:56:14,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.4) internal successors, (1704), 10 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:14,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:14,486 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:14,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-10 11:56:14,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-10 11:56:14,691 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:14,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash 80112367, now seen corresponding path program 1 times [2023-11-10 11:56:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:14,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283730122] [2023-11-10 11:56:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:14,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:56:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:14,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:56:14,726 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:56:14,727 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:56:14,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:56:14,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:56:14,727 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-10 11:56:14,727 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:56:14,727 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-10 11:56:14,748 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-11-10 11:56:14,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 246 transitions, 547 flow [2023-11-10 11:56:14,849 INFO L124 PetriNetUnfolderBase]: 158/982 cut-off events. [2023-11-10 11:56:14,850 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-10 11:56:14,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 982 events. 158/982 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4415 event pairs, 23 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 669. Up to 80 conditions per place. [2023-11-10 11:56:14,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 246 transitions, 547 flow [2023-11-10 11:56:14,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 246 transitions, 547 flow [2023-11-10 11:56:14,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:56:14,867 INFO L357 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=false, 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;@6c92dcf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:56:14,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:56:14,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:56:14,872 INFO L124 PetriNetUnfolderBase]: 8/103 cut-off events. [2023-11-10 11:56:14,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:56:14,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:14,872 INFO L208 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] [2023-11-10 11:56:14,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:14,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1374063450, now seen corresponding path program 1 times [2023-11-10 11:56:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239630302] [2023-11-10 11:56:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:14,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239630302] [2023-11-10 11:56:14,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239630302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:14,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:14,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:56:14,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719136611] [2023-11-10 11:56:14,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:14,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:56:14,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 246 [2023-11-10 11:56:14,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 246 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:14,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:14,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 246 [2023-11-10 11:56:14,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:15,074 INFO L124 PetriNetUnfolderBase]: 68/863 cut-off events. [2023-11-10 11:56:15,074 INFO L125 PetriNetUnfolderBase]: For 307/440 co-relation queries the response was YES. [2023-11-10 11:56:15,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 863 events. 68/863 cut-off events. For 307/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4201 event pairs, 23 based on Foata normal form. 1423/2229 useless extension candidates. Maximal degree in co-relation 657. Up to 147 conditions per place. [2023-11-10 11:56:15,080 INFO L140 encePairwiseOnDemand]: 208/246 looper letters, 15 selfloop transitions, 2 changer transitions 30/214 dead transitions. [2023-11-10 11:56:15,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 214 transitions, 529 flow [2023-11-10 11:56:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2023-11-10 11:56:15,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8658536585365854 [2023-11-10 11:56:15,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2023-11-10 11:56:15,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2023-11-10 11:56:15,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:15,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2023-11-10 11:56:15,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,084 INFO L175 Difference]: Start difference. First operand has 214 places, 246 transitions, 547 flow. Second operand 3 states and 639 transitions. [2023-11-10 11:56:15,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 214 transitions, 529 flow [2023-11-10 11:56:15,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 214 transitions, 529 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:56:15,088 INFO L231 Difference]: Finished difference. Result has 216 places, 181 transitions, 412 flow [2023-11-10 11:56:15,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=216, PETRI_TRANSITIONS=181} [2023-11-10 11:56:15,089 INFO L281 CegarLoopForPetriNet]: 214 programPoint places, 2 predicate places. [2023-11-10 11:56:15,089 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 181 transitions, 412 flow [2023-11-10 11:56:15,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:15,089 INFO L208 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] [2023-11-10 11:56:15,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-10 11:56:15,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:15,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1483062283, now seen corresponding path program 1 times [2023-11-10 11:56:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596973950] [2023-11-10 11:56:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:15,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:15,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596973950] [2023-11-10 11:56:15,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596973950] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:15,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930817324] [2023-11-10 11:56:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:15,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:15,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:15,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:15,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-10 11:56:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:15,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-10 11:56:15,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 11:56:15,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 11:56:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930817324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:15,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 11:56:15,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-10 11:56:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678627121] [2023-11-10 11:56:15,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:15,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:15,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:15,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:56:15,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 246 [2023-11-10 11:56:15,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 181 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:15,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 246 [2023-11-10 11:56:15,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:15,276 INFO L124 PetriNetUnfolderBase]: 0/289 cut-off events. [2023-11-10 11:56:15,277 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-10 11:56:15,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 289 events. 0/289 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 800 event pairs, 0 based on Foata normal form. 5/289 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2023-11-10 11:56:15,277 INFO L140 encePairwiseOnDemand]: 244/246 looper letters, 9 selfloop transitions, 0 changer transitions 1/181 dead transitions. [2023-11-10 11:56:15,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 181 transitions, 432 flow [2023-11-10 11:56:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2023-11-10 11:56:15,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7913279132791328 [2023-11-10 11:56:15,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2023-11-10 11:56:15,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2023-11-10 11:56:15,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:15,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2023-11-10 11:56:15,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,283 INFO L175 Difference]: Start difference. First operand has 216 places, 181 transitions, 412 flow. Second operand 3 states and 584 transitions. [2023-11-10 11:56:15,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 181 transitions, 432 flow [2023-11-10 11:56:15,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 181 transitions, 418 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:15,286 INFO L231 Difference]: Finished difference. Result has 195 places, 180 transitions, 398 flow [2023-11-10 11:56:15,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=195, PETRI_TRANSITIONS=180} [2023-11-10 11:56:15,286 INFO L281 CegarLoopForPetriNet]: 214 programPoint places, -19 predicate places. [2023-11-10 11:56:15,286 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 180 transitions, 398 flow [2023-11-10 11:56:15,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:15,287 INFO L208 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] [2023-11-10 11:56:15,298 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-11-10 11:56:15,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-10 11:56:15,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:15,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash 580843550, now seen corresponding path program 1 times [2023-11-10 11:56:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493688764] [2023-11-10 11:56:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:15,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:15,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493688764] [2023-11-10 11:56:15,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493688764] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659429750] [2023-11-10 11:56:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:15,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:15,539 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:15,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-10 11:56:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:15,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:56:15,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:15,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:56:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659429750] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:56:15,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:56:15,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:56:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507987723] [2023-11-10 11:56:15,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:56:15,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:56:15,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:56:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:56:15,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 246 [2023-11-10 11:56:15,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 180 transitions, 398 flow. Second operand has 10 states, 10 states have (on average 192.4) internal successors, (1924), 10 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:15,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 246 [2023-11-10 11:56:15,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:15,759 INFO L124 PetriNetUnfolderBase]: 0/249 cut-off events. [2023-11-10 11:56:15,759 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-10 11:56:15,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 249 events. 0/249 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 547 event pairs, 0 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2023-11-10 11:56:15,760 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 16 selfloop transitions, 9 changer transitions 0/190 dead transitions. [2023-11-10 11:56:15,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 190 transitions, 470 flow [2023-11-10 11:56:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:56:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:56:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1737 transitions. [2023-11-10 11:56:15,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7845528455284553 [2023-11-10 11:56:15,764 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1737 transitions. [2023-11-10 11:56:15,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1737 transitions. [2023-11-10 11:56:15,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:15,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1737 transitions. [2023-11-10 11:56:15,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,771 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,771 INFO L175 Difference]: Start difference. First operand has 195 places, 180 transitions, 398 flow. Second operand 9 states and 1737 transitions. [2023-11-10 11:56:15,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 190 transitions, 470 flow [2023-11-10 11:56:15,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 190 transitions, 468 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:15,774 INFO L231 Difference]: Finished difference. Result has 204 places, 186 transitions, 446 flow [2023-11-10 11:56:15,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=204, PETRI_TRANSITIONS=186} [2023-11-10 11:56:15,774 INFO L281 CegarLoopForPetriNet]: 214 programPoint places, -10 predicate places. [2023-11-10 11:56:15,775 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 186 transitions, 446 flow [2023-11-10 11:56:15,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 192.4) internal successors, (1924), 10 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:15,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:15,776 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:15,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-10 11:56:15,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:15,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:15,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash 818839683, now seen corresponding path program 1 times [2023-11-10 11:56:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584471774] [2023-11-10 11:56:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-10 11:56:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584471774] [2023-11-10 11:56:16,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584471774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:16,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:16,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:56:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754042938] [2023-11-10 11:56:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:16,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:56:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:56:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:56:16,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 246 [2023-11-10 11:56:16,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 186 transitions, 446 flow. Second operand has 5 states, 5 states have (on average 173.6) internal successors, (868), 5 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:16,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:16,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 246 [2023-11-10 11:56:16,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:42,935 INFO L124 PetriNetUnfolderBase]: 110509/240138 cut-off events. [2023-11-10 11:56:42,935 INFO L125 PetriNetUnfolderBase]: For 2864/2864 co-relation queries the response was YES. [2023-11-10 11:56:44,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384365 conditions, 240138 events. 110509/240138 cut-off events. For 2864/2864 co-relation queries the response was YES. Maximal size of possible extension queue 8656. Compared 3226232 event pairs, 76730 based on Foata normal form. 3875/241133 useless extension candidates. Maximal degree in co-relation 384353. Up to 88950 conditions per place. [2023-11-10 11:56:45,500 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 38 selfloop transitions, 6 changer transitions 65/265 dead transitions. [2023-11-10 11:56:45,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 265 transitions, 842 flow [2023-11-10 11:56:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 11:56:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 11:56:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1315 transitions. [2023-11-10 11:56:45,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7636469221835076 [2023-11-10 11:56:45,503 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1315 transitions. [2023-11-10 11:56:45,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1315 transitions. [2023-11-10 11:56:45,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:45,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1315 transitions. [2023-11-10 11:56:45,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 187.85714285714286) internal successors, (1315), 7 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:45,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:45,512 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:45,512 INFO L175 Difference]: Start difference. First operand has 204 places, 186 transitions, 446 flow. Second operand 7 states and 1315 transitions. [2023-11-10 11:56:45,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 265 transitions, 842 flow [2023-11-10 11:56:45,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 265 transitions, 836 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:45,521 INFO L231 Difference]: Finished difference. Result has 214 places, 191 transitions, 508 flow [2023-11-10 11:56:45,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=214, PETRI_TRANSITIONS=191} [2023-11-10 11:56:45,522 INFO L281 CegarLoopForPetriNet]: 214 programPoint places, 0 predicate places. [2023-11-10 11:56:45,522 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 191 transitions, 508 flow [2023-11-10 11:56:45,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 173.6) internal successors, (868), 5 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:45,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:45,523 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:45,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-10 11:56:45,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:45,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:45,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1620263404, now seen corresponding path program 1 times [2023-11-10 11:56:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:45,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342119241] [2023-11-10 11:56:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-10 11:56:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342119241] [2023-11-10 11:56:45,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342119241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105785076] [2023-11-10 11:56:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:45,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:45,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:45,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:45,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-10 11:56:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:45,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-10 11:56:45,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:45,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:56:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105785076] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:56:45,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:56:45,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 20 [2023-11-10 11:56:45,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377990570] [2023-11-10 11:56:45,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:56:45,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-10 11:56:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-10 11:56:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-11-10 11:56:45,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 246 [2023-11-10 11:56:45,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 191 transitions, 508 flow. Second operand has 20 states, 20 states have (on average 148.45) internal successors, (2969), 20 states have internal predecessors, (2969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:45,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:45,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 246 [2023-11-10 11:56:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:48,258 INFO L124 PetriNetUnfolderBase]: 4213/12521 cut-off events. [2023-11-10 11:56:48,258 INFO L125 PetriNetUnfolderBase]: For 7797/7797 co-relation queries the response was YES. [2023-11-10 11:56:48,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26287 conditions, 12521 events. 4213/12521 cut-off events. For 7797/7797 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 127726 event pairs, 0 based on Foata normal form. 7336/19812 useless extension candidates. Maximal degree in co-relation 26269. Up to 2400 conditions per place. [2023-11-10 11:56:48,323 INFO L140 encePairwiseOnDemand]: 229/246 looper letters, 242 selfloop transitions, 133 changer transitions 0/490 dead transitions. [2023-11-10 11:56:48,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 490 transitions, 1944 flow [2023-11-10 11:56:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-10 11:56:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-11-10 11:56:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5612 transitions. [2023-11-10 11:56:48,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6336946702800361 [2023-11-10 11:56:48,332 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 5612 transitions. [2023-11-10 11:56:48,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 5612 transitions. [2023-11-10 11:56:48,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:48,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 5612 transitions. [2023-11-10 11:56:48,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 155.88888888888889) internal successors, (5612), 36 states have internal predecessors, (5612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:48,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 246.0) internal successors, (9102), 37 states have internal predecessors, (9102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:48,354 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 246.0) internal successors, (9102), 37 states have internal predecessors, (9102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:48,354 INFO L175 Difference]: Start difference. First operand has 214 places, 191 transitions, 508 flow. Second operand 36 states and 5612 transitions. [2023-11-10 11:56:48,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 490 transitions, 1944 flow [2023-11-10 11:56:48,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 490 transitions, 1897 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-10 11:56:48,384 INFO L231 Difference]: Finished difference. Result has 224 places, 287 transitions, 964 flow [2023-11-10 11:56:48,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=964, PETRI_PLACES=224, PETRI_TRANSITIONS=287} [2023-11-10 11:56:48,384 INFO L281 CegarLoopForPetriNet]: 214 programPoint places, 10 predicate places. [2023-11-10 11:56:48,385 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 287 transitions, 964 flow [2023-11-10 11:56:48,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 148.45) internal successors, (2969), 20 states have internal predecessors, (2969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:48,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:48,386 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:48,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-10 11:56:48,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-10 11:56:48,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:48,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash 224874800, now seen corresponding path program 1 times [2023-11-10 11:56:48,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:48,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817462646] [2023-11-10 11:56:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:48,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:56:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:56:48,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:56:48,634 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:56:48,634 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:56:48,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:56:48,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-10 11:56:48,634 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-10 11:56:48,635 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:56:48,635 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-10 11:56:48,657 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-10 11:56:48,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 276 transitions, 624 flow [2023-11-10 11:56:48,825 INFO L124 PetriNetUnfolderBase]: 284/1644 cut-off events. [2023-11-10 11:56:48,826 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2023-11-10 11:56:48,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1644 events. 284/1644 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9124 event pairs, 72 based on Foata normal form. 0/1417 useless extension candidates. Maximal degree in co-relation 1081. Up to 192 conditions per place. [2023-11-10 11:56:48,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 276 transitions, 624 flow [2023-11-10 11:56:48,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 276 transitions, 624 flow [2023-11-10 11:56:48,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:56:48,856 INFO L357 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=false, 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;@6c92dcf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:56:48,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:56:48,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:56:48,860 INFO L124 PetriNetUnfolderBase]: 8/103 cut-off events. [2023-11-10 11:56:48,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:56:48,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:48,860 INFO L208 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] [2023-11-10 11:56:48,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:48,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1737954214, now seen corresponding path program 1 times [2023-11-10 11:56:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423448219] [2023-11-10 11:56:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423448219] [2023-11-10 11:56:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423448219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:48,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:48,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:56:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360970965] [2023-11-10 11:56:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:48,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:48,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:56:48,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 276 [2023-11-10 11:56:48,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 276 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:48,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:48,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 276 [2023-11-10 11:56:48,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:49,162 INFO L124 PetriNetUnfolderBase]: 152/1482 cut-off events. [2023-11-10 11:56:49,162 INFO L125 PetriNetUnfolderBase]: For 677/841 co-relation queries the response was YES. [2023-11-10 11:56:49,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2011 conditions, 1482 events. 152/1482 cut-off events. For 677/841 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8879 event pairs, 72 based on Foata normal form. 3006/4394 useless extension candidates. Maximal degree in co-relation 1114. Up to 298 conditions per place. [2023-11-10 11:56:49,169 INFO L140 encePairwiseOnDemand]: 232/276 looper letters, 16 selfloop transitions, 2 changer transitions 31/238 dead transitions. [2023-11-10 11:56:49,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 238 transitions, 598 flow [2023-11-10 11:56:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2023-11-10 11:56:49,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2023-11-10 11:56:49,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 713 transitions. [2023-11-10 11:56:49,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 713 transitions. [2023-11-10 11:56:49,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:49,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 713 transitions. [2023-11-10 11:56:49,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,173 INFO L175 Difference]: Start difference. First operand has 239 places, 276 transitions, 624 flow. Second operand 3 states and 713 transitions. [2023-11-10 11:56:49,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 238 transitions, 598 flow [2023-11-10 11:56:49,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 238 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:56:49,176 INFO L231 Difference]: Finished difference. Result has 241 places, 204 transitions, 472 flow [2023-11-10 11:56:49,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=241, PETRI_TRANSITIONS=204} [2023-11-10 11:56:49,177 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 2 predicate places. [2023-11-10 11:56:49,177 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 204 transitions, 472 flow [2023-11-10 11:56:49,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:49,177 INFO L208 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] [2023-11-10 11:56:49,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-10 11:56:49,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:49,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 828635815, now seen corresponding path program 1 times [2023-11-10 11:56:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:49,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746953404] [2023-11-10 11:56:49,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:49,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:49,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746953404] [2023-11-10 11:56:49,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746953404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:49,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917244270] [2023-11-10 11:56:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:49,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:49,216 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:49,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-10 11:56:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:49,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-10 11:56:49,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 11:56:49,336 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 11:56:49,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917244270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:49,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 11:56:49,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-10 11:56:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356801619] [2023-11-10 11:56:49,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:56:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:56:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:56:49,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 276 [2023-11-10 11:56:49,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 204 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 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-11-10 11:56:49,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:49,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 276 [2023-11-10 11:56:49,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:49,377 INFO L124 PetriNetUnfolderBase]: 0/338 cut-off events. [2023-11-10 11:56:49,377 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-10 11:56:49,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 338 events. 0/338 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 984 event pairs, 0 based on Foata normal form. 6/338 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2023-11-10 11:56:49,377 INFO L140 encePairwiseOnDemand]: 274/276 looper letters, 10 selfloop transitions, 0 changer transitions 1/204 dead transitions. [2023-11-10 11:56:49,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 204 transitions, 494 flow [2023-11-10 11:56:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:56:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:56:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2023-11-10 11:56:49,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2023-11-10 11:56:49,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2023-11-10 11:56:49,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2023-11-10 11:56:49,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:49,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2023-11-10 11:56:49,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,381 INFO L175 Difference]: Start difference. First operand has 241 places, 204 transitions, 472 flow. Second operand 3 states and 651 transitions. [2023-11-10 11:56:49,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 204 transitions, 494 flow [2023-11-10 11:56:49,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 204 transitions, 472 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:49,384 INFO L231 Difference]: Finished difference. Result has 220 places, 203 transitions, 450 flow [2023-11-10 11:56:49,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=220, PETRI_TRANSITIONS=203} [2023-11-10 11:56:49,385 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, -19 predicate places. [2023-11-10 11:56:49,385 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 203 transitions, 450 flow [2023-11-10 11:56:49,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 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-11-10 11:56:49,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:49,385 INFO L208 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] [2023-11-10 11:56:49,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-10 11:56:49,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:49,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:49,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1257758150, now seen corresponding path program 1 times [2023-11-10 11:56:49,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:49,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518961401] [2023-11-10 11:56:49,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:49,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:49,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518961401] [2023-11-10 11:56:49,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518961401] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:56:49,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242921828] [2023-11-10 11:56:49,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:49,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:56:49,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:56:49,633 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:56:49,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-10 11:56:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:49,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:56:49,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:56:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:49,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:56:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242921828] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:56:49,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:56:49,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:56:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071286332] [2023-11-10 11:56:49,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:56:49,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:56:49,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:49,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:56:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:56:49,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2023-11-10 11:56:49,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 203 transitions, 450 flow. Second operand has 10 states, 10 states have (on average 214.4) internal successors, (2144), 10 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:49,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2023-11-10 11:56:49,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:49,850 INFO L124 PetriNetUnfolderBase]: 0/296 cut-off events. [2023-11-10 11:56:49,850 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-10 11:56:49,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 296 events. 0/296 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 716 event pairs, 0 based on Foata normal form. 2/298 useless extension candidates. Maximal degree in co-relation 0. Up to 19 conditions per place. [2023-11-10 11:56:49,851 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 17 selfloop transitions, 9 changer transitions 0/213 dead transitions. [2023-11-10 11:56:49,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 213 transitions, 524 flow [2023-11-10 11:56:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:56:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:56:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1936 transitions. [2023-11-10 11:56:49,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7793880837359098 [2023-11-10 11:56:49,854 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1936 transitions. [2023-11-10 11:56:49,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1936 transitions. [2023-11-10 11:56:49,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:49,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1936 transitions. [2023-11-10 11:56:49,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.11111111111111) internal successors, (1936), 9 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,859 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,859 INFO L175 Difference]: Start difference. First operand has 220 places, 203 transitions, 450 flow. Second operand 9 states and 1936 transitions. [2023-11-10 11:56:49,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 213 transitions, 524 flow [2023-11-10 11:56:49,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 213 transitions, 522 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:49,862 INFO L231 Difference]: Finished difference. Result has 229 places, 209 transitions, 498 flow [2023-11-10 11:56:49,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=498, PETRI_PLACES=229, PETRI_TRANSITIONS=209} [2023-11-10 11:56:49,863 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, -10 predicate places. [2023-11-10 11:56:49,863 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 209 transitions, 498 flow [2023-11-10 11:56:49,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.4) internal successors, (2144), 10 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:49,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:49,864 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:49,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-10 11:56:50,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-10 11:56:50,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:56:50,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1519812905, now seen corresponding path program 1 times [2023-11-10 11:56:50,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:50,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103119932] [2023-11-10 11:56:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:50,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-10 11:56:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:50,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103119932] [2023-11-10 11:56:50,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103119932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:56:50,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983292148] [2023-11-10 11:56:50,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:50,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:56:50,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:50,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:56:50,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:56:50,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 276 [2023-11-10 11:56:50,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 209 transitions, 498 flow. Second operand has 5 states, 5 states have (on average 191.6) internal successors, (958), 5 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:50,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:50,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 276 [2023-11-10 11:56:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand