/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_02-simple_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:55:09,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:55:09,359 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:55:09,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:55:09,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:55:09,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:55:09,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:55:09,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:55:09,391 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:55:09,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:55:09,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:55:09,394 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:55:09,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:55:09,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:55:09,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:55:09,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:55:09,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:55:09,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:55:09,396 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:55:09,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:55:09,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:55:09,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:55:09,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:55:09,397 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:55:09,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:55:09,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:55:09,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:55:09,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:55:09,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:55:09,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:55:09,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:55:09,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:55:09,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:55:09,399 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:55:09,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:55:09,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:55:09,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:55:09,600 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:55:09,600 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:55:09,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2023-11-10 11:55:10,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:55:10,805 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:55:10,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2023-11-10 11:55:10,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065395b0c/5dd81162fc0d42a4a0808467ce284a3c/FLAGf1565ea58 [2023-11-10 11:55:10,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065395b0c/5dd81162fc0d42a4a0808467ce284a3c [2023-11-10 11:55:10,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:55:10,830 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:55:10,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:55:10,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:55:10,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:55:10,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:55:10" (1/1) ... [2023-11-10 11:55:10,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2c978a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:10, skipping insertion in model container [2023-11-10 11:55:10,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:55:10" (1/1) ... [2023-11-10 11:55:10,867 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:55:11,040 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_02-simple_racefree.i[30176,30189] [2023-11-10 11:55:11,053 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:55:11,066 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:55:11,111 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_02-simple_racefree.i[30176,30189] [2023-11-10 11:55:11,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:55:11,154 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:55:11,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11 WrapperNode [2023-11-10 11:55:11,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:55:11,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:55:11,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:55:11,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:55:11,160 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:55:11" (1/1) ... [2023-11-10 11:55:11,172 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:55:11" (1/1) ... [2023-11-10 11:55:11,186 INFO L138 Inliner]: procedures = 170, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2023-11-10 11:55:11,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:55:11,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:55:11,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:55:11,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:55:11,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:55:11,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:55:11,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:55:11,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:55:11,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (1/1) ... [2023-11-10 11:55:11,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:55:11,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:55:11,236 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:55:11,239 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:55:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 11:55:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:55:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-10 11:55:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:55:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:55:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-10 11:55:11,261 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-10 11:55:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:55:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:55:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:55:11,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:55:11,262 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:55:11,367 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:55:11,368 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:55:11,516 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:55:11,523 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:55:11,523 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-10 11:55:11,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:11 BoogieIcfgContainer [2023-11-10 11:55:11,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:55:11,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:55:11,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:55:11,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:55:11,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:55:10" (1/3) ... [2023-11-10 11:55:11,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4199c929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:55:11, skipping insertion in model container [2023-11-10 11:55:11,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:11" (2/3) ... [2023-11-10 11:55:11,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4199c929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:55:11, skipping insertion in model container [2023-11-10 11:55:11,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:11" (3/3) ... [2023-11-10 11:55:11,531 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2023-11-10 11:55:11,546 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:55:11,546 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 11:55:11,547 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:55:11,617 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-10 11:55:11,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 113 transitions, 233 flow [2023-11-10 11:55:11,678 INFO L124 PetriNetUnfolderBase]: 17/151 cut-off events. [2023-11-10 11:55:11,679 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-10 11:55:11,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 151 events. 17/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-11-10 11:55:11,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 113 transitions, 233 flow [2023-11-10 11:55:11,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 108 transitions, 220 flow [2023-11-10 11:55:11,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:55:11,697 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;@4d202c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:55:11,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:55:11,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:55:11,710 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2023-11-10 11:55:11,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:11,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:11,711 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] [2023-11-10 11:55:11,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:11,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash -700284014, now seen corresponding path program 1 times [2023-11-10 11:55:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:11,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678752836] [2023-11-10 11:55:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:11,928 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:55:11,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678752836] [2023-11-10 11:55:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678752836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:11,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:11,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:55:11,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197832367] [2023-11-10 11:55:11,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:11,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:55:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:11,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:55:11,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:55:11,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2023-11-10 11:55:11,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 108 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:55:11,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:11,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2023-11-10 11:55:11,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:12,021 INFO L124 PetriNetUnfolderBase]: 0/100 cut-off events. [2023-11-10 11:55:12,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:12,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 100 events. 0/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 31/128 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2023-11-10 11:55:12,022 INFO L140 encePairwiseOnDemand]: 99/113 looper letters, 9 selfloop transitions, 2 changer transitions 17/98 dead transitions. [2023-11-10 11:55:12,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 98 transitions, 224 flow [2023-11-10 11:55:12,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:55:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:55:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-11-10 11:55:12,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.887905604719764 [2023-11-10 11:55:12,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-11-10 11:55:12,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-11-10 11:55:12,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:12,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-11-10 11:55:12,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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:55:12,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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:55:12,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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:55:12,058 INFO L175 Difference]: Start difference. First operand has 100 places, 108 transitions, 220 flow. Second operand 3 states and 301 transitions. [2023-11-10 11:55:12,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 98 transitions, 224 flow [2023-11-10 11:55:12,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 98 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:12,065 INFO L231 Difference]: Finished difference. Result has 102 places, 79 transitions, 170 flow [2023-11-10 11:55:12,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=102, PETRI_TRANSITIONS=79} [2023-11-10 11:55:12,069 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2023-11-10 11:55:12,069 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 79 transitions, 170 flow [2023-11-10 11:55:12,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:55:12,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:12,069 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] [2023-11-10 11:55:12,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:55:12,070 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:12,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:12,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1559445515, now seen corresponding path program 1 times [2023-11-10 11:55:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087917250] [2023-11-10 11:55:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:12,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:55:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:12,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:55:12,140 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:55:12,141 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:55:12,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:55:12,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:55:12,143 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-10 11:55:12,145 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:55:12,145 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-10 11:55:12,170 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 11:55:12,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 143 transitions, 302 flow [2023-11-10 11:55:12,226 INFO L124 PetriNetUnfolderBase]: 31/245 cut-off events. [2023-11-10 11:55:12,226 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-10 11:55:12,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 245 events. 31/245 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 680 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2023-11-10 11:55:12,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 143 transitions, 302 flow [2023-11-10 11:55:12,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 143 transitions, 302 flow [2023-11-10 11:55:12,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:55:12,231 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;@4d202c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:55:12,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:55:12,249 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:55:12,249 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2023-11-10 11:55:12,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:12,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:12,250 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] [2023-11-10 11:55:12,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:12,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:12,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1756559694, now seen corresponding path program 1 times [2023-11-10 11:55:12,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:12,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730354428] [2023-11-10 11:55:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:12,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:12,354 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:55:12,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:12,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730354428] [2023-11-10 11:55:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730354428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:12,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:12,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:55:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401654281] [2023-11-10 11:55:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:12,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:55:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:55:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:55:12,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 143 [2023-11-10 11:55:12,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 143 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:12,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:12,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 143 [2023-11-10 11:55:12,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:12,444 INFO L124 PetriNetUnfolderBase]: 2/196 cut-off events. [2023-11-10 11:55:12,444 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-10 11:55:12,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 196 events. 2/196 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 422 event pairs, 0 based on Foata normal form. 109/297 useless extension candidates. Maximal degree in co-relation 123. Up to 22 conditions per place. [2023-11-10 11:55:12,445 INFO L140 encePairwiseOnDemand]: 123/143 looper letters, 12 selfloop transitions, 2 changer transitions 23/129 dead transitions. [2023-11-10 11:55:12,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 308 flow [2023-11-10 11:55:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:55:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:55:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-11-10 11:55:12,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8811188811188811 [2023-11-10 11:55:12,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-11-10 11:55:12,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-11-10 11:55:12,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:12,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-11-10 11:55:12,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:55:12,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:12,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:12,452 INFO L175 Difference]: Start difference. First operand has 129 places, 143 transitions, 302 flow. Second operand 3 states and 378 transitions. [2023-11-10 11:55:12,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 129 transitions, 308 flow [2023-11-10 11:55:12,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:12,455 INFO L231 Difference]: Finished difference. Result has 131 places, 103 transitions, 226 flow [2023-11-10 11:55:12,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=131, PETRI_TRANSITIONS=103} [2023-11-10 11:55:12,456 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, 2 predicate places. [2023-11-10 11:55:12,456 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 103 transitions, 226 flow [2023-11-10 11:55:12,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:12,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:12,457 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] [2023-11-10 11:55:12,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:55:12,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:12,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash 849023762, now seen corresponding path program 1 times [2023-11-10 11:55:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:12,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351974924] [2023-11-10 11:55:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:12,575 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:55:12,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:12,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351974924] [2023-11-10 11:55:12,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351974924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:55:12,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917024141] [2023-11-10 11:55:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:12,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:55:12,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:55:12,587 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:55:12,588 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:55:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:12,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:55:12,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:55:12,754 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:55:12,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:55:12,806 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:55:12,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917024141] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:55:12,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:55:12,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:55:12,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685030402] [2023-11-10 11:55:12,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:55:12,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:55:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:12,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:55:12,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:55:12,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 143 [2023-11-10 11:55:12,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 103 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 113.4) internal successors, (1134), 10 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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:55:12,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:12,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 143 [2023-11-10 11:55:12,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:12,869 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2023-11-10 11:55:12,870 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-10 11:55:12,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 104 events. 0/104 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2023-11-10 11:55:12,871 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 9 selfloop transitions, 7 changer transitions 0/98 dead transitions. [2023-11-10 11:55:12,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 98 transitions, 246 flow [2023-11-10 11:55:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:55:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:55:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1017 transitions. [2023-11-10 11:55:12,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7902097902097902 [2023-11-10 11:55:12,874 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1017 transitions. [2023-11-10 11:55:12,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1017 transitions. [2023-11-10 11:55:12,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:12,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1017 transitions. [2023-11-10 11:55:12,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 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:55:12,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 143.0) internal successors, (1430), 10 states have internal predecessors, (1430), 0 states have call successors, (0), 0 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:55:12,882 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 143.0) internal successors, (1430), 10 states have internal predecessors, (1430), 0 states have call successors, (0), 0 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:55:12,882 INFO L175 Difference]: Start difference. First operand has 131 places, 103 transitions, 226 flow. Second operand 9 states and 1017 transitions. [2023-11-10 11:55:12,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 98 transitions, 246 flow [2023-11-10 11:55:12,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 98 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 11:55:12,885 INFO L231 Difference]: Finished difference. Result has 106 places, 94 transitions, 218 flow [2023-11-10 11:55:12,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=106, PETRI_TRANSITIONS=94} [2023-11-10 11:55:12,887 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -23 predicate places. [2023-11-10 11:55:12,887 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 94 transitions, 218 flow [2023-11-10 11:55:12,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.4) internal successors, (1134), 10 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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:55:12,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:12,889 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] [2023-11-10 11:55:12,893 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:55:13,092 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:55:13,093 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:13,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1851557052, now seen corresponding path program 1 times [2023-11-10 11:55:13,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:13,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826757358] [2023-11-10 11:55:13,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:13,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:55:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:13,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:55:13,139 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:55:13,139 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:55:13,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:55:13,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:55:13,140 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-10 11:55:13,140 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:55:13,140 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-10 11:55:13,169 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-10 11:55:13,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 173 transitions, 373 flow [2023-11-10 11:55:13,207 INFO L124 PetriNetUnfolderBase]: 50/374 cut-off events. [2023-11-10 11:55:13,207 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-10 11:55:13,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 374 events. 50/374 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1189 event pairs, 1 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 253. Up to 16 conditions per place. [2023-11-10 11:55:13,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 173 transitions, 373 flow [2023-11-10 11:55:13,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 173 transitions, 373 flow [2023-11-10 11:55:13,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:55:13,219 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;@4d202c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:55:13,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:55:13,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:55:13,223 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2023-11-10 11:55:13,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:13,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:13,223 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] [2023-11-10 11:55:13,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:13,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash -841895918, now seen corresponding path program 1 times [2023-11-10 11:55:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:13,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020480381] [2023-11-10 11:55:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:13,258 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:55:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020480381] [2023-11-10 11:55:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020480381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:13,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:55:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976762502] [2023-11-10 11:55:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:13,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:55:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:55:13,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:55:13,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 173 [2023-11-10 11:55:13,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 173 transitions, 373 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 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:55:13,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:13,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 173 [2023-11-10 11:55:13,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:13,321 INFO L124 PetriNetUnfolderBase]: 7/310 cut-off events. [2023-11-10 11:55:13,321 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-10 11:55:13,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 310 events. 7/310 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 900 event pairs, 1 based on Foata normal form. 292/588 useless extension candidates. Maximal degree in co-relation 230. Up to 41 conditions per place. [2023-11-10 11:55:13,323 INFO L140 encePairwiseOnDemand]: 147/173 looper letters, 13 selfloop transitions, 2 changer transitions 24/153 dead transitions. [2023-11-10 11:55:13,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 153 transitions, 371 flow [2023-11-10 11:55:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:55:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:55:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-11-10 11:55:13,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8709055876685935 [2023-11-10 11:55:13,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-11-10 11:55:13,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-11-10 11:55:13,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:13,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-11-10 11:55:13,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 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:55:13,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:55:13,327 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:55:13,327 INFO L175 Difference]: Start difference. First operand has 154 places, 173 transitions, 373 flow. Second operand 3 states and 452 transitions. [2023-11-10 11:55:13,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 153 transitions, 371 flow [2023-11-10 11:55:13,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 153 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:13,331 INFO L231 Difference]: Finished difference. Result has 156 places, 126 transitions, 280 flow [2023-11-10 11:55:13,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=156, PETRI_TRANSITIONS=126} [2023-11-10 11:55:13,333 INFO L281 CegarLoopForPetriNet]: 154 programPoint places, 2 predicate places. [2023-11-10 11:55:13,333 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 126 transitions, 280 flow [2023-11-10 11:55:13,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 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:55:13,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:13,334 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] [2023-11-10 11:55:13,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:55:13,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:13,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 572991662, now seen corresponding path program 1 times [2023-11-10 11:55:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:13,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076919945] [2023-11-10 11:55:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:13,404 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:55:13,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:13,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076919945] [2023-11-10 11:55:13,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076919945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:55:13,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728769808] [2023-11-10 11:55:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:13,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:55:13,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:55:13,406 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:55:13,408 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:55:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:13,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:55:13,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:55:13,511 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:55:13,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:55:13,543 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:55:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728769808] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:55:13,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:55:13,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:55:13,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732012384] [2023-11-10 11:55:13,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:55:13,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:55:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:55:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:55:13,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 173 [2023-11-10 11:55:13,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 126 transitions, 280 flow. Second operand has 10 states, 10 states have (on average 135.4) internal successors, (1354), 10 states have internal predecessors, (1354), 0 states have call successors, (0), 0 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:55:13,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:13,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 173 [2023-11-10 11:55:13,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:13,628 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2023-11-10 11:55:13,628 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-10 11:55:13,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 147 events. 0/147 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 203 event pairs, 0 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2023-11-10 11:55:13,629 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 14 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2023-11-10 11:55:13,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 348 flow [2023-11-10 11:55:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:55:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:55:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1222 transitions. [2023-11-10 11:55:13,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7848426461143224 [2023-11-10 11:55:13,631 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1222 transitions. [2023-11-10 11:55:13,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1222 transitions. [2023-11-10 11:55:13,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:13,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1222 transitions. [2023-11-10 11:55:13,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.77777777777777) internal successors, (1222), 9 states have internal predecessors, (1222), 0 states have call successors, (0), 0 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:55:13,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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:55:13,636 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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:55:13,636 INFO L175 Difference]: Start difference. First operand has 156 places, 126 transitions, 280 flow. Second operand 9 states and 1222 transitions. [2023-11-10 11:55:13,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 348 flow [2023-11-10 11:55:13,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 136 transitions, 344 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-10 11:55:13,639 INFO L231 Difference]: Finished difference. Result has 145 places, 132 transitions, 326 flow [2023-11-10 11:55:13,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=326, PETRI_PLACES=145, PETRI_TRANSITIONS=132} [2023-11-10 11:55:13,640 INFO L281 CegarLoopForPetriNet]: 154 programPoint places, -9 predicate places. [2023-11-10 11:55:13,640 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 132 transitions, 326 flow [2023-11-10 11:55:13,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.4) internal successors, (1354), 10 states have internal predecessors, (1354), 0 states have call successors, (0), 0 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:55:13,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:13,641 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] [2023-11-10 11:55:13,647 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:55:13,847 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:55:13,847 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:13,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash 765334326, now seen corresponding path program 1 times [2023-11-10 11:55:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545507813] [2023-11-10 11:55:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:13,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:55:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:13,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:55:13,891 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:55:13,891 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:55:13,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:55:13,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:55:13,892 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-10 11:55:13,892 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:55:13,892 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-10 11:55:13,912 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-10 11:55:13,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 203 transitions, 446 flow [2023-11-10 11:55:13,981 INFO L124 PetriNetUnfolderBase]: 81/575 cut-off events. [2023-11-10 11:55:13,982 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-10 11:55:13,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 575 events. 81/575 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2150 event pairs, 6 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 394. Up to 32 conditions per place. [2023-11-10 11:55:13,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 203 transitions, 446 flow [2023-11-10 11:55:13,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 203 transitions, 446 flow [2023-11-10 11:55:13,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:55:13,988 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;@4d202c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:55:13,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:55:13,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:55:13,992 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2023-11-10 11:55:13,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:13,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:13,992 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] [2023-11-10 11:55:13,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:13,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2043707314, now seen corresponding path program 1 times [2023-11-10 11:55:13,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:13,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934693819] [2023-11-10 11:55:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:13,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:14,015 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:55:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:14,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934693819] [2023-11-10 11:55:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934693819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:55:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986111087] [2023-11-10 11:55:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:14,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:55:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:55:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:55:14,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 203 [2023-11-10 11:55:14,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 203 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:55:14,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:14,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 203 [2023-11-10 11:55:14,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:14,091 INFO L124 PetriNetUnfolderBase]: 20/492 cut-off events. [2023-11-10 11:55:14,092 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-10 11:55:14,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 492 events. 20/492 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1911 event pairs, 6 based on Foata normal form. 663/1131 useless extension candidates. Maximal degree in co-relation 375. Up to 76 conditions per place. [2023-11-10 11:55:14,094 INFO L140 encePairwiseOnDemand]: 171/203 looper letters, 14 selfloop transitions, 2 changer transitions 25/177 dead transitions. [2023-11-10 11:55:14,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 177 transitions, 436 flow [2023-11-10 11:55:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:55:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:55:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2023-11-10 11:55:14,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8637110016420362 [2023-11-10 11:55:14,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2023-11-10 11:55:14,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2023-11-10 11:55:14,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:14,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2023-11-10 11:55:14,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 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:55:14,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:14,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:14,098 INFO L175 Difference]: Start difference. First operand has 179 places, 203 transitions, 446 flow. Second operand 3 states and 526 transitions. [2023-11-10 11:55:14,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 177 transitions, 436 flow [2023-11-10 11:55:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 177 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:14,100 INFO L231 Difference]: Finished difference. Result has 181 places, 149 transitions, 336 flow [2023-11-10 11:55:14,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=181, PETRI_TRANSITIONS=149} [2023-11-10 11:55:14,101 INFO L281 CegarLoopForPetriNet]: 179 programPoint places, 2 predicate places. [2023-11-10 11:55:14,101 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 149 transitions, 336 flow [2023-11-10 11:55:14,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:55:14,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:14,101 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] [2023-11-10 11:55:14,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:55:14,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:14,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash 927418186, now seen corresponding path program 1 times [2023-11-10 11:55:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:14,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518825104] [2023-11-10 11:55:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:14,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:14,154 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:55:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:14,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518825104] [2023-11-10 11:55:14,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518825104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:55:14,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372583226] [2023-11-10 11:55:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:14,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:55:14,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:55:14,156 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:55:14,158 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:55:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:14,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:55:14,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:55:14,255 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:55:14,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:55:14,280 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:55:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372583226] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:55:14,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:55:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:55:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374315703] [2023-11-10 11:55:14,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:55:14,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:55:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:55:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:55:14,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 203 [2023-11-10 11:55:14,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 149 transitions, 336 flow. Second operand has 10 states, 10 states have (on average 157.4) internal successors, (1574), 10 states have internal predecessors, (1574), 0 states have call successors, (0), 0 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:55:14,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:14,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 203 [2023-11-10 11:55:14,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:14,357 INFO L124 PetriNetUnfolderBase]: 0/190 cut-off events. [2023-11-10 11:55:14,357 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-10 11:55:14,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 190 events. 0/190 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 345 event pairs, 0 based on Foata normal form. 2/192 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2023-11-10 11:55:14,358 INFO L140 encePairwiseOnDemand]: 197/203 looper letters, 15 selfloop transitions, 9 changer transitions 0/159 dead transitions. [2023-11-10 11:55:14,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 159 transitions, 406 flow [2023-11-10 11:55:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:55:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:55:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1421 transitions. [2023-11-10 11:55:14,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-11-10 11:55:14,361 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1421 transitions. [2023-11-10 11:55:14,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1421 transitions. [2023-11-10 11:55:14,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:14,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1421 transitions. [2023-11-10 11:55:14,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 157.88888888888889) internal successors, (1421), 9 states have internal predecessors, (1421), 0 states have call successors, (0), 0 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:55:14,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 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:55:14,366 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 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:55:14,366 INFO L175 Difference]: Start difference. First operand has 181 places, 149 transitions, 336 flow. Second operand 9 states and 1421 transitions. [2023-11-10 11:55:14,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 159 transitions, 406 flow [2023-11-10 11:55:14,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 159 transitions, 398 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-10 11:55:14,370 INFO L231 Difference]: Finished difference. Result has 170 places, 155 transitions, 378 flow [2023-11-10 11:55:14,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=170, PETRI_TRANSITIONS=155} [2023-11-10 11:55:14,370 INFO L281 CegarLoopForPetriNet]: 179 programPoint places, -9 predicate places. [2023-11-10 11:55:14,371 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 155 transitions, 378 flow [2023-11-10 11:55:14,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 157.4) internal successors, (1574), 10 states have internal predecessors, (1574), 0 states have call successors, (0), 0 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:55:14,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:14,371 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] [2023-11-10 11:55:14,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-10 11:55:14,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:55:14,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:14,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash -356562627, now seen corresponding path program 1 times [2023-11-10 11:55:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:14,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144795754] [2023-11-10 11:55:14,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:14,690 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:55:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:14,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144795754] [2023-11-10 11:55:14,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144795754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:14,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:14,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:55:14,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660900767] [2023-11-10 11:55:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:14,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:55:14,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:14,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:55:14,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:55:14,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 203 [2023-11-10 11:55:14,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 155 transitions, 378 flow. Second operand has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 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:55:14,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:14,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 203 [2023-11-10 11:55:14,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:19,239 INFO L124 PetriNetUnfolderBase]: 16742/41402 cut-off events. [2023-11-10 11:55:19,239 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2023-11-10 11:55:19,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64803 conditions, 41402 events. 16742/41402 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 1767. Compared 494224 event pairs, 10951 based on Foata normal form. 750/41591 useless extension candidates. Maximal degree in co-relation 41353. Up to 14189 conditions per place. [2023-11-10 11:55:19,454 INFO L140 encePairwiseOnDemand]: 195/203 looper letters, 31 selfloop transitions, 5 changer transitions 53/219 dead transitions. [2023-11-10 11:55:19,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 219 transitions, 699 flow [2023-11-10 11:55:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 11:55:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 11:55:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1078 transitions. [2023-11-10 11:55:19,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7586206896551724 [2023-11-10 11:55:19,457 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1078 transitions. [2023-11-10 11:55:19,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1078 transitions. [2023-11-10 11:55:19,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:19,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1078 transitions. [2023-11-10 11:55:19,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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:55:19,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:55:19,463 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:55:19,463 INFO L175 Difference]: Start difference. First operand has 170 places, 155 transitions, 378 flow. Second operand 7 states and 1078 transitions. [2023-11-10 11:55:19,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 219 transitions, 699 flow [2023-11-10 11:55:19,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 219 transitions, 693 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-10 11:55:19,468 INFO L231 Difference]: Finished difference. Result has 180 places, 159 transitions, 429 flow [2023-11-10 11:55:19,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=180, PETRI_TRANSITIONS=159} [2023-11-10 11:55:19,470 INFO L281 CegarLoopForPetriNet]: 179 programPoint places, 1 predicate places. [2023-11-10 11:55:19,470 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 159 transitions, 429 flow [2023-11-10 11:55:19,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 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:55:19,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:19,471 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] [2023-11-10 11:55:19,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:55:19,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:19,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1335607777, now seen corresponding path program 1 times [2023-11-10 11:55:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996348928] [2023-11-10 11:55:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:19,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:55:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:19,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:55:19,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:55:19,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:55:19,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:55:19,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:55:19,511 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-10 11:55:19,512 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:55:19,512 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-10 11:55:19,538 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-11-10 11:55:19,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 233 transitions, 521 flow [2023-11-10 11:55:19,619 INFO L124 PetriNetUnfolderBase]: 140/924 cut-off events. [2023-11-10 11:55:19,619 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-10 11:55:19,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 924 events. 140/924 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4150 event pairs, 23 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 620. Up to 80 conditions per place. [2023-11-10 11:55:19,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 233 transitions, 521 flow [2023-11-10 11:55:19,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 233 transitions, 521 flow [2023-11-10 11:55:19,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:55:19,633 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;@4d202c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:55:19,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:55:19,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:55:19,636 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2023-11-10 11:55:19,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:19,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:19,636 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] [2023-11-10 11:55:19,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:19,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:19,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1689684590, now seen corresponding path program 1 times [2023-11-10 11:55:19,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:19,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538784624] [2023-11-10 11:55:19,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:19,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:19,668 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:55:19,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:19,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538784624] [2023-11-10 11:55:19,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538784624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:19,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:19,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:55:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29083580] [2023-11-10 11:55:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:19,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:55:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:19,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:55:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:55:19,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 233 [2023-11-10 11:55:19,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 233 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:19,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:19,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 233 [2023-11-10 11:55:19,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:19,804 INFO L124 PetriNetUnfolderBase]: 53/814 cut-off events. [2023-11-10 11:55:19,805 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-11-10 11:55:19,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 814 events. 53/814 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3820 event pairs, 23 based on Foata normal form. 1421/2193 useless extension candidates. Maximal degree in co-relation 617. Up to 147 conditions per place. [2023-11-10 11:55:19,809 INFO L140 encePairwiseOnDemand]: 195/233 looper letters, 15 selfloop transitions, 2 changer transitions 26/201 dead transitions. [2023-11-10 11:55:19,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 201 transitions, 503 flow [2023-11-10 11:55:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:55:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:55:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2023-11-10 11:55:19,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8583690987124464 [2023-11-10 11:55:19,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 600 transitions. [2023-11-10 11:55:19,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 600 transitions. [2023-11-10 11:55:19,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:19,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 600 transitions. [2023-11-10 11:55:19,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 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:55:19,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 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:55:19,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 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:55:19,814 INFO L175 Difference]: Start difference. First operand has 204 places, 233 transitions, 521 flow. Second operand 3 states and 600 transitions. [2023-11-10 11:55:19,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 201 transitions, 503 flow [2023-11-10 11:55:19,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 201 transitions, 503 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:19,817 INFO L231 Difference]: Finished difference. Result has 206 places, 172 transitions, 394 flow [2023-11-10 11:55:19,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=206, PETRI_TRANSITIONS=172} [2023-11-10 11:55:19,819 INFO L281 CegarLoopForPetriNet]: 204 programPoint places, 2 predicate places. [2023-11-10 11:55:19,819 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 172 transitions, 394 flow [2023-11-10 11:55:19,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:19,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:19,819 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] [2023-11-10 11:55:19,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:55:19,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:19,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1912303334, now seen corresponding path program 1 times [2023-11-10 11:55:19,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:19,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335601875] [2023-11-10 11:55:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:19,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:19,871 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:55:19,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:19,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335601875] [2023-11-10 11:55:19,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335601875] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:55:19,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069604241] [2023-11-10 11:55:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:19,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:55:19,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:55:19,873 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:55:19,875 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:55:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:19,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:55:19,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:55:19,982 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:55:19,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:55:20,006 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:55:20,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069604241] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:55:20,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:55:20,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:55:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185792190] [2023-11-10 11:55:20,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:55:20,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:55:20,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:55:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:55:20,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 233 [2023-11-10 11:55:20,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 172 transitions, 394 flow. Second operand has 10 states, 10 states have (on average 179.4) internal successors, (1794), 10 states have internal predecessors, (1794), 0 states have call successors, (0), 0 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:55:20,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:20,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 233 [2023-11-10 11:55:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:20,089 INFO L124 PetriNetUnfolderBase]: 0/233 cut-off events. [2023-11-10 11:55:20,089 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-10 11:55:20,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 233 events. 0/233 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 489 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2023-11-10 11:55:20,090 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 16 selfloop transitions, 9 changer transitions 0/182 dead transitions. [2023-11-10 11:55:20,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 182 transitions, 466 flow [2023-11-10 11:55:20,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:55:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:55:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1620 transitions. [2023-11-10 11:55:20,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7725321888412017 [2023-11-10 11:55:20,151 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1620 transitions. [2023-11-10 11:55:20,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1620 transitions. [2023-11-10 11:55:20,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:20,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1620 transitions. [2023-11-10 11:55:20,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 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:55:20,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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:55:20,157 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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:55:20,157 INFO L175 Difference]: Start difference. First operand has 206 places, 172 transitions, 394 flow. Second operand 9 states and 1620 transitions. [2023-11-10 11:55:20,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 182 transitions, 466 flow [2023-11-10 11:55:20,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 182 transitions, 452 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-10 11:55:20,160 INFO L231 Difference]: Finished difference. Result has 195 places, 178 transitions, 430 flow [2023-11-10 11:55:20,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=430, PETRI_PLACES=195, PETRI_TRANSITIONS=178} [2023-11-10 11:55:20,160 INFO L281 CegarLoopForPetriNet]: 204 programPoint places, -9 predicate places. [2023-11-10 11:55:20,160 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 178 transitions, 430 flow [2023-11-10 11:55:20,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 179.4) internal successors, (1794), 10 states have internal predecessors, (1794), 0 states have call successors, (0), 0 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:55:20,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:20,161 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] [2023-11-10 11:55:20,179 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:55:20,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:55:20,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:20,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash 69575505, now seen corresponding path program 1 times [2023-11-10 11:55:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111136664] [2023-11-10 11:55:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:20,468 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:55:20,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:20,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111136664] [2023-11-10 11:55:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111136664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:20,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:55:20,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790335755] [2023-11-10 11:55:20,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:20,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:55:20,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:20,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:55:20,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:55:20,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 233 [2023-11-10 11:55:20,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 178 transitions, 430 flow. Second operand has 5 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 0 states have call successors, (0), 0 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:55:20,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:20,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 233 [2023-11-10 11:55:20,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:46,053 INFO L124 PetriNetUnfolderBase]: 110509/253183 cut-off events. [2023-11-10 11:55:46,054 INFO L125 PetriNetUnfolderBase]: For 2364/2364 co-relation queries the response was YES. [2023-11-10 11:55:47,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396897 conditions, 253183 events. 110509/253183 cut-off events. For 2364/2364 co-relation queries the response was YES. Maximal size of possible extension queue 9188. Compared 3570637 event pairs, 63940 based on Foata normal form. 3875/253519 useless extension candidates. Maximal degree in co-relation 396778. Up to 88950 conditions per place. [2023-11-10 11:55:48,335 INFO L140 encePairwiseOnDemand]: 224/233 looper letters, 38 selfloop transitions, 6 changer transitions 65/257 dead transitions. [2023-11-10 11:55:48,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 257 transitions, 826 flow [2023-11-10 11:55:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 11:55:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 11:55:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1224 transitions. [2023-11-10 11:55:48,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7504598405885959 [2023-11-10 11:55:48,337 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1224 transitions. [2023-11-10 11:55:48,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1224 transitions. [2023-11-10 11:55:48,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:48,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1224 transitions. [2023-11-10 11:55:48,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 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:55:48,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:55:48,342 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:55:48,342 INFO L175 Difference]: Start difference. First operand has 195 places, 178 transitions, 430 flow. Second operand 7 states and 1224 transitions. [2023-11-10 11:55:48,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 257 transitions, 826 flow [2023-11-10 11:55:48,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 257 transitions, 820 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-10 11:55:48,347 INFO L231 Difference]: Finished difference. Result has 205 places, 183 transitions, 492 flow [2023-11-10 11:55:48,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=205, PETRI_TRANSITIONS=183} [2023-11-10 11:55:48,347 INFO L281 CegarLoopForPetriNet]: 204 programPoint places, 1 predicate places. [2023-11-10 11:55:48,348 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 183 transitions, 492 flow [2023-11-10 11:55:48,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 0 states have call successors, (0), 0 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:55:48,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:48,348 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:55:48,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-10 11:55:48,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:48,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:48,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1282325640, now seen corresponding path program 1 times [2023-11-10 11:55:48,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:48,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103653868] [2023-11-10 11:55:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:48,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:48,478 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:55:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103653868] [2023-11-10 11:55:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103653868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:48,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:48,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:55:48,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874584747] [2023-11-10 11:55:48,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:48,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:55:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:48,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:55:48,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:55:48,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 233 [2023-11-10 11:55:48,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 183 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 144.16666666666666) internal successors, (865), 6 states have internal predecessors, (865), 0 states have call successors, (0), 0 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:55:48,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:48,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 233 [2023-11-10 11:55:48,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:49,022 INFO L124 PetriNetUnfolderBase]: 343/3426 cut-off events. [2023-11-10 11:55:49,022 INFO L125 PetriNetUnfolderBase]: For 1295/1295 co-relation queries the response was YES. [2023-11-10 11:55:49,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6122 conditions, 3426 events. 343/3426 cut-off events. For 1295/1295 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 32989 event pairs, 56 based on Foata normal form. 1957/5367 useless extension candidates. Maximal degree in co-relation 5967. Up to 1002 conditions per place. [2023-11-10 11:55:49,042 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 40 selfloop transitions, 13 changer transitions 0/187 dead transitions. [2023-11-10 11:55:49,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 187 transitions, 626 flow [2023-11-10 11:55:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-10 11:55:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-10 11:55:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2023-11-10 11:55:49,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.655793991416309 [2023-11-10 11:55:49,044 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2023-11-10 11:55:49,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2023-11-10 11:55:49,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:49,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2023-11-10 11:55:49,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 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:55:49,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:55:49,047 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:55:49,047 INFO L175 Difference]: Start difference. First operand has 205 places, 183 transitions, 492 flow. Second operand 5 states and 764 transitions. [2023-11-10 11:55:49,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 187 transitions, 626 flow [2023-11-10 11:55:49,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 187 transitions, 592 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-11-10 11:55:49,056 INFO L231 Difference]: Finished difference. Result has 200 places, 183 transitions, 484 flow [2023-11-10 11:55:49,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=200, PETRI_TRANSITIONS=183} [2023-11-10 11:55:49,057 INFO L281 CegarLoopForPetriNet]: 204 programPoint places, -4 predicate places. [2023-11-10 11:55:49,057 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 183 transitions, 484 flow [2023-11-10 11:55:49,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.16666666666666) internal successors, (865), 6 states have internal predecessors, (865), 0 states have call successors, (0), 0 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:55:49,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:49,058 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] [2023-11-10 11:55:49,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-10 11:55:49,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:49,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1139355973, now seen corresponding path program 1 times [2023-11-10 11:55:49,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:49,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704951650] [2023-11-10 11:55:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:49,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:55:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:55:49,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:55:49,098 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:55:49,098 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-10 11:55:49,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-10 11:55:49,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-10 11:55:49,099 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-10 11:55:49,099 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:55:49,099 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-10 11:55:49,122 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-10 11:55:49,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 263 transitions, 598 flow [2023-11-10 11:55:49,294 INFO L124 PetriNetUnfolderBase]: 263/1577 cut-off events. [2023-11-10 11:55:49,294 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2023-11-10 11:55:49,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 1577 events. 263/1577 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8814 event pairs, 72 based on Foata normal form. 0/1371 useless extension candidates. Maximal degree in co-relation 1023. Up to 192 conditions per place. [2023-11-10 11:55:49,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 263 transitions, 598 flow [2023-11-10 11:55:49,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 263 transitions, 598 flow [2023-11-10 11:55:49,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:55:49,321 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;@4d202c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:55:49,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-10 11:55:49,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:55:49,323 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2023-11-10 11:55:49,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:49,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:49,324 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] [2023-11-10 11:55:49,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:49,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash 842830258, now seen corresponding path program 1 times [2023-11-10 11:55:49,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:49,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022301936] [2023-11-10 11:55:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:49,342 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:55:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022301936] [2023-11-10 11:55:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022301936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:49,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:49,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:55:49,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904108220] [2023-11-10 11:55:49,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:49,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:55:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:49,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:55:49,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:55:49,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 263 [2023-11-10 11:55:49,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 263 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 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:55:49,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:49,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 263 [2023-11-10 11:55:49,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:49,593 INFO L124 PetriNetUnfolderBase]: 134/1424 cut-off events. [2023-11-10 11:55:49,593 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2023-11-10 11:55:49,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 1424 events. 134/1424 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8449 event pairs, 72 based on Foata normal form. 3006/4354 useless extension candidates. Maximal degree in co-relation 1064. Up to 298 conditions per place. [2023-11-10 11:55:49,601 INFO L140 encePairwiseOnDemand]: 219/263 looper letters, 16 selfloop transitions, 2 changer transitions 27/225 dead transitions. [2023-11-10 11:55:49,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 225 transitions, 572 flow [2023-11-10 11:55:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:55:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:55:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2023-11-10 11:55:49,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8542458808618505 [2023-11-10 11:55:49,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2023-11-10 11:55:49,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2023-11-10 11:55:49,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:49,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2023-11-10 11:55:49,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:49,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 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:55:49,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 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:55:49,605 INFO L175 Difference]: Start difference. First operand has 229 places, 263 transitions, 598 flow. Second operand 3 states and 674 transitions. [2023-11-10 11:55:49,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 225 transitions, 572 flow [2023-11-10 11:55:49,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 225 transitions, 572 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:49,608 INFO L231 Difference]: Finished difference. Result has 231 places, 195 transitions, 454 flow [2023-11-10 11:55:49,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=231, PETRI_TRANSITIONS=195} [2023-11-10 11:55:49,609 INFO L281 CegarLoopForPetriNet]: 229 programPoint places, 2 predicate places. [2023-11-10 11:55:49,609 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 195 transitions, 454 flow [2023-11-10 11:55:49,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 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:55:49,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:49,610 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] [2023-11-10 11:55:49,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-10 11:55:49,610 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:49,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash -767320190, now seen corresponding path program 1 times [2023-11-10 11:55:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160431399] [2023-11-10 11:55:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:49,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:49,647 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:55:49,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160431399] [2023-11-10 11:55:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160431399] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:55:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026149380] [2023-11-10 11:55:49,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:49,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:55:49,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:55:49,649 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:55:49,651 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:55:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:49,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:55:49,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:55:49,769 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:55:49,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:55:49,793 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:55:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026149380] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:55:49,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:55:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:55:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462090189] [2023-11-10 11:55:49,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:55:49,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:55:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:49,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:55:49,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:55:49,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 263 [2023-11-10 11:55:49,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 195 transitions, 454 flow. Second operand has 10 states, 10 states have (on average 201.4) internal successors, (2014), 10 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:49,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:49,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 263 [2023-11-10 11:55:49,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:49,880 INFO L124 PetriNetUnfolderBase]: 0/276 cut-off events. [2023-11-10 11:55:49,881 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-11-10 11:55:49,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 276 events. 0/276 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 628 event pairs, 0 based on Foata normal form. 2/278 useless extension candidates. Maximal degree in co-relation 0. Up to 19 conditions per place. [2023-11-10 11:55:49,881 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 17 selfloop transitions, 9 changer transitions 0/205 dead transitions. [2023-11-10 11:55:49,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 205 transitions, 528 flow [2023-11-10 11:55:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:55:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:55:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1819 transitions. [2023-11-10 11:55:49,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7684833122095479 [2023-11-10 11:55:49,885 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1819 transitions. [2023-11-10 11:55:49,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1819 transitions. [2023-11-10 11:55:49,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:49,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1819 transitions. [2023-11-10 11:55:49,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 202.11111111111111) internal successors, (1819), 9 states have internal predecessors, (1819), 0 states have call successors, (0), 0 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:55:49,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 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:55:49,891 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 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:55:49,891 INFO L175 Difference]: Start difference. First operand has 231 places, 195 transitions, 454 flow. Second operand 9 states and 1819 transitions. [2023-11-10 11:55:49,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 205 transitions, 528 flow [2023-11-10 11:55:49,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 205 transitions, 506 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-11-10 11:55:49,896 INFO L231 Difference]: Finished difference. Result has 220 places, 201 transitions, 482 flow [2023-11-10 11:55:49,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=220, PETRI_TRANSITIONS=201} [2023-11-10 11:55:49,897 INFO L281 CegarLoopForPetriNet]: 229 programPoint places, -9 predicate places. [2023-11-10 11:55:49,897 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 201 transitions, 482 flow [2023-11-10 11:55:49,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 201.4) internal successors, (2014), 10 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:49,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:49,898 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] [2023-11-10 11:55:49,904 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:55:50,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:55:50,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:55:50,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash 509246437, now seen corresponding path program 1 times [2023-11-10 11:55:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344677203] [2023-11-10 11:55:50,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:50,189 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:55:50,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344677203] [2023-11-10 11:55:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344677203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:55:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158279191] [2023-11-10 11:55:50,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:50,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:55:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:50,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:55:50,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:55:50,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 263 [2023-11-10 11:55:50,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 201 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 0 states have call successors, (0), 0 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:55:50,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:50,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 263 [2023-11-10 11:55:50,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand